SECOND YEAR

(COMPUTER SCIENCE & ENGINEERING)

IV-SEMESTER EXAMINATION SCHEME- 2023-24

S. Cate- Course Course title Credits Hrs/week Marks allotted

N. gory Code
L T P L T P Th. Pr. IA
1 PCC 4CSE41A Design & Analysis of Algorithms 3 1 - 3 1 - 70 - 30
(CSE)
2 PCC 4CSE42A Web Technologies 3 - - 3 - - 70 - 30
(CSE)
3 PCC 4CSE43A Computer Networks 3 1 - 3 1 - 70 - 30
(CSE)
4 PCC 4CSE44A Database Management Systems 3 1 - 3 1 - 70 - 30
(CSE)
5 PCC 4CSE45A Computer Organization and 3 - - 3 - - 70 - 30
(CSE) Architecture
6 OEC $$$ Open Elective – I 3 - - 3 - - 70 - 30
4xxx6xA
7 PCC 4CSE42B - - 1 - - 2 - 50 50
(CSE) Web Technologies Laboratory

8 PCC 4CSE43B - - 1 - - 2 - 50 50
(CSE) Computer Networks Laboratory

9 PCC 4CSE44B Database Management Systems - - 1 - - 2 - 50 50

(CSE) Laboratory
10 PCC 4CSE45B Computer Organization & - - 1 - - 2 - 50 50
(CSE) Architecture Laboratory
11 MNC 4CSE87C NCC/NSS/NSO/Yoga/Scout - - - - - - - - 100
(CSE)
Total 18 3 4 18 3 10 420 200 380
Grand Total 25 31 1000

$$$ - Students can choose open electives of the respective credit from other departments of the
university, NPTEL, MOOCs or similar online platforms and other institute of repute with the prior
permission of the head of the department.
Note: Students have to undergo a Practical Training - I of 45 days (in house/field) at the end of IV
Semester for which assessment will be made at the beginning of next semester.
To pass, a candidate must obtain:
(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

22
G:\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 SECOND YEAR IV-SEMESTER

[PCC] 4CSE41A (CSE) – DESIGN AND ANALYSIS OF ALGORITHMS

3L, 1T 3 Hours, 70 Marks
Review of Algorithm and its specification, performance analysis and Randomized Algorithms.
Random access machines (RAM), computational complexity of RAM program. Time and Space
complexity, Asymptotic notations (Big-O,,, little-o & Ω). Complexity estimation using
Substitution method, Recursion trees and Master Method.
Design of Efficient Algorithms: Divide and conquer: Binary Search, finding maximum and minimum,
Merge Sort, Quick Sort, Matrix Multiplication, Convex Hull. Greedy methods: Knapsack problem,
tree vertex splitting, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Optimal
Reliability Allocation, Knapsack, Single Source Shortest Paths – Dijkstra’s and Bellman Ford
Algorithms.
Design of Efficient Algorithms: Dynamic programming: Matrix Chain Multiplication, Longest
Common Subsequence, Multi Stage Graph and 0/1 Knapsack Problem, all Pair Shortest Paths –
Warshal’s and Floyd’s Algorithms. Backtracking, Branch and Bound: Traveling Salesman Problem
and Lower Bound Theory, Graph Coloring, n-Queens Problem.
Graph Theory Algorithms - Algorithms for problems related to Connectedness, Spanning Trees,
Coloring, Planarity, Shortest Path, Vertex cover, Network Flow. Advanced Trees - Definitions,
Operations on Weight Balanced and Huffman Trees, 2-3 and Red- Black Trees.
Polynomial Time Solvable problems, Reductions and Completeness, Definition and Interpretation of
NP-Completeness, The P vs. NP, NP-Hard problems. Comparative study of Sorting Algorithms -
Radix sort, Heap sort, Merge sort, Quick sort and Topological Sort. Order statistics and expected time
for order statistics.

[PCC] 4CSE42 A (CSE) – WEB TECHNOLOGIES

3L 3 Hours, 70 Marks
Introduction to INTERNET – history, evolution, milestones. Internet infrastructure – Basics of digital
communication, data encoding/decoding, modems and ISPs. Concept of Bandwidth and Bit rate.
Overview of Internet Protocol: Versions, IP classes. Browsers and their evolution.
Finding computers on Internet – Static vs Dynamic IPs: Introduction to DHCP. Domain Names –
DNS Protocol, Nameservers, Zone files and Records, TLDs, Lookups & Reverse Lookups. Overview
of DNS vulnerabilities. Introduction to WWW, IETF, ICANN and WHOIS. Introduction to WWW
and HTTP: Versions, Headers & Status Codes.
Overview of HTML – Tags, Attributes and Styles. Designing webpages with HTML5 – Tags &
Attributes, Forms, Multimedia (Images, Audio, Video), Iframes, Tables. Introduction to character
encoding, compression, MIME types, document standards and meta tags. Introduction to CSS –
Selector Rules, Typography, Layout, Appearance and Animations.
Introduction to Java Script: Evolution, programming basics, functions and dialog boxes. DOM and
Events – Life cycle, Mouse, Keyboard, Value, Forms, Document. Asynchronous Execution –
Promises, async/await, web workers. Web storage and Cookies. Debugging Javascript in browsers.
Introduction to Server-Side applications of Javascript.
Concept of File Transfer Protocol, Remote Login, E-mail Protocols (IMAP, SMTP, POP3).
Introduction to open source web servers – Apache, NGINX. Overview of search engines, browser
extensions and server management tools - cPanel, CWP.

32
G:\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 4CSE43A (CSE) – COMPUTER NETWORKS
3L, 1T 3 Hours, 70 Marks
Basic Communication Model. Analog and Digital Signals. Need and Advantages of Data
Communications. Network topologies and types of networks. OSI reference model and TCP/IP
Protocol Suite. Layers in TCP/IP. Network Devices – Switch, Hub, Router, Gateway. Circuit and
Packet Switching.
Digital Communication - Transmission of Digital Signals – Encoding, Impairments, Nyquist Bit Rate,
Noise. Performance – Bandwidth, Throughput, Latency, Bandwidth-Delay, Jitter. Multiplexing and
Transmission Media. Error Detection and Correction - Cyclic codes, Checksum, Forward error
correction.
Link control: Services of data link layer, flow and error control, addressing. Media Access control:
Random Access, Controlled Access and Channelization. Wired LANs and Ethernet Protocol.
Network Layer – Packets, Connectionless and Connection-Oriented protocols. Introduction to IPv4 &
IPv6. IPV4 Addressing, Forwarding of Packets. Routing algorithms. Performance – Delay,
Throughput, Packet Loss, Congestion. Introduction to Multicasting – types, addresses, forwarding.
Overview of ICMP.
Transport Layer – Services, Flow and Congestion Control Protocols. Datagrams & UDP – Services &
Applications. TCP – Services, Features, States, Ports and Sockets. Session and Application Layer –
Introduction to FTP, TELNET, SSH and SNMP. Overview of Wireless Communication, Adhoc
Networks and Tethering.

[PCC] 4CSE44A (CSE) – DATABASE MANAGEMENT SYSTEMS

3L, 1T 3 Hours, 70 Marks
Overview and History of DBMS. File System v/s DBMS. Advantages of DBMS Describing and
Storing Data in a DBMS. Queries in DBMS. Structure of a DBMS. Types of Databases. Entity
Relationship model - Sets, Constraints & Hierarchies. Data Design with ER Model. Relational
Algebra and Tuple Calculus – Selection, Projection, Set Operations, Renaming, Joints, Division,
Relation Calculus, Expressive Power of Algebra and Calculus.
Structured Query Language: Union, Intersection, Except, Nested Queries, Set-Comparison, Aggregate
Operators, Null Values. Join Queries, Group & Order Clauses. Key Constraints in SQL, Views &
Triggers. Introduction to Connectors. Accessing Database in Python programs.
Schema & Normalization - Introduction to Schema, Functional Dependencies, Relational Normal
Forms, Need for Normalization, Decomposition into BCNF and 3-NF. Transactions: Transaction
Concept, Transaction States, Atomicity, Consistency, Isolation & Durability.
Concurrency Control - Concurrent Executions, Serializability, Lock-Based Protocols, Timestamp-
Based Protocols, Deadlock Handling. Database Failures – Introduction and Recovery Schemes.
Shadow Paging and Log-based Recovery. Recovery with Concurrent transactions.
Storage and Indexing – Concepts, Organization of Records, Data-Dictionary Storage, Column-
Oriented Storage. Ordered Indices, Hash Indices & Bitmap Indices. B-Trees and B+ Trees. Security
and Integrity – Authorization, Security Specification in SQL, Encryption and Statistics in databases.
Introduction to relational, distributed, centralized and object-oriented databases.

33
G:\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 4CSE45A (CSE) – COMPUTER ORGANIZATION AND ARCHITECTURE
3L 3 Hours, 70 Marks
Organization of computer system, Basic building blocks of CPU. Construction of ALU - Integer
representation, Floating point number system, Arithmetic operations on floating point numbers, Data-
path and bus design, Logical operations, implementation of logical instructions.
General instruction formats, addressing modes. Concept of control unit, execution of instructions,
Hardwired and Microprogrammed control unit, Microinstructions and Microprogramming. Instruction
execution cycle and instruction set. General and Special Purpose Registers.
Memory element, RAM, Static RAM, Dynamic RAM, dimension of memory access, ROM, PROM,
EPROM, EEPROM, CCD and cache memories. Hierarchy of memories. Magnetic, Optical and Flash
Disks.
Interconnection of computer components, buses, bus formats and operations, isolated and memory-
mapped input-output, interfacing of keyboards and printers. Interrupts in IO systems, DMA. Data
transfer, DMA interrupts, polling, masking, nested interrupts.
Introduction to instruction pipelining, pipeline hazards, and performance.

34
G:\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx