Department of Computer Science and Engineering

B-Tech Computer Science & Engineering

Syllabus for Semester-V

Course Code Course Title Hours Per Week Credit

L P
CSE301C Design and Analysis of Algorithms 3 0 3
CSE302C Operating System 3 0 3
CSE303C Database Management System 3 0 3
CSE304C Computer Networks 3 0 3
CSE305C Numerical Methods 3 0 3
CSE306C Simulation Lab 1 4 3
CSE307C Design and Analysis of Algorithms 0 2 1
Lab
CSE308C Database Management System Lab 0 2 1
CSE309C Computer Networks Lab 0 2 1
Total Credits 16 10 21

Page | 49
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

CSE301C Design and Analysis of Algorithms L-3 P-0

Course Outcomes:
• Understand and use asymptotic notations to analyze the performance of algorithms
• Understand and analyze the design of algorithms using Brute force, Divide & Conquer, Dynamic
Programming, Greedy technique, Backtracking, Branch & Bound techniques.
• Compare and contrast various search and sorting techniques.
• Apply the various algorithms to solve problems and analyze their efficiency.

Unit - I
Introduction: Algorithm Design paradigms- motivation, Concept of algorithmic efficiency,
Run time analysis of algorithms, Asymptomatic Notations.
Divide & Conquer: Structure of divide and conquer algorithms: examples, Binary search,
Merge Sort, Quick sort, Analysis of divide and conquer run time. Recurrence Relations,
Master Theorem for solving Recurrence Relations.

Unit - II
Greedy method: Overview of the greedy paradigm, examples of exact optimization solution
(minimum cost spanning tree), approximate solution (Knapsack problem), Huffman coding,
Single source shortest path.

Unit - III
Dynamic Programming: Overview, difference between dynamic programming and divide
and conquer, applications: Shortest Path in Multistage Graph, Non-fractional (0/1) Knapsack
problem, Matrix Chain Multiplication, Travelling salesman problem, Longest common
sequence.

Unit - IV
Graph searching and traversal: Overview, traversal methods, depth first and breadth first
search. Dijkstra’s and Bellman Fort Algorithm for finding Single source shortest paths. All
pair shortest paths and matrix multiplication, Floyd – Warshall algorithm for all pair shortest
paths.

Unit - V
Back Tracking: Overview, 8-queen problem and Knapsack problem.
Branch & Bound: LC searching, bounding, FIFO branch and bound, Applications: 0/1
Knapsack problem, Travelling salesman problem.
Computational complexity: Complexity measures, Polynomial vs non-polynomial time
complexity; NP hard and NP complete classes, examples

Books Recommended:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to
Algorithms”, 2nd Ed., PHI, 2004.
References Books:
▪ Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications,
1999.
▪ V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer
Algorithms”, Addition Wesley, 1998.
▪ D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley, 1998.

Page | 50
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

CSE302C Operating System L-3 P-0

Course Outcomes:
• Describe and explain the fundamental components of a computer operating system.
• Describe the various types and models of operating systems.
• Define, restate, discuss, and explain the policies for scheduling, deadlocks, memory management,
synchronization, system calls, and file systems.
• Describe and extrapolate the interactions among the various components of computing systems.
• Describe and simulate the following OS components: System calls, Schedulers, Memory management
systems, Virtual Memory and Paging systems.

UNIT - I
Operating system overview – Objectives, structure and functions, Evolution of Operating
System, Memory Hierarchy, I/O techniques, Multiprocessor and Multicore Organization.

UNIT - II
Process Management: Process concept, Process States, Concurrent processes, process
control block, Inter-process Communication.
Threads: Processes and Threads, Types of Threads, Multithreading models.
Process Scheduling: Schedulers, Scheduling criteria, Scheduling algorithms.

UNIT - III
Process Synchronization: Critical Section Problem, Peterson’s solution, Mutual Exclusion,
Semaphores, Bounded Buffer Problem, Readers/Writers problem, Monitors.
Deadlocks: characterization, prevention, avoidance, detection, Recovery.

UNIT - IV
Memory Management: Overview, Swapping, Contiguous Memory Allocation, Paging and
Segmentation.
Virtual Memory Management: Overview, Demand Paging, Page Replacement, Thrashing.

UNIT - V
I/O Management & Disk Scheduling: I/O devices and organization of I/O function, I/O
Buffering, DISK I/O, Operating System Design Issues.
File System: File Concept, File Organization and Access Mechanism, File Directories, File
Sharing, Implementation Issues.

Text Books:
1. Silberschatz, Peter Galvin, Greg Gagne “Operating System Principles”, 9th edition.

Reference Books:
1. Andrew S. Tannenbaum & Albert S. Woodhull, “Operating System Design and
Implementation”, Prentice Hall.
2. William Stallings, “Operating Systems – internals and design principles”, Prentice
Hall.
3. Andrew S. Tannenbaum, “Modern Operating Systems”, Prentice Hall.
4. Gary J.Nutt, “Operating Systems”, Pearson/Addison Wesley.
5. Pramod Chandra P.Bhatt, “An Introduction to Operating Systems Concepts and
Practice”.
Page | 51
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

CSE303C Database Management System L-3 P-0

Course Outcomes:
• Describe relational schema design, and it covers the normalization and functional dependency
algorithm.
• Understands the relational algebra concepts, selection, projection, relational calculus which helps in
understanding queries.
• Understand various transaction processing, concurrency control mechanisms and database
protection mechanisms.

Unit 1: Introduction
Basic Concepts and Conceptual Database Design, Characteristics of the Database, Data
Models, DBMS Architecture, Data Modelling Using the Entity-Relationship Model,
Translating ER Model into Relational Model, Extended Entity-Relationship Model.

Unit 2: Relational Database Design

Functional Dependencies, Normalization – 1NF, 2NF, 3NF, BCNF, higher Normal forms,
Lossless Join & Dependency Preserving Decomposition, De-normalization.

Unit 3: Relational Data Model

Relational Algebra Basic Operators, Composition of Operators, Additional Operators,
Extended Relational Algebra, Tuple calculus, SQL-Introduction and Data Definition, Basic
Queries, Advanced Queries, Updates, Joins, Views and Triggers, Brief introduction of PL-
SQL.

Unit 4: Transaction and Concurrency Control

Transaction- Concept and purpose, ACID properties and their necessity, Problems with full
isolation, Concurrency Control- lock-based protocols, 2-phase locking, Timestamp-based
Protocols, Validation–based Protocols, Multiple Granularity, deadlock handling.

Unit 5: Recovery:
Failures and their classification, recovery and atomicity, recovery algorithms, Undo-Redo
with write ahead logging, Buffer management, File organization, indexing (e.g., B and B+
trees), Hashing and Query Processing

Books Recommended:
1. Elmsari and Navathe, “Fundamentals of Database Systmes”, A. Wesley
2. Korth, Silberschatz, “Database System Concepts”, TMH
3. Steve Bobrowski, “Oracle 8 Architecture”, TMH
4. Date C. J., “An Introduction to Database Systems”, Narosa Publishing
5. Ullman J. D., “Principles of Database Systems”, Galgotia Publications
6. William Page, “Using Oracle 8i – Special Edition”, Que/PHI
7. Ivan Bayross, “SQL & PL/SQL Using Oracle 8i & 9i with SQLJ”, BPB

Page | 52
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

CSE304C Computer Network L-3 P-0

• Understand the networking problem and its solution and understand the essence of layering
mechanism of OSI and TCP/IP network models.
• Explore the data link layer and understand the need of various protocols for efficient communication.
• Understand the addressing mechanism of internet and protocols which help smooth functioning of the
today's congested internetworked world.
• Understand the security implications in the modern internet and how they are resolved.

UNIT – I
Introduction: Uses of Computer Networks, Network and Protocol Architecture, Reference
Model (ISO-OSI, TCP/IP-Overview), Types of networks (LAN, MAN and WAN), Different
network topologies like star, ring, hybrid, tree etc. IEEE standards.

UNIT -II
Data Link layer – Design Issues, Error detection and Correction techniques, Flow control
algorithms, Framing techniques, congestion control.

UNIT - III
Network Layer: IP Addressing, IPv.4, IP protocols, sub-netting, Different Routing
algorithm, Congestion control Algorithms General principles of congestion prevention
policies.

UNIT - IV
Internetworking: Internet control protocols: ICMP, ARP, RARP, BOOTP, DHCP, Gateway
routing protocols: OSPF, BGP.
Transport Layer: Transport services, Elements of Transport protocols, Internet Transport
Protocols. TCP, UDP, TCP sockets

UNIT – V
Application Layer-Network Security: Domain Name system (DNS): Electronic Mail; The
world Wide Web. Multimedia.

TEXT BOOKS:
1. W. Stallings, “Computer Communication Networks”, PHI, 1999.
2. Larry L.Peterson, Peter S. Davie, “Computer Networks”, Elsevier, Fifth Edition, 2012.
3. Computer Networks – Third Edition – Andrew S. Tanenbaum, Prentice Hall of India.
4. Data Communications and Networking – Behrouz A. Forouzan, Third Edition TMH.

References:
1. U. Black, “Computer Networks-Protocols, Standards and Interfaces”, PHI, 1996.
2. Laura Chappell, “Introduction to Cisco Router Configuration”, Techmedia, 1999.
3. Michael A. Miller, “Data & Network Communications”, Vikas Publication, 1998.
4. William A. Shay, “Understanding Data Communications & Networks”, Vikas
Publication, 1999.

Page | 53
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

MTH-331C Numerical Methods L-3 P-0

Course Outcomes:
• Understand the networking problem and its solution and understand the essence of layering
mechanism of OSI and TCP/IP network models.
• Explore the data link layer and understand the need of various protocols for efficient communication.
• Understand the addressing mechanism of internet and protocols which help smooth functioning of the
today's congested internetworked world.
• Understand the security implications in the modern internet and how they are resolved.

Unit - I:
Finite Difference: Difference Table and its usage. The difference operators Δ, ∇ and the
operator E.
Interpolation: Interpolation with equal intervals, Newton’s advancing difference formula.
Newtons’s backward difference formula. Interpolation with unequal intervals. Newton’s
divided difference formula. Lagrange’s interpolation formula.
Central Differences: The central difference operator δ and the overraging operator μ.
Relations between the operators. Gauss forward and backward interpolation formula,
Sterlings, Bessel’s, Laplace and Everetts formulae.

Unit - II
Inverse interpolation: Inverse interpolation by (i) Langrange’s (ii) Methods of successive e
approximation & (iii) Methods of elimination of third differences
Numerical solution of algebraic and Transcendental Equations: Graphic Method,
Regula-Fast method, Balzano’s Process of bisection of intervals, Newton-Raphson Method
and its geometrical significance.

Unit - III:
Numerical Integration: Numerical Integration, General Quadrature Formula, Simpson’s
one-third and three-eight rules, Weddles’ rule, Hardy’s rule, Trapezoidal rule.
Numerical differentiation: Numerical differentiation of a friction. Differential coefficient of
a friction in terms of its differences. Applications

Unit - IV
Difference Equations: Linear-homogeneous and non-homogeneous difference equations of
order n with constant coefficient, and their solution, methods of undetermined coefficient.
Numerical Solution of ordinary differential equations: Numerical solution of ordinary
differential equations, Picard’s method. Taylors series method, Euler’s method, Runge-Kutta
Method.

Books Recommended:

1. Numerical Methods for Scientists and Engineering, by M.K.Jain, S.R.Iyengar & R.K.
Jain, Wiley Eastern Ltd.
2. Mathematical Numerical Analysis, by S.C. Scarborough, Oxford and IBH.
3. Introductory methods in Numerical Analysis, by S.S.Sastry, Prentice Hall of India.
4. Numerical Solution of Differential equations, by M.K.Jain.
5. Numerical Methods for Science & Engineering, by R.G.Stanton.

Page | 54
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 03

CSE306C Simulation Lab L-1 P-4

Course Outcomes:
• Understand the concept of simulating the real-world problems through software tools.
• Understand the basics of MATLAB and apply the methods of MATLAB for problem solving.
• Understand the basics of SCILAB and apply them for problem solving.
• Design and simulate various network topologies used in computer networks.

UNIT – I
Matlab: Introduction to MATLAB, Identify and use various windows, Data types, Rules
about variable names, Express numbers in either floating-point or scientific notation, save a
series of commands. Built in functions, elementary math functions (common math functions,
rounding functions, discrete mathematics functions, trigonometric functions), data analysis
functions (maximum and minimum, mean and median, sums and products), sorting functions,
random numbers. Relational and Logical Operators, If-else statements, Switch-case
statements, For loop, While loop, Special commands (Break and continue), Script file.
Defining matrices, accessing matrix elements, Matrix Operations and Functions. Two-
Dimensional Plots, Three Dimensional Plots, Saving Your Plots.

UNIT – II
Scilab: Introduction to Scilab, Identify and use various windows, Data types, Rules about
variable names, Express numbers in either floating-point or scientific notation, save a series
of commands. Built in functions, elementary math functions (common math functions,
rounding functions, discrete mathematics functions, trigonometric functions), data analysis
functions (maximum and minimum, mean and median, sums and products), sorting functions,
random numbers. Relational and Logical Operators, If-else statements, Switch-case
statements, for loop, While loop, Special commands (Break and continue), Script file.
Defining matrices, accessing matrix elements, Matrix Operations and Functions, Two-
Dimensional Plots, Three Dimensional Plots, Saving Your Plots.

UNIT – III
Cooja: Introduction to cooja, Running Cooja Simulator, creating a new simulation, creating a
new mote type, adding motes and running the simulation, saving simulation file, Debugging
with Cooja Simulator.

UNIT – IV
Ns2: Introduction to Open Source Software, Introduction to Network Simulator – 2 (NS2),
TCL Scripting, TCL Script Components, Introduction to NAM, TRACE, XGRAPH etc.,
Wired Scenarios - Writing your first TCL Script, Network Dynamics etc., Simulation of
Different Network Topologies – BUS topology, RING Topology, STAR topology etc.
Creating Wireless Scenarios, Wired-cum-Wireless Scenarios etc.
Text Book
1. Holly Moore, “MATLAB for Engineers”, Pearson
2. Bansal R.K, Goel A.K., Sharma M.K., “MATLAB and its Applications in Engineering”,
Pearson Education, 2012.
3. Baudin, Introduction to Scilab, Scilab Consortium
References
2. Stephen.J.Chapman, “Programming in MATLAB for Engineers”, Cengage Learning, 2011.
3. Gomez, Engineering and scientific computation with Scilab, Springer

Page | 55
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 01

CSE307C Design and Analysis of Algorithms Lab L-0 P-2

Course Outcomes:
• Understand and use asymptotic notations to analyze the performance of algorithms
• Understand and analyze the design of algorithms using Brute force, Divide & Conquer, Dynamic
Programming, Greedy technique, Backtracking, Branch & Bound techniques.
• Compare and contrast various search and sorting techniques.
• Apply the various algorithms to solve problems and analyze their efficiency

Lab Details:

The Following Problems Are to Be Solved In C

▪ Simple Experiments on time and space complexity of a program
▪ Divide and Conquer Approach: Binary Search, Merge Sort, Quick sort, Medians
and Order statistics,
▪ Greedy Algorithms: Knapsack Problem, Huffman Codes.
▪ Dynamic Programming: Matrix Chain Multiplication, Traveling Salesman Problem,
Longest common subsequence, 0/1 Knapsack
▪ Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First
Search, Topological Sort, Strongly Connected Components, Algorithm for Kruskal’s
and Prim’s for finding Minimum cost Spanning Trees, Dijkstra’s and Bellman Fort
Algorithm for finding Single source shortest paths. All pair shortest paths and matrix
multiplication, Floyd – Warshall algorithm for all pair shortest paths.
▪ Back Tracking: 8-queen problem and Knapsack problem.
▪ Branch & Bound: LC searching, bounding, FIFO branch and bound

Page | 56
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 01

CSE308C Database Management System Lab L-0 P-2

Course Outcomes
• Design and Implement a database schema.
• Devise queries using DDL, DML, DCL and TCL commands.
• Develop application programs using PL/SQL.
• Design and implement a project using embedded SQL and GUI.
• Designing Forms and Reports.

Lab Details:
1. SQL Data Definition and Data Types.
2. Specifying Basic Constraints in SQL.
3. Schema change statements in SQL.
4. Insert, Delete and Update Statements in SQL.
5. Basic Queries in SQL.
6. Joining Multiple Tables: Inner Joins, Outer Joins, Cross Joins.
7. Correlated and Nested Queries in SQL.
8. Implement all the operation like Union, Intersect, minus, in, exist, aggregate and
Statistical
9. Functions, Group By And Having clause.
10. Creating Views, Writing Assertions.
PL/SQL
1. PL/SQL data Types, Control Structures, Logical Operators (And, Not, Or), Relational
Operators (IS NULL, Like, Between, In etc).
2. Built in Functions.
3. Functions and procedures.
4. Cursors, Collections and records.
5. Packages and Triggers.
6. Error handling.
7. Oracle administration
8. Creating FORMS
9. Generating REPORTS.

Page | 57
 Department of Computer Science and Engineering

Course Code: Course Title: Credits: 01

CSE309C Computer Networks Lab L-0 P-2

Course Outcomes:
• Students should be able to understand and identify the cabling technologies.
• Students should be able to connect two computers peer to peer via switch and router
• Students should be manually able to provide IP addresses to machines without DHCP.
• Should be able to share resources via network and configure windows server and DHCP.
• Should be able to use network simulators like NS2, OPNET and GLOMOSIM and should be able to
run wired and wireless topologies in NS2.

Lab Details:

1. Identification of guided media (UTP, Fiber) /Color coding.

2. To Connect two pc using peer to peer communication/via switch/via router.

3. IP addressing (static and dynamic).

4. Sharing the resources in wired network (software and hardware).

5. Configuring the Windows server (Active directory) and DHCP server.

6. Study of NS2/ GLOMOSIM / OPNET / QUALNET.

7. To implement wired network topology and wireless network topology in NS2 or any
other simulator.

Page | 58