SYLLABUS FOR

BACHELOR OF ENGINEERING (COMPUTER SC. & ENGG.)

FIFTH SEMESTER

Paper Title: OPERATING SYSTEM

Paper Code: CSE501 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: - Examiner shall set eight questions covering four questions from each section. Candidate
will be required to attempt five questions, at least two from each section.

Objectives: This course should provide the students with good understanding of Operating
System including its architecture and all its components. Good conceptions on all the subjects
like processes, inter-process communication, semaphore, message passing, classical IPC
problems, scheduling, memory management, file systems, security and protection mechanism,
I/O hardware and software, deadlocks, etc. should be provided

SECTION – A
Introduction: What is an O.S., O.S. Functions; Different types of O.S.: batch, multi- (5)
programmed, time sharing, real time, distributed, parallel; General structure of operating
system, O/S services, system calls.

Process Management: Introduction to processes - Concept of processes, process 10)

scheduling, operations on processes; Inter Process Communication, Critical Sections,
Mutual Exclusion with Busy Waiting, Sleep and Wakeup, Semaphores, Message passing;
CPU scheduling- scheduling criteria, preemptive & non-preemptive scheduling,
Scheduling Algorithms: FCFS, SJF, RR and priority.

Memory Management: background, logical vs. physical address space, memory

management without swapping; swapping; contiguous memory allocation, paging, (5)
segmentation, segmentation with paging; Virtual Memory, demand paging, performance,
page replacement, page replacement algorithms (FIFO, Optimal ,LRU); Thrashing.
SECTION – B
File Systems: Files - file concept, file structure, file types, access methods, File attributes, (5)
file operations; directory structure, allocation methods (contiguous, linked, indexed), free-
space management (bit vector, linked list, grouping), Protection mechanisms.
Secondary Storage : Disk Structure, Disk Scheduling ( FCFS, SSTF, SCAN, C- (5)
SCAN, LOOK), Disk Management (Disk Formatting, Boot Blocks, Bad Blocks), Swap
Space Management (Swap Space use, Swap Space Location, Swap Space Management)
Deadlocks: Introduction to deadlocks, Conditions for deadlock, Resource allocation (5)
graphs, Deadlock Detection and Recovery, Deadlock Avoidance, Deadlock Prevention

Case Studies: Brief introduction of MS-DOS, Windows, UNIX and LINUX. (5)

Text Book:
1. Silbersehatz and Galvin : Operating System Concepts”, Addison Wesley Inc.

References:
1. Tanenbaum A.S : Operating System Design & Implementation”,
Pearson Education.
2. Bhatt and Chandra : An introduction to Operating Systems Concepts and
Practice, Prentice Hall of India Publication
3. Charles Crowley : Operating Systems A Design Oriented Approach,
Tata McGraw-Hill Publication.
Paper Title: OPERATING SYSTEM LAB (PRACTICAL )

Paper Code: CSE551 MM (External):75

MM (Internal): 75
Note: Practical Problems related to

1. Learning Basic Features and Operating Environment of UNIX and LINUX.

2. Introduction to Shell and Shell Commands.

3. Shell programming: creating a script, making a script executable, shell syntax (variables,
conditions, control structures, functions, commands.

4. Process: starting new process, replacing a process image, duplicating a process image,
waiting for a process.
5.
Programming with semaphores.

Paper Title: SOFTWARE ENGINEERING

Paper Code: CSE502 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner will set eight questions covering four questions from each section.
Candidates will be required to attempt five questions, selecting at least two from each
section.

Objectives: This course aims to give students a theoretical foundation in software

engineering. Students will learn about the principles and methods of software
engineering, including current and emerging software engineering practices and support
tools.
SECTION – A
Introduction:
Introduction to Software Engineering, System Engineering Vs Software
Engineering, Software Evolution, Software Characteristics, Cost of Software
Production, Software Components, Crisis – Problem and Causes, Challenges in (04)
Software Engineering.

Software Process Models:

SDLC, Waterfall Model, Incremental Model, Prototyping Model, Evolutionary
Model, Spiral Model, Rapid Application Development Model, Formal Methods,
Open Source Development, Object Oriented Life Cycle Model, Agile Methods. (05)

Project Management Concepts:

Management Activities, Project Planning, Project Scheduling, Size Estimation –
LOC, FP; Cost Estimation Models –COCOMO, COCOMO-II, Risk Management,
Configuration Management. (06)
Software Requirements Analysis and Specification Concepts:
Requirement Engineering, Requirement Elicitation Techniques, Requirements
Documentation, Characteristics and Organization of SRS, Analysis Principles,
Analysis Modeling – Data Modeling, Functional Modeling and Behavioral (05)
Modeling; Structured vs. Object Oriented Analysis.

Software Design and Coding Concepts:

Design Principles, Data Design, Architectural design, Interface Design, Component
Level Design, Object Oriented Design Concepts, Cohesion and Coupling and their
classification, top-down, bottom-up and middle-out design, Coding, Coding (05)
Standards, Coding Conventions, Programming Style.

SECTION – B
Testing:
Verification and Validation, Testing Process, Design of Test Cases, Functional
Testing, Software Testing Strategies, Unit Testing, Integration Testing, Top Down
and Bottom Up Integration Testing, Alpha & Beta Testing, System Testing and (05)
Debugging.

Software Quality Assurance:

Software Quality, Software Quality Factors, Quality Assurance and Standards,
Quality Planning, Quality Control, ISO 9000 Certification for Software Industry,
SEI Capability Maturity Model and Comparison between ISO & SEI CMM. (05)
Introduction to Six Sigma, SPICE.

Technical Metrics for Software:

Software Measurements: What and Why, A Framework for Technical Software
Metrics, Metrics for the Analysis Model, Metrics for Design Model, Metrics for
Source Code, Metrics for Testing, Metrics for Software Quality, Metrics for (05)
Maintenance.

CASE (Computer Aided Software Engineering) and Introduction to UML:

CASE and its Scope, Building blocks of CASE, CASE Tools, CASE Environment,
UML Concepts, Use Case Diagrams, Sequence Diagrams, Collaboration Diagrams,
Class Diagrams, State Transition Diagrams, Component and Deployment (05)
Diagrams.
 Text Book:
1. Ian Sommerville : Software Engineering, Seventh Edition,
Pearson Education.

References:
1. R.S. Pressman : Software Engineering: A Practitioner's
Approach, Sixth Edition, McGraw Hill.
2. S.L. Pfleeger, J.M. Atlee : Software Engineering: Theory and Practice,
Second Edition, Pearson Education.
3. Douglas Bell : Software Engineering for Students, Fourth
Edition, Pearson Education.
4. Pankaj Jalote : An Integrated Approach to Software
Engineering, Second Edition, Narosa.
5. K.K. Aggarwal, Yogesh Singh : Software Engineering, Second Edition, New
Age International.

Paper Title: SOFTWARE ENGINEERING (PRACTICAL)

Paper Code: CSE552 Max. Marks: 75

Note: This practical will enable students manage software projects using MS-Project. Students
will learn about preparing analysis and design models using UML modeling concepts through
Rational Rose. Students will also be exposed to CASE tools.
1. Study the features of MS-Project.

2. Use MS-Project to draft project plan for a particular project case study.

3. Use MS-Project to generate various reports like Gantt chart, Network diagram, Resource
usage sheet.

4. Use MS-Project to track the progress of a project.

5. Study the concepts of UML modeling.

6. Use Rational Rose to generate use case diagrams.

7. Use Rational Rose to generate sequence diagrams.

8. Use Rational Rose to generate class diagrams.

9. Use Rational Rose to generate collaboration diagrams.

10. Study the features of a particular CASE tool for requirements specification, analysis,
 design and cost estimation.

11. Apply each of the above tools to a particular case study.

Paper Title: COMPUTER NETWORK

Paper Code: CSE503 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner will set eight questions covering four questions from each section. Candidates
will be required to attempt five questions, selecting at least two from each section.

Objectives: This course aims to give students a theoretical foundation in software engineering.
Students will learn about the principles and methods of software engineering, including current
and emerging software engineering practices and support tools.

SECTION – A
Introduction:
Data Communication: Components, Data Flow;
Network Categories: LAN, MAN, WAN (Wireless / Wired);
Network Software: Concept of layers, protocols, interfaces and services; (06)
Reference Model: OSI, TCP/IP and their comparison;

Physical Layer :
Concept of Analog & Digital Signal; Bit rate, Bit Length; Transmission Impairments:
Attenuation, Distortion, Noise; Data rate limits: Nyquist formula, Shannon Formula; (08)
Multiplexing: Frequency Division, Time Division, Wavelength Division;
Transmission media: Twisted pair, coaxial cable, fiber optics, wireless transmission
(radio, microwave, infrared);
Circuit Switching & Packet Switching..

Data Link Layer:

Error correction & Detection; Flow & Error Control;
Sliding window protocols: Stop & Wait ARQ, Go back n ARQ, Selective repeat ARQ; (10)
Examples of DLL Protocols-HDLC, PPP;
Medium Access Sub layer: Channel Allocation; Random Access: ALOHA, CSMA
protocols; Controlled Access: Polling, Reservation, Token Passing;
Examples of IEEE 802.3, 802.11 standards;k

SECTION – B
Network Layer:
Logical Addressing: IPv4 and IPv6; Packet Formats & their comparison: IPv4 and IPv6;
Routing algorithms: Distance vector, Link State Routing, Hierarchical Routing,
Broadcast & Multicast Routing; (10)
Congestion Control: Principles of Congestion Control, Congestion prevention policies,
Leaky bucket & Token bucket algorithms

Transport Layer:
Addressing, flow control & buffering, multiplexing & de-multiplexing, crash recovery;
Example transport protocols: TCP, SCTP and UDP; (08)

Application Layer:
Network Security; Domain Name System; Simple Network Management Protocol; (03)
Electronic Mail;
Text Book:
1. Andrew S. Tanenbaum : “Computer Networks”, Pearson Education
“Data Communication & Networking”, 4th
edition,
2. Behrouz A Forouzan : Tata Mcgraw Hill

References:
1. William Stallings : “Data and Computer Communications”, Pearson
Education.
2. Douglas E. Coomer : “Internet working with TCP/IP”, Pearson
Education.
3. Kurose Ross : Computer Networking: A top down approach, 2nd
Edition, Pearson Education

Paper Title: COMPUTER NETWORK (Practical)

MM (External):75
Paper Code: CSE553 MM (Internal): 75

Note: Practical Problems related to:

1. To familiarize with the various basic tools (crimping, krone etc.) used in
establishing a LAN.

2. To study various topologies for establishing computer networks.

3. To familiarize with switch , hub, connecters, cables (cabling standards) used in

networks

4. To familiarize with routers & bridges

5. To use some basic commands like ping, trace-root, ipconfig for trouble shooting
 network related problems.

6. To use various utilities for logging in to remote computer and to transfer files
from / to remote computer.

7. To develop a program to compute the Hamming Distance between any two code
words.

8. To develop a program to compute checksum for an ‘m’ bit frame using a generator
polynomial.

9. To develop a program for implementing / simulating the sliding window protocol

10. To develop a program for implementing / simulating a routing algorithm

11 To study various IEEE standards (802.3, 802.11, 802.16)

Paper Title: PRINCIPLES OF PROGRAMMING LANGUAGES

Paper Code: CSE504 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures:
45

Note: Examiner shall set eight questions covering four questions from each section.
Candidate will be required to attempt five questions, at least two from each section.

Objectives: This course should provide the students with a fairly good concept of
fundamental concepts and design issues of programming languages and become familiar
with major programming paradigms. Understand similarities and differences between
models and know when to use them and also learn programming techniques appropriate
for each model.
SECTION – A
Introduction:
Study of principles and major concepts in various programming paradigms like
imperative, functional, object-oriented and logic programming. Introduction to 5
various phases of compilers, Formal translation models: BNF Grammars.

Imperative programming:
Location, reference and expressions, assignment and control, data types, blocks,
procedures and modules. 10
Object Oriented Programming: Classes and objects, abstraction and encapsulation,
inheritance, Polymorphism, virtual functions and classes, abstract classes.

Logic Programming:
Unification, SLD-resolution, Backtracking, Cuts.
Concepts Of Concurrent Programming: Processes, synchronization primitives. 5

SECTION – B
Functional Programming:
Functions as first class objects, higher order functions, polymorphic datatypes, type 10
checking and type inference

Introduction to storage management:

Static storage management, Heap storage management. 10

Illustration of the above concepts using representative languages: C++, Java,

and Prolog etc.

Text Book:
1. Prattt & Zelkowrtz, : Design & Implementation, Pearson
Programming Languages Education

References:
1. Bruce J. MacLennan : Principles of Programming Languages:
Design, Evaluation, and Implementation,
Published by Oxford University Press US,
1999, ISBN 0195113063, 9780195113068
2. Friedman, Wand, and Haynes : Essentials of Programming Languages, 2nd
ed, MIT Press 2001, ISBN 0262062178,
9780262062176

Paper Title: DISCRETE STRUCTURES AND COMPUTATIONAL

LOGIC

Paper Code: CSE507 Max. Marks (Final Exam): 100 Time: 3 Hours
Max. Marks (Sessional Exam): 50 Total Lectures: 45

Note: Examiner shall set eight questions covering four questions from each section.
Candidate will be required to attempt five questions, at least two from each section.

Objectives: The main aim of this subject is to provide the knowledge of core
mathematical foundation of computer science, and to make them familiar with some basic
foundation of Artificial Intelligence.

SECTION – A
Set Theory, Relations & Functions:
Sets, Algebra of Sets, Finite Sets, Power Sets, Partitions, Counting Principles,
Product sets , Relations, Type Of Relations, Closure Properties, Equivalence
Relations, Partial ordering Relations & Lattice, Functions, Type of Functions, (10)
Recursive Functions.

Graph Theory & Trees:

Introduction, Graphs Multigraph, Isomorphic Graph, Homeomorphic Graphs, Paths (10)
& Circuits, Shortest Paths In waited Graphs, Eulerian & Hamiltonial Paths &
Circuits, Konigsberg Bridge, Complete , Regular, Bipartite Graphs, Planner
Graphs, Graph Coloring, Graph Traversal Techniques.
Trees, Binary Search Trees , Complete & Extended Binary Trees.

SECTION – B
Propositional Logic:
Introduction, propositions, compound propositions, basic logical operations, ,
propositions and truth tables, tautologies and contradiction, logical equivalence,
algebra of propositions, conditional and biconditional statements, arguments, (8)
logical implications, functions, quantifiers.

Predicate logic
Representing- simple facts, instance, and Isa relationship. Computable functions
and predicates resolution: conversion to clause form, unification algorithm, (7)
resolution in proposition and predicate logic.

Computational Theory
Finite Automata: NFA, DFA, NFA to DFA, state minimization, Moore and Mealy
Machines, Regular expressions, grammars, Pushdown automata, Turing Machines. (10)

Text Books:
1. C.L.Liu : Elements of Discrete Mathematics, 2nd
Edition, Tata McGraw Hill
2. Hopcroft. J.E., Ullman J.D. Introduction to automata theory, Languages
and computation, Narosa, 1979.

References:
1. Lipschutz : Discrete Mathematics, McGraw Hill
2. Martin. J.C. : Introduction to languages and the theory of
computation, McGraw-Hill international
Editions, Computer Science Series, 1991.
2. B. Kolman, R. C. Busby and S. : Discrete Mathematical Structures , Prentice
C. Ross Hall of India, 2004