<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 1 Syllabus
</h1>

 
 Course Code:
 
 DCS101


 
 Course Title:
 
 Fundamentals of Computer Science


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To introduce basic concepts of computer hardware and software.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To develop fundamental programming skills.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand data representation and number systems.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to understand the basic components of a computer system.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to write simple programs using a high-level programming language.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to convert numbers between different number systems.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Computers:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 History and evolution of computers
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Types of computers: Micro, Mini, Mainframe, Supercomputer
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Components of a computer: CPU, Memory, I/O devices
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Software: System software, Application software
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Programming Fundamentals:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Introduction to programming languages
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Algorithms and flowcharts
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Basic data types: Integer, Float, Character, String
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Variables and constants
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Operators and expressions
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Control Structures:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Sequential, selection, and iterative statements
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 <code>
 if
 </code>
 ,
 <code>
 if-else
 </code>
 ,
 <code>
 switch
 </code>
 statements
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 <code>
 for
 </code>
 ,
 <code>
 while
 </code>
 ,
 <code>
 do-while
 </code>
 loops
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Data Representation:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Number systems: Binary, Octal, Decimal, Hexadecimal
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Conversion between number systems
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Character encoding: ASCII, Unicode
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Operating Systems:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Functions of an operating system
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Types of operating systems: Batch, Time-sharing, Real-time
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 File systems
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Computer Fundamentals" by P.K. Sinha
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Let Us C" by Yashavant Kanetkar
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Programming in ANSI C" by E. Balagurusamy
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Operating System Concepts" by Abraham Silberschatz
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 2 Syllabus
</h1>

 
 Course Code:
 
 DCS102


 
 Course Title:
 
 Data Structures and Algorithms


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand fundamental data structures.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To learn various algorithms for searching and sorting.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To implement data structures using a programming language.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to implement various data structures.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to analyze the efficiency of algorithms.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to choose appropriate data structures for specific applications.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Data Structures:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Abstract Data Types (ADTs)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Arrays: Single and multi-dimensional arrays
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Linked Lists: Singly, doubly, and circular linked lists
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Stacks and Queues:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Stacks: Operations, applications (e.g., expression evaluation)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Queues: Operations, types (e.g., circular queue, priority queue)
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Trees:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Binary Trees: Representation, traversal (inorder, preorder, postorder)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Binary Search Trees (BSTs): Operations (search, insert, delete)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 AVL Trees: Balancing, rotations
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Searching and Sorting:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Searching: Linear search, binary search
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Sorting: Bubble sort, insertion sort, selection sort, merge sort, quicksort
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Hashing: Hash functions, collision resolution techniques
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Graphs:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Graph representation: Adjacency matrix, adjacency list
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Graph traversal: Breadth-First Search (BFS), Depth-First Search (DFS)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Shortest path algorithms: Dijkstra's algorithm
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Data Structures and Algorithms" by Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Introduction to Algorithms" by Thomas H. Cormen
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Data Structures Using C" by Reema Thareja
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Algorithms" by Robert Sedgewick
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 3 Syllabus
</h1>

 
 Course Code:
 
 DCS201


 
 Course Title:
 
 Object-Oriented Programming


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the principles of object-oriented programming.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To learn a popular object-oriented programming language (e.g., Java, C++).
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To develop applications using object-oriented concepts.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to design and implement object-oriented solutions.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to use inheritance, polymorphism, and encapsulation.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to develop robust and maintainable software.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Object-Oriented Programming:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Procedural vs. Object-Oriented Programming
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Objects and Classes
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Encapsulation, Abstraction, Inheritance, Polymorphism
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Classes and Objects:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Defining classes
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Creating objects
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Constructors and Destructors
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Access modifiers: public, private, protected
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Inheritance:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Single inheritance
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Multiple inheritance
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Hierarchical inheritance
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Abstract classes and interfaces
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Polymorphism:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Function overloading
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Operator overloading
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Virtual functions
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Dynamic binding
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Exception Handling:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Try, catch, throw
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Custom exceptions
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Exception handling mechanisms
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Object-Oriented Programming with C++" by E. Balagurusamy
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Head First Java" by Kathy Sierra and Bert Bates
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "The C++ Programming Language" by Bjarne Stroustrup
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Effective Java" by Joshua Bloch
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 4 Syllabus
</h1>

 
 Course Code:
 
 DCS202


 
 Course Title:
 
 Database Management Systems


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the fundamentals of database management systems.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To learn SQL for data definition and manipulation.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To design and implement relational databases.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to design relational database schemas.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to write SQL queries to retrieve and manipulate data.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to implement database applications.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to DBMS:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Database concepts
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Database models: Hierarchical, Network, Relational
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 DBMS architecture
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Data independence
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Relational Model:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Relations, attributes, tuples
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Keys: Primary key, foreign key
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Relational algebra
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Relational calculus
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 SQL:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Data Definition Language (DDL): CREATE, ALTER, DROP
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Data Manipulation Language (DML): SELECT, INSERT, UPDATE, DELETE
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Data Control Language (DCL): GRANT, REVOKE
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Joins, subqueries, aggregate functions
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Database Design:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Entity-Relationship (ER) model
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Normalization: 1NF, 2NF, 3NF, BCNF
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Database design process
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Transaction Management:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 ACID properties
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Concurrency control
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Locking mechanisms
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Recovery techniques
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Database System Concepts" by Abraham Silberschatz, Henry F. Korth, S. Sudarshan
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Fundamentals of Database Systems" by Ramez Elmasri and Shamkant B. Navathe
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "SQL Cookbook" by Anthony Molinaro
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Database Management Systems" by Raghu Ramakrishnan and Johannes Gehrke
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 5 Syllabus
</h1>

 
 Course Code:
 
 DCS301


 
 Course Title:
 
 Operating Systems


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the fundamental concepts of operating systems.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To learn about process management, memory management, and file systems.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the principles of operating system design.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to describe the architecture and functions of operating systems.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to implement process and memory management algorithms.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to analyze the performance of operating systems.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Operating Systems:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Operating system structure
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Operating system services
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 System calls
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Types of operating systems: Batch, Time-sharing, Real-time
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Process Management:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Process concept
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Process scheduling
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Inter-process communication (IPC)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Process synchronization
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Deadlocks
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Memory Management:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Memory allocation
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Paging
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Segmentation
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Virtual memory
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 File Systems:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 File concept
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 File organization
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 File access methods
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Directory structure
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 File system implementation
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 I/O Systems:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 I/O hardware
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 I/O software
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Disk management
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Operating System Concepts" by Abraham Silberschatz, Peter Baer Galvin, Greg Gagne
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Modern Operating Systems" by Andrew S. Tanenbaum
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Operating Systems: Design and Implementation" by Andrew S. Tanenbaum
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Understanding the Linux Kernel" by Daniel P. Bovet and Marco Cesati
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

<h1 style="color: #2a4978; font-family: poppins; font-weight: 600">
 Semester 6 Syllabus
</h1>

 
 Course Code:
 
 DCS302


 
 Course Title:
 
 Computer Networks


 
 Credits:
 
 4


 
 Course Objectives:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the fundamental concepts of computer networks.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To learn about network protocols and architectures.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 To understand the principles of network design.
 </li>
</ul>

 
 Course Outcomes:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to describe the architecture and functions of computer networks.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to implement network protocols.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Students will be able to analyze the performance of computer networks.
 </li>
</ul>

 
 Units:
 

<ol>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Introduction to Computer Networks:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Network topologies
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Network types: LAN, MAN, WAN
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Network models: OSI, TCP/IP
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Network devices: Hub, Switch, Router
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Data Communication:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Transmission media: Wired, Wireless
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Encoding and modulation
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Multiplexing
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Switching techniques
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Network Layer:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 IP addressing
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Routing algorithms
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Subnetting
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internet Control Message Protocol (ICMP)
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Transport Layer:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 User Datagram Protocol (UDP)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Transmission Control Protocol (TCP)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Congestion control
 </li>
 </ul>
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Application Layer:
 
 <ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Hypertext Transfer Protocol (HTTP)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Simple Mail Transfer Protocol (SMTP)
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Domain Name System (DNS)
 </li>
 </ul>
 </li>
</ol>

 
 Textbooks:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Computer Networking: A Top-Down Approach" by Kurose and Ross
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Data Communications and Networking" by Behrouz A. Forouzan
 </li>
</ul>

 
 Reference Books:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "Computer Networks" by Andrew S. Tanenbaum
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 "TCP/IP Illustrated" by W. Richard Stevens
 </li>
</ul>

 
 Assessment:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 Internal Assessment: 30%
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 End Semester Exam: 70%
 </li>
</ul>

Image 1

```markdown
Choosing the right path in computer science and engineering can be daunting. For Indian students, understanding the differences between a Diploma in Computer Science and Engineering and a Bachelor of Technology (B.Tech) in Computer Science and Engineering is crucial. This comparison highlights key aspects to help you make an informed decision.


 
 Diploma in Computer Science and Engineering:
 


 A Diploma in Computer Science and Engineering is a shorter, more vocational-oriented program, typically lasting 2-3 years. It focuses on providing practical skills and knowledge required for immediate entry-level jobs in the industry.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Duration:
 
 2-3 years
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Practical skills, hands-on training
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Path:
 
 Entry-level technician roles, junior programmer
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Further Education:
 
 Can be a pathway to B.Tech through lateral entry
 </li>
</ul>

 
 B.Tech in Computer Science and Engineering:
 


 A B.Tech in Computer Science and Engineering is a four-year undergraduate degree that provides a comprehensive understanding of the theoretical and practical aspects of computer science. It prepares students for a wide range of roles in the IT industry and beyond.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Duration:
 
 4 years
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Theoretical knowledge, problem-solving, research
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Path:
 
 Software Engineer, Data Scientist, System Analyst, and more
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Further Education:
 
 Opens doors to M.Tech, MBA, and research opportunities
 </li>
</ul>

 
 Detailed Comparison Table:
 

<table>
 <thead>
 <tr>
 <th>
 Feature
 </th>
 <th>
 Diploma in Computer Science &amp; Engineering
 </th>
 <th>
 B.Tech in Computer Science &amp; Engineering
 </th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td>
 Duration
 </td>
 <td>
 2-3 years
 </td>
 <td>
 4 years
 </td>
 </tr>
 <tr>
 <td>
 Curriculum
 </td>
 <td>
 Practical, vocational
 </td>
 <td>
 Theoretical and practical
 </td>
 </tr>
 <tr>
 <td>
 Career Opportunities
 </td>
 <td>
 Technician, Junior Programmer
 </td>
 <td>
 Software Engineer, Data Scientist
 </td>
 </tr>
 <tr>
 <td>
 Further Education
 </td>
 <td>
 Lateral entry to B.Tech
 </td>
 <td>
 M.Tech, MBA, Ph.D.
 </td>
 </tr>
 <tr>
 <td>
 Salary
 </td>
 <td>
 Generally lower than B.Tech graduates
 </td>
 <td>
 Higher earning potential
 </td>
 </tr>
 </tbody>
</table>

 
 Which is Right for You?
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose Diploma if:
 
 You want to quickly enter the workforce with specific technical skills.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose B.Tech if:
 
 You seek a deeper understanding of computer science principles and aspire to higher-level roles and further education.
 </li>
</ul>

 For Indian students, consider your long-term career goals, financial situation, and academic interests when making this important decision. Both paths offer valuable opportunities in the rapidly growing field of computer science.
```

Diploma in Computer Science and Engineering vs. B.Tech in Computer Science and Engineering: A Comprehensive Comparison

```markdown
For Indian students aspiring to build a career in the tech industry, choosing between a Diploma in Computer Science and Engineering and a Diploma in Information Technology (IT) can be a critical decision. While both fields are closely related, they have distinct focuses and career paths. This comparison aims to clarify the key differences to help you make an informed choice.


 
 Diploma in Computer Science and Engineering:
 


 This diploma focuses on the fundamental principles of computer science, including software development, hardware design, and computer architecture. It provides a strong foundation in programming, data structures, and algorithms.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Core computer science principles, software and hardware
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Skills:
 
 Programming, problem-solving, system design
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Paths:
 
 Programmer, Hardware Technician, System Administrator
 </li>
</ul>

 
 Diploma in Information Technology:
 


 This diploma is more application-oriented, focusing on the use of technology to solve business problems. It covers topics such as network administration, database management, and IT support.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Application of technology in business environments
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Skills:
 
 Network management, database administration, IT support
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Paths:
 
 IT Support Specialist, Network Administrator, Database Administrator
 </li>
</ul>

 
 Detailed Comparison Table:
 

<table>
 <thead>
 <tr>
 <th>
 Feature
 </th>
 <th>
 Diploma in Computer Science &amp; Engineering
 </th>
 <th>
 Diploma in Information Technology
 </th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td>
 Core Focus
 </td>
 <td>
 Computer Science Principles
 </td>
 <td>
 Application of Technology
 </td>
 </tr>
 <tr>
 <td>
 Curriculum Emphasis
 </td>
 <td>
 Programming, Hardware
 </td>
 <td>
 Networking, Database
 </td>
 </tr>
 <tr>
 <td>
 Problem-Solving Approach
 </td>
 <td>
 Algorithmic, System-Level
 </td>
 <td>
 Business-Oriented
 </td>
 </tr>
 <tr>
 <td>
 Career Opportunities
 </td>
 <td>
 Programmer, Hardware Technician
 </td>
 <td>
 IT Support, Network Admin
 </td>
 </tr>
 </tbody>
</table>

 
 Which Diploma is Right for You?
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose Computer Science if:
 
 You enjoy programming, problem-solving, and understanding how computers work at a fundamental level.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose Information Technology if:
 
 You are interested in applying technology to solve business problems and enjoy working with networks and databases.
 </li>
</ul>

 For Indian students, consider your interests, strengths, and career aspirations when choosing between these two diplomas. Both offer promising career opportunities in the rapidly evolving tech landscape.
```

Diploma in Computer Science and Engineering vs. Diploma in Information Technology: Key Differences for Indian Students

```markdown
For Indian students aiming for a career in the IT sector, choosing between a Diploma in Computer Science and Engineering and a Bachelor of Computer Applications (BCA) is a common dilemma. Both options offer pathways into the industry, but they differ significantly in terms of duration, curriculum, and career prospects. This comparison provides a detailed overview to help you make the right choice.


 
 Diploma in Computer Science and Engineering:
 


 A Diploma in Computer Science and Engineering is a shorter, more practical-oriented program, typically lasting 2-3 years. It focuses on providing hands-on skills and knowledge for immediate employment in entry-level positions.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Duration:
 
 2-3 years
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Practical skills, hands-on training
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Curriculum:
 
 Programming fundamentals, hardware basics, software installation
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Path:
 
 Technician roles, junior programmer, IT support
 </li>
</ul>

 
 BCA (Bachelor of Computer Applications):
 


 A BCA is a three-year undergraduate degree that provides a broader understanding of computer applications and software development. It covers topics such as programming languages, database management, and web development.


 
 Key Features:
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Duration:
 
 3 years
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Focus:
 
 Theoretical knowledge, application development
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Curriculum:
 
 Programming, database management, web development, networking
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Career Path:
 
 Software developer, web developer, database administrator
 </li>
</ul>

 
 Detailed Comparison Table:
 

<table>
 <thead>
 <tr>
 <th>
 Feature
 </th>
 <th>
 Diploma in Computer Science &amp; Engineering
 </th>
 <th>
 BCA (Bachelor of Computer Applications)
 </th>
 </tr>
 </thead>
 <tbody>
 <tr>
 <td>
 Duration
 </td>
 <td>
 2-3 years
 </td>
 <td>
 3 years
 </td>
 </tr>
 <tr>
 <td>
 Curriculum
 </td>
 <td>
 Practical, vocational
 </td>
 <td>
 Theoretical and application-based
 </td>
 </tr>
 <tr>
 <td>
 Career Opportunities
 </td>
 <td>
 Technician, Junior Programmer
 </td>
 <td>
 Software Developer, Web Developer
 </td>
 </tr>
 <tr>
 <td>
 Further Education
 </td>
 <td>
 Lateral entry to B.Tech
 </td>
 <td>
 MCA, MBA
 </td>
 </tr>
 <tr>
 <td>
 Salary
 </td>
 <td>
 Generally lower than BCA graduates
 </td>
 <td>
 Higher earning potential
 </td>
 </tr>
 </tbody>
</table>

 
 Which is Right for You?
 

<ul>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose Diploma if:
 
 You want to quickly enter the workforce with specific technical skills and have limited financial resources.
 </li>
 <li style="color: black; font-family: poppins; font-weight: 400">
 
 Choose BCA if:
 
 You seek a broader understanding of computer applications, aspire to higher-level roles, and plan to pursue further education.
 </li>
</ul>

 For Indian students, consider your long-term career goals, financial situation, and academic interests when making this decision. Both paths can lead to successful careers in the IT industry, but they cater to different aspirations and learning styles.
```

Diploma in Computer Science and Engineering vs. BCA (Bachelor of Computer Applications): A Detailed Comparison

Explore Diploma in Computer Science & Engineering. Gain skills in programming, data structures, and software development. A pathway to a tech career.

Course Comparision

Curriculum