Syllabus BTech CSE III Sem 2023-2027 12.08.2024
Syllabus BTech CSE III Sem 2023-2027 12.08.2024
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Discrete 60 20 20 0 0 3 0 0
BTCS301N DCC 3
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall 2exceed more than 10 marks
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Discrete 60 20 20 0 0 3 0 0
BTCS301N DCC 3
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall 2exceed more than 10 marks
Syllabus:
UNIT I 10HRS
Set Theory
Definition of Sets, Venn Diagrams, complements, Cartesian products, power sets, counting principle,
cardinality and countability (Countable and Uncountable sets), pigeonhole principle. Relation:
Definition, types of relation, domain and range of a relation, pictorial representation of relation,
properties of relation, partial ordering relation. Function: Definition and types of function,
composition of functions, recursively defined functions.
UNIT II 9 HRS
Propositional logic
Proposition logic, basic logic, logical connectives, truth tables, tautologies, contradiction,
normalforms(conjunctive and disjunctive), modus ponens and modus tollens, validity, predicate
logic, universal and existential quantification. Notion of proof: proof by implication, converse,
inverse, contrapositive, negation, and contradiction,proof by using truth table.
UNIT IV 8 HRS
Algebraic Structure
Binary composition and its properties definition of algebraic structure; Groupoid, Semi group, Monoid
Groups, Abelian Group, properties of groups, Permutation Groups, Sub Group, Cyclic Group, Rings
and Fields (definition and standard results).
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Discrete 60 20 20 0 0 3 0 0
BTCS301N DCC 3
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall 2exceed more than 10 marks
UNIT V 9 HRS
Posets, Hasse Diagram and Lattices
Introduction, ordered set,well ordered set, Hasse diagram of partially,Lattices, properties of Lattices,
bounded and complemented lattices.Generating functions, Solution by method of generating
functions.Recurrence Relation and Generating Function: Introduction to Recurrence Relation, Linear
recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total
solutions.
Text Books:
1. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill, 8th Edition, 2021.
References:
1. Trembley, J.P &Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill,
1st Edition, 2017
2. Biswal,”Discrete Mathematics & Graph Theory”, PHI, 4thEdition, 2015.
3. Seymour Lipschutz, M.Lipson, “Discrete Mathemataics” Tata McGraw Hill, 4thEdition, 2021.
4. C.L.Liu,D. P.Mohapatra “Elements of Discrete Mathematics” Tata McGraw-Hill Edition, 4th
Edition, 2017.
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
BTCS306M DCC of Data 60 20 20 30 20 3 0 2 4
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Introduction: Overview of Data structures, Types of data structures, Primitive and Non
Primitive data structures and Operations, Introduction to Algorithms & complexity notations.
Characteristic of Array, One Dimensional Array, Operation with Array, Two Dimensional
Arrays, Three or Multi-Dimensional Arrays, Sparse matrix, Drawbacks of linear arrays.
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
BTCS306M DCC of Data 60 20 20 30 20 3 0 2 4
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Strings, Array of Structures, Pointer and one dimensional Arrays, Pointers and Two
Dimensional Arrays, Pointers and Strings, Pointer and Structure.
UNIT II 9HRS
Linked List: Linked List as an ADT, Linked List Vs. Arrays, Dynamic Memory Allocation &
De-allocation for a Linked List, Types of Linked List: Circular & Doubly Linked List. Linked
List operations: All possible insertions and deletion operations on all types of Linked list
Reverse a Single Linked List; Divide a singly linked list into two equal halves, Application of
Linked List.
UNIT IV 7HRS
Tree: Definitions and Concepts of Binary trees, Types of Binary Tree, Representation of
Binary tree: Array & Linked List. General tree, forest, Expression Tree. Forest and general
tree to binary tree conversion. Binary Search Tree Creation, Operations on Binary Search
Trees: insertion, deletion & Search an element, Traversals on Binary SEARCH TREE and
algorithms. Height balanced Tree: AVL, B-Tree, 2-3 Tree, B+Tree: Creation, Insertion &
Deletion.
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
BTCS306M DCC of Data 60 20 20 30 20 3 0 2 4
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
UNIT V 8HRS
Sortings: Sorting Concept and types of Sorting, Stable & Unstable sorting. Concept of
Insertion Sort, Selection sort, Bubble sort, Quick Sort, Merge Sort, Heap & Heap Sort, Shell
Sort & Radix sort. Algorithms and performance of Insertion, selection, bubble, Quick sort &
Merge sort.
Text Books:
CREDITS
PRACTICAL
COURSE CATEGOR
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE Y
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
BTCS306M DCC of Data 60 20 20 30 20 3 0 2 4
Structures
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
3. To implement an algorithm for insert and delete operations of circular queue and implement
the same using array.
4. Write a menu driven program to implement the push, pop and display option of the stack
with the help of static memory allocation.
5. Write a menu driven program to implement the push, pop and display option of the stack
with the help of dynamic memory allocation.
6. Write a menu driven program to implementing the various operations on a linear queue
with the help of static memory allocation.
7. Write a menu driven program to implementing the various operations on a linear queue
with the help of dynamic memory allocation.
8. Write a menu driven program to implement various operations on a linear linked list.
9. Write a menu driven program to implement various operations on a circular linked list
10. Write a program for implementation of Bubble sort
11. Write a program for Insertion sort
12. Write a program for Merge Sort
13. Write a program to implement Heap sort
14. Write a program to implement Quick sort
15. Write a program to Construct a Binary Search Tree and perform deletion, in order traversal
on it
16. Write a program to develop an algorithm for binary tree operations and implement the
same.
17. Write a program to design an algorithm for sequential search, implement and test it.
18. Write a program to develop an algorithm for binary search and perform the same.
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
*
Principles of
BTCS307M DCC Operating 60 20 20 30 20 3 0 2 4
Systems
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Introduction to Operating System: Introduction and Need of operating system, Layered
Architecture/Logical Structure of Operating system, Type of OS(Multiprogramming , Time Sharing,
Real Time ,Networked, Distributed, Clustered, Hand Held), Operating system as Resource Manager
and Virtual Machine,System Calls/Monitor Calls, Firmware- BIOS, Boot Strap Loader. Threads-
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
*
Principles of
BTCS307M DCC Operating 60 20 20 30 20 3 0 2 4
Systems
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
processes versus threads, threading, concepts, models, kernel & user level threads, thread usage,
benefits.
UNIT II 9HRS
Process Management: Process Model, Creation, Termination, States & Transitions, Context
Switching, Process Control Block, CPU and I/O bound, CPU scheduler- short, medium, long-term,
dispatcher, scheduling:- preemptive and non-preemptive, Static and Dynamic Priority
Criteria/Goals/Performance Metrics, scheduling algorithms- FCFS, SJFS, shortest remaining time,
Round robin, Priority scheduling, multilevel queue scheduling, multilevel feedback queue
scheduling.
UNIT III 8HRS
Interprocess Communication: Introduction to Message Passing, Race Condition, Critical Section
Problem, Peterson‟s Solution, Semaphore, Classical Problems of Synchronization Classical IPC
Problems: Reader‟s & Writer Problem, Dinning Philosopher Problem. Deadlock- System model,
Resource types, Deadlock Problem, Deadlock Characterization, Methods for Deadlock Handling,
Deadlock Prevention, Deadlock Avoidance: Banker‟s algorithm, Deadlock Detection, Recovery
from Deadlock.
UNIT IV 7HRS
Memory Management: concepts, functions, logical and physical address space, address binding,
degree of multiprogramming, swapping, static & dynamic loading- creating a load module,
loading, static & dynamic linking, memory allocation schemes- first fit, next fit, best fit, worst fit
and quick fit.
Virtual Memory- concept, virtual address space, paging scheme, pure segmentation and
segmentation with paging scheme hardware support and implementation details, memory
fragmentation, demand paging ,working set model, page fault frequency, thrashing, page
replacement algorithms- optimal, FIFO,LRU; Bleady‟s anomaly; TLB ( translation look aside
buffer).
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
*
Principles of
BTCS307M DCC Operating 60 20 20 30 20 3 0 2 4
Systems
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
UNIT V 8HRS
File Management: Concepts, Naming, Attributes, Operations, Types, Structure, File Organization &
Access (Sequential, Direct ,Index Sequential) Methods, Memory Mapped Files, Directory Structures
One Level, Two Level, Hierarchical/Tree, Acyclic Graph, General Graph, File System Mounting, File
Sharing, Path Name, Directory Operations, Overview Of File System in Linux & Windows.
Input/output Subsystems- Concepts, Functions/Goals, Input/Output devices- Block And Character,
Spooling, Disk Structure & Operation, Disk Attachment, Disk Storage Capacity, Disk Scheduling
Algorithm- FCFS, SSTF, Scan Scheduling, C-Scan Schedule.
Text books:
1. Abraham Silberschatz,”Operating system concepts”,10th Edition,John Willey & Sons. INC,
2018
2. Andrew S.Tannanbaum, “Modern operating system”, 4th Edition,Pearson Education, 2014
Reference Books:
1. Achyut S Godbole,”Operating System”,3rd TMH,2017.
2. William Stalling, “operating system” 8th, Pearson Education, ,2014.
3. Vijay Shukla, "Operating System", 3rd, Kataria&Sons ,2013.
4. Singhal&Shivratri,”Advanced Concept in Operating Systems”, 1st ,TataMc-Graw Hill Education,
edition 2017.
CREDITS
PRACTICAL
COURSE
CATEGORY COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE
Teachers
Teachers
Exam
Exam
Exam
*
*
Principles of
BTCS307M DCC Operating 60 20 20 30 20 3 0 2 4
Systems
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Software
BTCS402N Engineering
DCC 60 20 20 30 20 3 0 2 4
and Project
Management
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 10HRS
Introduction to Software Engineering: The evolving role of software, changing nature of software,
software myths.
A Generic view of process: Software engineering- a layered technology, a process framework, the
capability maturity model integration (CMMI), process patterns, process assessment, personal and team
process models.
Chairperson Chairperson Controller of Examination Joint Registrar
Board of Studies Faculty of Studies Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Shri Vaishnav Vidyapeeth Shri Vaishnav Vidyapeeth
Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Vishwavidyalaya, Indore Vishwavidyalaya, Indore
Shri Vaishnav Vidyapeeth Vishwavidyalaya
Shri Vaishnav Institute Of Information Technology
B.Tech(CSE), B.Tech+MBA(CSE) and B.Tech+M.Tech(CSE)
Choice Based Credit System (CBCS)-2023-27
SEMESTER-III
TEACHING & EVALUATION SCHEME L T P
THEORY
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Software
BTCS402N Engineering
DCC 60 20 20 30 20 3 0 2 4
and Project
Management
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
Process models: The waterfall model, incremental process models, evolutionary process models,
the unified process. Agile development-Agile Process, Extreme Programming
UNIT II 9HRS
Software Requirements: Functional and non-functional requirements, user requirements, system
requirements, interface specification, the software requirements document.
Requirements engineering process: Feasibility studies, requirements elicitation and analysis,
requirements validation, requirements management.
System models: Context models, behavioral models, data models, object models, structured methods.
UNIT IV 7HRS
SOFTWARE IMPLEMENTATION:- Structured coding Techniques, Coding Styles, Standards and
Guidelines, Documentation Guidelines-Modern Programming Language Features: Type checking-User
defined data types-Data Abstraction-Exception Handling- Concurrency Mechanism.
Testing Strategies: A strategic approach to software testing, test strategies for conventional software,
black-box and white-box testing, Object oriented software, Web
Apps-validation testing, system testing, the art of debugging.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Software
BTCS402N Engineering
DCC 60 20 20 30 20 3 0 2 4
and Project
Management
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
UNIT V 8HRS
Metrics for Process and Products: Software measurement, metrics for software quality. Quality
Management: Quality concepts, software quality assurance, software reviews, formal technical reviews,
statistical software quality assurance, software reliability, the ISO 9000 quality
standards.
Risk management: Reactive Vs proactive risk strategies, software risks, risk identification, risk
projection, risk refinement, RMMM, RMMM plan.
MAINTENANCE: Software Maintenance-Software Supportability- Reengineering-
Business Process Reengineering- Software Reengineering- Reverse Engineering-
Restructuring- Forward Engineering- Economics of Reengineering
Text Books:
1. Software Engineering, A practitioner‟s Approach- Roger S. Pressman, 6th edition, Mc Graw
Hill International Edition.
References:
1. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John
Wiley.
2. Software Engineering principles and practice- Waman S Jawadekar, The Mc Graw-Hill
Companies.
3. Fundamentals of object-oriented design using UML Meiler page-Jones: Pearson Education.
4. Rajib Mall, “Fundamentals of Software Engineering” Second Edition, PHI Learning.
5. Software Engineering- Sommerville, 7th edition, Pearson Education.
6. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson,
Pearson Education.
7. Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005.
8. Richard H.Thayer,”SoftwareEnginerring& Project Managements”,Willey India
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Software
BTCS402N Engineering
DCC 60 20 20 30 20 3 0 2 4
and Project
Management
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
of Information 2 0 2
BTDSE321M DSE 60 20 20 30 20 3
Theory and
Coding
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
1. To provide an insight into the concept of information in the context of communication theory
and its significance in the design of communication receivers.
2. To explore in detail, the calculations of channel capacity to support error-free transmission and,
commonly used source coding and channel coding algorithms.
3. To encourage and train to design coding schemes for data compression and error correction, and
they will also get an overall perspective of how this impacts the design of an optimum
communication receiver.
2. CO2: Derive equations for entropy, mutual information, and channel capacity for all kinds of
channels.
3. CO3: Implement the various types of source coding algorithms and analyse their performance.
4. CO4: Explain various methods of generating and detecting different types of error correcting
codes.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
of Information 2 0 2
BTDSE321M DSE 60 20 20 30 20 3
Theory and
Coding
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
5. CO5: Design linear block codes and cyclic codes (encoding and decoding).
6. CO6: Implement and decode a sequence at the receiver using Trellis decoder and Viterbi
decoder.
7. CO7: understand and implement the concept of cryptography and various Algorithms.
UNIT I
Introduction of Information Theory: Introduction, Measure of information, Mark off statistical
model for information source, Entropy, and information rate of mark off source. Mutual Information,
Conditional and Joint Entropy
UNIT II
Source Coding: Encoding of the source output, Shannon‟s encoding algorithm, Communication
Channels, Discrete communication channels, Continuous channels. Fundamental Limits on
Performance: Source coding theorem, Huffman coding, Discrete memory less Channels, Channel
Capacity.
UNIT III
Channel: Channel coding theorem, Differential entropy and mutual information for continuous
ensembles, Channel capacity Theorem Introduction. Introduction to Error Control Coding: Types of
errors, examples, Types of codes Linear Block Codes: Matrix description, Error detection and
correction, Standard arrays and table look up for decoding.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
of Information 2 0 2
BTDSE321M DSE 60 20 20 30 20 3
Theory and
Coding
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
UNIT IV
Cyclic Codes: Binary Cycle Codes, Algebraic structures of cyclic codes, Encoding using an (n-k) bit
shift register, Syndrome calculation. BCH codes. RS codes, Golay codes, shortened cyclic codes, Burst
error correcting codes. Burst and Random Error correcting codes. Convolution Codes: Convolution
Codes, Time domain approach. Transform domain approach.
UNIT V
Introduction to Cryptography: Symmetric Key and Asymmetric Key Cryptography,known Algorith
ms: DES, IDEA, PGP, RSA.
Reference Book:
1.W. Stallings, Cryptography and Network Security: Principles and Practice, 4th Edition, Prentice
Hall, 2006.
2.B. Schneier, Applied Cryptography: Protocols, Algorithms and Source Code in C, John Wiley &
Sons, 2nd Edition, 1995.
3.Digital Communications Glover and Grant, Pearson Ed. 2nd Ed 2008.
4.Information Theory and Coding, K. N. Hari Bhat, D. Ganesh Rao, Cengage, 2017.
5. Digital and analog communication systems, K. Sam Shanmugam, Wiley,1996.
6. Digital communication, Simon Haykin, Wiley, 2003.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Fundamentals
of Information 2 0 2
BTDSE321M DSE 60 20 20 30 20 3
Theory and
Coding
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
CREDITS
THEORY PRACTI
COURSE CATEGO COURSE CAL
L T P
Assessment*
Assessment*
CODE RY NAME
END SEM
END SEM
University
University
Two Term
Teachers
Teachers
Exam
Exam
Exam
Principles of
BTDSE
DSE Programming 60 20 20 30 20 2 0 2 3
322M
Languages
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit.
*Teacher Assessment shall be based on the following components: Quiz/Assignment/
Project/Participation in Class, given that no component shall exceed more than 10 marks.
UNIT II Data Types: Introduction, Primitive, Character, User Defined, Record, 8HRS
Union, Pointer and Reference Types, Design and Implementation Uses
Related to these Types. Names, Variable, Concept of Binding
UNIT III Expressions and Statements: Arithmetic Relational and Boolean 8HRS
Expressions, Short Circuit Evaluation Mixed Mode Assignment,
Assignment Statements, Control Structures.
Textbooks:
1. Robert .W. Sebesta “Concepts of Programming Languages”, 10th Edition, Pearson Education,
2008.
References:
1. Gabbrielli and Martini “Programming Languages: Principles and Paradigms., Springer, 2010.
2. Peter Sestoft,“Programming Language Concepts”, Springer, 2017.
3. A.B. Tucker, R.E. Noonan, “Programming Languages”, 2nd Edition, Tata McGraw Hill.
4. Terrance W Pratt, "Programming Languages: Design and Implementation" Pearson Education.
5. D. A. Watt, “Programming Language Design Concepts, Wiley dreamtech, rp-2007.
6. Louden and Lambart, “Programming Languages: Principles and Practices”, 3rd Edition,
Cengage Learning, 2011.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Modern
BTDSE323M DSE Computing 60 20 20 30 20 2 0 2 3
Hardware
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
Syllabus:
UNITI 8HRS
Hardware Organization: Motherboards, Chipset and Controllers, Types of processors (Intel Core
i3/ i5 /i7 /i9 & AMD) and their compatibility with motherboards, USB Ports, HDMI, DVI,
Interconnection between units, Graphic cards.
UNIT II 6HRS
Memory& Storage Devices: Introduction to memory, classification of Memory and its use,
Overview Memory chips and Modules, and its working principle and Trouble shooting of
Memory.DVD & Blue-Ray Disk, Hard Disk Drives, Solid-State Drives, USB Flash Drives.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Modern
BTDSE323M DSE Computing 60 20 20 30 20 2 0 2 3
Hardware
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
UNIT IV 4 HRS
Basic Input/output System: Concept of BIOS. Function of BIOS, software interrupts,testing
and initialization, configuring the system.
UNIT V 6 HRS
Peripherals &Device Drivers: Input devices: Wireless Keyboard & Mouse, Light-Pen,
Touch Screen, HD web camera, Barcode Reader, Output devices: Touch Screen Monitor, 3D
Printer, Projector, Software drivers for various devices and their role.
TextBooks:
1. Craig Zacker& John Rourtre, PC Hardware- The complete reference, First Edition,
TMH, 2017
References:
1. Stephen Bigelow, Bigelow's Troubleshooting, Maintaining & Repairing PCs, 5 edition,
McGraw Hill Education, 2017
2. Vikas Gupta, Comdex Hardware and Networking Course Kit: Revised & Upgraded,
Dreamtech Press,2014
3. Dan Gookin, Troubleshooting and Maintaining Your PC All–in–One For Dummies,
3rd edition, John Wiley & Sons,2017
4. Robert Bruce Thompson, Barbara Fritchman Thompson, Building the Perfect PC, 3
edition, O′Reilly,2010
5. B. Govindarajalu, IBM PC and CLONES: Hardware, Troubleshooting and Maintenance
McGraw Hill Education, 2nd Edition2002.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Modern
BTDSE323M DSE Computing 60 20 20 30 20 2 0 2 3
Hardware
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
6. Mike Meyers, Introduction to PC Hardware and Troubleshooting, 1st edition, McGraw Hill
Education,2017
1. Hardware Organization:
- Assembling and disassembling a desktop computer.
- Identifying major components on a motherboard (CPU socket, RAM slots, expansion slots, etc.).
- Understanding different form factors (ATX, micro-ATX, mini-ITX) and their implications.
3. Power Supply:
- Understanding power supply unit (PSU) ratings and connectors.
- Testing the output voltage of a power supply unit using a multimeter.
- Troubleshooting common power supply issues like voltage fluctuations or overheating.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Modern
BTDSE323M DSE Computing 60 20 20 30 20 2 0 2 3
Hardware
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in
Class, given that no component shall exceed more than 10 marks.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Introduction 0 0 2
BTIT307N SEC 0 0 0 30 20 1
to core JAVA
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
Syllabus:
UNIT I 12HRS
Introduction to Java: Java‟s magic, The Byte code,Java Development Kit (JDK), Java Buzzwords,
Object oriented programming, Simple Java programs, Data types, variables and arrays, Operators,
Control Statements.
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Introduction 0 0 2
BTIT307N SEC 0 0 0 30 20 1
to core JAVA
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.
UNIT II 8HRS
Classes, Inheritance, Packages and Interfaces: Classes: Classes fundamentals, Declaring objects,
Constructors, this keyword, garbage collection. Inheritance: inheritance basics, using super, creating
multi level hierarchy, method overriding. Packages, Access Protection, Importing Packages, Interfaces.
UNIT IV 8HRS
Understanding Threads, Needs of Multi-Threaded Programming, Thread Life Cycle, Thread Priorities
,Synchronizing Threads,
UNIT V 8HRS
The Java Library: String Handling, Exploring Java.Lang, Java.Util – The Collection Framework,
Exploring Java.IO.
Text Books:
1. E. Balagurusamy, “Programming with java A Primer”, Fourth Edition, Tata McGraw Hill, 2009
References:
2. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson Education/PHI.
3. Introduction to Java programming, By Y.DanielLiang,Pearson Publication.
4. SouravSahay, Object Oriented Programming with C++ , Oxford University Press,2006
5. Herbert Schildt, “The Complete Reference Java”, Ninth Edition, McGraw Hill, 2014
6. Bert Bates, Kathy Sierra, “Head First Java”, 2nd Edition, O‟ Reilly, 2005
CREDITS
PRACTICAL
COURSE CATEG
COURSE NAME
Assessment
Assessment
END SEM
END SEM
University
University
Two Term
CODE ORY
Teachers
Teachers
Exam
Exam
Exam
*
*
Introduction 0 0 2
BTIT307N SEC 0 0 0 30 20 1
to core JAVA
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P – Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class,
given that no component shall exceed more than 10 marks.