Shri Vile Parle Kelavani Mandal’s

Dwarkadas J. Sanghvi College of Engineering

(Autonomous College Affiliated to the University of Mumbai)

Course Structure and Syllabus

of
Second Year Engineering (Semester IV)
in
Computer Engineering

Prepared by:- Board of Studies in Biomedical Engineering

Recommendedby:- Academic Council of D. J. Sanghvi College of Engineering
Approved by:- Governing Body of D. J. Sanghvi College of Engineering
Revision: 1 (2019)
With effect from theAcademic Year: 2019-2020
 Syllabus for Second Year Computer Engineering- Semester IV (Autonomous)
(Academic Year 2020-2021)
Program: Second Year Computer Engineering Semester : IV

Course : Engineering Mathematics-IV Course Code:DJ19CEC401

Course : Engineering Mathematics-IV Tutorial Course Code:DJ19CET401

Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Examination Continuous Assessment Marks
Marks (A) (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Practical Tutorial
Lectures Credits 75 25 25 25 100

Laboratory Examination Term work

Total
Tutorial / Term
Oral & Laboratory Mini project / work
Oral Practical 25
Practical Work presentation/
3 - 1 4 Journal

- -- -- - 25 25

Pre-requisite: Engineering Mathematics – I &Engineering Mathematics – II

Course Objectives:
The objective of this course is to introduce students to the concepts of Eigen values and Eigenvectors of Matrices,
probability, test of hypothesis and correlation between data.

Outcomes: On completion of the course, learner will be able to:

1. Demonstrate ability to manipulate matrices and compute Eigen values and Eigen vectors. Use matrix
algebra with its specific rules to solve the system of linear equation, using concept of Eigen value and
Eigen vector to the engineering problems.
2. Apply the concept of probability distribution to the engineering problems
3. Draw conclusions on population based on large and small samples taken and hence use it to understand
data science
4. Apply the concept of Optimization, Correlation and Regression to the engineering problems.
Detailed Syllabus: (unit wise)

Unit Description Duration

1 Matrices: 8
Eigen values and Eigen vectors, Cayley-Hamilton theorem (without proof), Similar
matrices, diagonalizable of matrix. Functions of square matrix
2 Probability: 9
Baye’s Theorem, Random Variables:- discrete & continuous random variables,
expectation, Variance, Probability Density Function & Cumulative Density Function.
Moments, Moment Generating Function. Probability distribution: binomial distribution,
Poisson & normal distribution. (For detail study)
3 Sampling Theory and ANOVA 13
Sampling Distribution, Test of Hypothesis, Level of significance, Critical region, One
Tailed and Two Tailed test, Interval Estimation of population parameters. Large and
small sample
Test of significant for Large Samples: Test for significance of the difference between
sample mean and population means, Test for significance of the difference between the
means of two samples
Test of significant for small samples: Student’s t-distribution and its properties. Test of
significance of small samples: Test for significance of the difference between sample
mean and population means, Test for significance of the difference between the means of
two Samples, paired t-test
Chi square test:- Test of goodness of fit and independence of attributes, Contingency
table. Association of attributes and Yate’s correction
Analysis of Variance(F-Test): One way classification, Two-way classification(short-cut
method)
4 Mathematical Programming 12
Types of solution, Standard and Canonical form of LPP, Basic and feasible solutions,
simplex method. Artificial variables, Big –M method (method of penalty). Duality, Dual
simplex method.
Non Linear Programming:-Problems with equality constrains and inequality constrains
(No formulation, No Graphical method)
5 Correlation & regression, Curve Fitting (Flipped Classroom) --
Scattered diagrams, Karl Pearson’s coefficient of correlation, covariance, Spearman’s
Rank correlation(non-repeated and repeated ranks)
Regression coefficient & Lines of Regression.
Fitting of curves: Least square method. Fitting of the straight line y=a+bx ,parabolic
curve y=a+bx+cx2 ,& exponential curve y=abx

Books Recommended:
Text books:
1. Higher Engineering Mathematics by Dr. B. S. Grewal 42th edition, Khanna Publication
2. Advanced Engineering Mathematics –Fourth Edition , Dennis G Zill& Warren S Wright
3. Operation Research by Hira&Gupta,S Chand.
4. Probability and Statistics for Engineering, Dr. J Ravichandran, Wiley-India.

Reference Books:
 1. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley.
2. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett. TMH International Edition.
3. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning.
4. Fundamentals Of Mathematical Statistics by S. C. Gupta, V. K. Kapoor, Sultan Chand & Sons -2003
5. Probability & Statistics with reliability by Kishor s. Trivedi, Wiley India
6. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett.TMH International Edition
7. Operations Research by S.D. Sharma KedarNath, Ram Nath& Co. Meerat.
8. Engineering optimization (Theory and Practice) by SingiresuS.Rao, New Age International
publication

Evaluation Scheme:
Semester End Examination (A):
Theory:
1. Question paper based on the entire syllabus, summing up to 75 marks.
2. Total duration allotted for writing the paper is 3 hrs.

Continuous Assessment (B):

Theory:
1. Two term tests of 25 marks each will be conducted during the semesterout of which; one will be a
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an assignment on
live problems or a course project.
2. Total duration allotted for writing each of the paper is 1 hr.
3. Average of the marks scored in both the two tests will be considered for final grading.

Tutorial: (Term work)

Term work shall consist of minimum 8Tutorials covering the entire modules.

The distribution of marks for term work shall be as follows:

Tutorial– 25 marks

The final certification and acceptance of term work will be subject to satisfactory performance of tutorial work and
upon fulfilling minimum passing criteria in the term work.
List of Tutorials:
1. Matrices
2. Probability and Random variable
3. Probability Distribution
4. Sampling: Large Sample Test
5. Sampling: Small Sample Test
6. Samplig: Chi Square Test, ANOVA
7. LPP: Simplex Method, Big M Method
8. LPP: Duality and Dual Simplex Method
9. NLPP
10. Correlation
11. Regression and Curve Fitting
Prepared by Checked by Head of the Department Principal
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Program: Second Year Computer Engineering Semester : IV

Course : Formal languages and Automata theory Course Code: DJ19CEC402

Course : Formal languages and Automata theory Tutorial Course Code: DJ19CET402

Evaluation Scheme
Teaching Scheme Semester End
(Hours / week) Continuous Assessment
Examination Marks Total
Marks (B)
(A) marks
Term Term (A+ B)
Theory Avg.
Total Test 1 Test 2
Practic Tutori
Lectur Credi
al al 75 25 25 25 100
es ts
Laboratory
Term work
Examination Tota
Tutorial / l
Oral Mini Ter
Laborat
Practic & project / m
Oral ory 25
al Practi presentati wor
3 -- 1 4 Work
cal on/ k
Journal
-- -- -- -- 25 25

Objectives:
To provide a theoretical foundation for the process of computation and to impart an
understanding of the notions of automata, formal languages and computability.

Outcomes: On completion of the course, learner will be able:

• Understand basic concepts in automata theory and theory of computation.

• Identify different formal language classes and their relationships.
• Design grammars and recognizers for different formal languages.
• Prove or disprove theorems in automata theory using its properties.
• Determine the decidability and intractability of computational problems.
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Detailed Syllabus: (unit wise)

Unit Description Duration
1 Fundamentals: Strings, Alphabet, Language, Operations, Finite state 06
machine, definitions, finite automaton model, acceptance of strings, and
languages, deterministic finite automaton and non deterministic finite
automaton, transition diagrams and Language recognizers.
2 Finite Automata: NFA with Î transitions - Significance, acceptance of 06
languages. Conversions and Equivalence: Equivalence between NFA with and
without Î transitions, NFA to DFA conversion, 4 minimisation of FSM,
equivalence between two FSM’s, Finite Automata with output- Moore and
Mealy machines.
3 Regular Languages: Regular sets, regular expressions, identity rules, 04
Constructing finite Automata for a given regular expressions, Conversion of
Finite Automata to Regular expressions. Pumping lemma of regular sets,
closure properties of regular sets (proofs not required).
4 Grammars: Regular grammars-right linear and left linear grammars, 10
equivalence between regular linear grammar and FA, inter conversion,
Context free grammar, derivation trees, and sentential forms. Right most and
leftmost derivation of strings
Context Free Grammars: Ambiguity in context free grammars. Minimisation
of Context Free Grammars. Chomsky normal form, Greiback normal form,
Pumping Lemma for Context Free Languages. Enumeration of properties of
CFL (proofs omitted), Chomsky hierarchy of languages, linear bounded
automata and context sensitive language, LR(0) grammar.
5 Push Down Automata: Push down automata, definition, model, acceptance 06
of CFL, Acceptance by final state and acceptance by empty state and its
equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not
required). Introduction to DCFL and DPDA.
6 Turing Machine: Turing Machine, definition, model, design of TM, 08
Computable functions, recursively enumerable languages. Church’s
hypothesis, counter machine, types of Turing machines, Universal Turing
Machine, Halting Problem.
7 Applications: 02
1. Finite Automata (FA) –
• For the designing of lexical analysis phase of a compiler.
• For recognizing the pattern using regular expressions.
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

2. Push Down Automata (PDA) –

• For designing the parsing phase of a compiler (Syntax Analysis).
• For evaluating the arithmetic expressions

List of Tutorials/Experiments:
1. Finite state machine and NFA with and without epsilon.
2. NFA to DFA, DFA minimization (Myhill-Nerode theorem), Moore and Mealy machines
3. Regular expressions, Arden’s theorem
4. Derivation, Parse tree, ambiguity, Right and left linear grammar
5. CNF and GNF
6. Push down automata
7. Pumping lemma: RL and CFL,CFG to PDA
8. Turing Machine
9. Implement any 1 application of finite automata
10. Implement any 1 application of push down automata

Books Recommended:
Text books:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “ Introduction to Automata Theory,
Languages and Computation”, Pearson Education.
2. J.C.Martin, “Introduction to languages and the Theory of Computation”, TMH.
3. Michael Sipser, “Theory of Computation”,Cengage Learning.

Reference Books:
1. O.G.Kakde, “Theory of Computation”, LP.
2. Krishnamurthy E.V., “Introductory Theory of Computer Science”, East-West press.

Evaluation Scheme:
Semester End Examination (A):
Theory:
3. Question paper based on the entire syllabus, summing up to 75 marks.
4. Total duration allotted for writing the paper is 3 hrs.

Continuous Assessment (B):

Theory:
4. Two term tests of 25 marks each will be conducted during the semesterout of which; one
will be a compulsory term test (on minimum 02 Modules) and the other can either be a
term test or an assignment on live problems.
5. Total duration allotted for writing each of the paper is 1 hr.
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

6. Average of the marks scored in both the two tests will be considered for final grading.

Prepared by Checked by Head of the Department Principal

 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Program: Second Year Computer Engineering Semester : IV

Course : Operating System Course Code: DJ19CEC403

Course : Operating System Laboratory Course Code: DJ19CEL403

Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Continuous Assessment Marks
Examination Marks (A) (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Lectures Practical Tutorial
Credits 75 25 25 25 100

Laboratory Examination Term work

Tutorial / Total
Assignment/ Term
Oral & Laboratory work
Oral Practical Mini project / 50
Practical Work
presentation/
3 2 -- 4 Journal

-- -- 25 15 10 25

Course objectives:

1. To introduce basic concepts and functions of different operating systems.

2. To understand the concept of process, thread and resource management.
3. To understand the concepts of process synchronization and deadlock.
4. To understand various Memory, I/O and File management techniques.

Course outcomes: On successful completion of course learner will be able to:

1. Understand basic functions of Operating System

2. Apply and evaluate process scheduling algorithms and IPC
3. Analyze various memory management techniques
4. Understand and interpret File and I/O management techniques
5. Discover functionalities of different operating systems
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Detailed Syllabus: (unit wise)

Unit Description Duration

1 Introduction to Operating System 04
Operating System Objectives and Functions, Evolution of operating system, OS Design
Considerations for Multiprocessor architectures, Operating System structures, System Calls
2 Process Management 07
Process: Concept of a Process, Process States, Process Description, Process Control Block,
Operations on Processes.
Threads: Definition and Types, Concept of Multithreading, Multicore processors and
threads.
Scheduling: Types of Scheduling: Preemptive and, Non-preemptive, Scheduling Algorithms
and their performance evaluation
: FCFS, SJF, SRTN, Priority based, Round Robin, Introduction to Thread Scheduling
3 Process Synchronization and Deadlocks 12
Concurrency: Principles of Concurrency, Inter-Process Communication, Process/Thread
Synchronization.
Mutual Exclusion: Requirements, Hardware and Software Support, Semaphores and Mutex,
Monitors, Classical synchronization problems: Readers/Writers Problem, Producer and
Consumer problem.
Principles of Deadlock: Conditions and Resource Allocation Graphs, Deadlock Prevention,
Deadlock Avoidance: Banker’s Algorithm for Single & Multiple Resources, Deadlock
Detection and Recovery. Dining Philosophers Problem.

4 Memory Management 08
Memory Management Requirements, Memory Partitioning: Fixed Partitioning, Dynamic
Partitioning, Memory Allocation Strategies: Best-Fit, First Fit, Worst Fit, Next Fit,
Relocation, Paging, Segmentation.
Virtual Memory: Demand Paging, Structure of Page Tables, Page Replacement Strategies:
FIFO, Optimal, LRU, LFU, Thrashing.

5 File System and I/O Management 08

File Management: Overview, File Organization and Access, Secondary Storage
Management: File Allocation Methods
Input /Output Management
I/O Management and Disk Scheduling: I/O Devices, I/O Buffering, Disk Scheduling
algorithm: FCFS, SSTF, SCAN, CSCAN, LOOK, C-LOOK. RAID
6 Case Studies 06
XV6 OS, Distributed OS, Real Time OS, Mobile OS

Books Recommended:
Text books:

1. William Stallings, Operating System: Internals and Design Principles, Prentice Hall, 8th Edition,
2014, ISBN-10: 0133805913 • ISBN-13: 9780133805918 .
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating System Concepts, John Wiley
& Sons , Inc., 9th Edition, 2016, ISBN 978-81-265-5427-0
3. Andrew Tannenbaum, Operating System Design and Implementation, Pearson, 3rd Edition.
4. D.M Dhamdhere, Operating Systems: A Concept Based Approach, Mc-Graw Hill

Reference Books:
1. Maurice J. Bach, “Design of UNIX Operating System”, PHI
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

2. Achyut Godbole and Atul Kahate, Operating Systems, Mc Graw Hill Education, 3rd Edition
3. The Linux Kernel Book, Remy Card, Eric Dumas, Frank Mevel, Wiley Publications.

Suggested List of Experiments:

List of Operating System Laboratory Experiments (DJ19CEL403): (At Least Ten)

Sr. No. Title of Experiments

1 Explore the internal commands of linux and Write shell scripts to do the
following:
Display top 10 processes in descending order
Display processes with highest memory usage.
Display current logged in user and logname.
Display current shell, home directory, operating system type, current path
setting, current working directory.
Display OS version, release number, kernel version.
Illustrate the use of sort, grep, awk, etc.
2 System calls for file manipulation
3 Building multi-threaded and multi-process applications

4 CPU scheduling algorithms like FCFS, SJF, Round Robin etc.

5 Process and Thread Synchronisation using client server mechanism
6 Synchronisation using Producer Consumer
7 Implement order scheduling in supply chain using Banker’s Algorithm
8 Using the CPU-OS simulator analyze and synthesize the following:
a. Process Scheduling algorithms.
b. Thread creation and synchronization.
c. Deadlock prevention and avoidance.
9 Implement various page replacement policies
10 Implement disk scheduling algorithm FCFS, SSTF, SCAN, CSCAN etc.
11 Building a scheduler in XV6
12 Building own file system
Any other experiment based on syllabus may be included, which would help the learner to understand
topic/concept.

Evaluation Scheme:

Semester End Examination (A):

Theory:
1. Question paper based on the entire syllabus, summing up to 75 marks.
2. Total duration allotted for writing the paper is 3 hrs.

Laboratory:
1. Oral & Practical examination will be based on the entire syllabus including, the practical’s
performed during laboratory sessions.

Continuous Assessment (B):

Theory:
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

1. Two term tests of 25 marks each will be conducted during the semester out of which; one will be a
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an
assignment on live problems or a course project.
2. Total duration allotted for writing each of the paper is 1 hr.
3. Average of the marks scored in both the two tests will be considered for final grading.

Laboratory: (Term work)

Laboratory work will be based on DJ19CEL403 with minimum 10 experiments to be incorporated.

The distribution of marks for term work shall be as follows:

i. Laboratory work (Performance of Experiments): 15 Marks
ii. Journal Documentation (Write-up and Assignments: 10 marks
The final certification and acceptance of term work will be subject to satisfactory performance of laboratory work
and upon fulfilling minimum passing criteria in the term work.

Prepared by Checked by Head of the Department Principal

 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Program: Second Year Computer Engineering Semester : IV

Course :Analysis of Algorithm Course Code:DJ19CEC404

Course :Analysis of Algorithm Laboratory Course Code:DJ19CEL404

Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Examination Continuous Assessment Marks
Marks (A) (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Practical Tutorial
Lectures Credits 75 25 25 25 100

Laboratory Examination Term work

Total
Tutorial / Term
Oral & Laboratory Mini project / work
Oral Practical 50
Practical Work presentation/
3 2 -- 4 Journal

-- -- 25 15 10 25

Prerequisite: C Programming

Objectives:
1. To provide mathematical approach for Analysis of Algorithms
2. To solve problems using various strategies
3. To analyze strategies for solving problems

Outcomes: On completion of the course, learner will be able:

1. Analyze time and space complexity of an algorithm.

2. Apply divide and conquer strategy to solve problems
3. Apply the concept of dynamic programming and Greedy method to solve problems
4. Understand the concepts of backtracking, and string-matching algorithms.
5. Apply the concept of linear programming to optimize the solution
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Detailed Syllabus: (Unitwise)

Unit Description Duration

1 Introduction toanalysis algorithms: 08
Introduction, Asymptotic notations (Big-Oh, small-oh, Big Omega, Theta notations).
Analysis of Selection Sort, Insertion Sort, Recurrences:Recursion Tree Method,
Substitution method, Master’s theorem.
2 Divide and Conquer : 08
Analysis ofQuick sort, Merge sort, Min-Max algorithm, FindingMedian, Efficient
algorithms for Integer arithmetic(Euclid's algorithm, Karatsuba's algorithm for integer
multiplication, fast exponentiation).
3 Dynamic Programming: 08
General strategy, 0/1 knapsack, Multistage graph, Single Source Shortest Path, All Pair
Shortest Path, Travelling salesman problem, Longest common subsequence problem.
4 Greedy Approach 05
General strategy,Knapsack problem, Single Source shortest path, Minimum Spanning Tree(
Prims and Kruskal Algorithm), Job Sequencing with deadline.
5 Backtracking Strategy and Linear Programming: 09
Backtracking Strategy:General strategy, nqueen problem, graph coloring, sum of subset
problem.
Linear Programming: Introduction to linear programming, geometric interpretation, LP
duality, Simplex algorithm, Linear optimization problems and their LP formulation.
6 String Matching Algorithms: 04
The naïve string matching Algorithms ,The Rabin Karp algorithm, String matching with
finite automata, The knuth Morris Pratt algorithm.

List of Laboratory Experiments: (At Least08)

Minimum 2 experiments should be implemented using any language on each algorithm design strategy
(Divide and conquer, dynamic programming, Greedy method, backtracking and string matching).
Suggested LaboratoryExperiments:

: Sr. No. Module Name Suggested Experiment List

1 Introduction to analysis of Selection sort , insertion sort.
algorithm Divide and Conquer Merge sort, Quick sort, Binary
Approach search.
2 Dynamic Programming Multistage graphs, single source
Approach shortest path, all pair shortest
path, 0/1 knapsack, Travelling
salesman problem, Longest
common subsequence.
3 Greedy Approach Single source shortest path,
Knapsack problem, Job
sequencing with deadlines,
Minimum cost spanning trees-
Kruskal and prim‟s algorithm,
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Optimal storage on tapes.

4 Backtracking andString 8 queen problem ( N-queen

Matching Algorithms problem), Sum of subsets,
Graph coloring, Any String
matching algorithm

Books Recommended:
Text Books:
1. T.H.Coreman , C.E. Leiserson,R.L. Rivest, and C. Stein, “Introduction to algorithms”, 2nd edition , PHI
publication 2005.
2. Ellis horowitz , Sartaj Sahni , S. Rajsekaran. “Fundamentals of computer algorithms” University Press

Reference Books:
1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw- Hill Edition.
2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
3. John Kleinberg, Eva Tardos, “Algorithm Design”, Pearson.
4. Michael T. Goodrich, Roberto Tamassia, “Algorithm Design”, Wiley Publication.

Evaluation Scheme:
Semester End Examination (A):
Theory:
5. Question paper based on the entire syllabus summing up to 75 marks.
6. Total duration allotted for writing the paper is 3 hrs.
Laboratory:
1. Oral& Practical examination will be based on the entire syllabus including, the practical’s performed during
laboratory sessions.

Continuous Assessment (B):

Theory:
1. Two term tests of 25 marks each will be conducted during the semester out of which; one will be a
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an assignment on
live problems.
2. Total duration allotted for writing each of the paper is 1 hr.
3. Average of the marks scored in both the two tests will be considered for final grading.

Laboratory: (Term work)

Laboratory work will be based on DJ19CEL404 with minimum 08 experiments to be incorporated.

The distribution of marks for term work shall be as follows:

i. Laboratory work (Performance of Experiments): 15 Marks
ii. Journal Documentation (Write-up and Assignments: 10 marks
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

The final certification and acceptance of term work will be subject to satisfactory performance of laboratory work
and upon fulfilling minimum passing criteria in the term work.

Prepared by Checked by Head of the Department Principal

 Proposed Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-21)

Program: Second Year Computer Engineering Semester : IV

Course : Computer Network Course Code: DJ19CEC405

Course : Computer Network Laboratory Course Code: DJ19CEL405

Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Examination Continuous Assessment Marks
Marks (A) (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Practical Tutorial
Lectures Credits 75 25 25 25 100

Laboratory Examination Term work

Total
Tutorial / Term
Oral & Laboratory Mini project / work
Oral Practical 50
Practical Work presentation/
3 2 -- 4 Journal

-- - 25 15 10 25

Objectives:
1. To be familiar with contemporary issues in networking technologies.
2. To be familiar with network tools and network programming
3. To explore the issues and challenges of protocols design while delving into TCP/IP protocol suite.
4. To assess the strengths and weaknesses of various routing algorithms.
5. To understand the transport layer and various application layer protocols

Outcomes: On completion of the course, learner will be able:

1. Demonstrate the concepts of data communication at physical layer and compare ISO - OSI model with
TCP/IP model.
2. Demonstrate the knowledge of networking protocols at data link layer.
3. Design the network using IP addressing and subnetting / supernetting schemes.
4. Analyze various routing algorithms and protocols at network layer.
5. Analyze transport layer protocols and congestion control algorithms.
6. Explore protocols at application layer.
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

Detailed Syllabus: (unit wise)

Unit Description Duration

1 Introduction to Networking 06
Introduction to computer network, network application, network software and hardware
components, Network topology, design issues for the layers.
Reference models: Layer details of OSI, TCP/IP models.
2 Physical Layer: 06
Introduction to Digital Communication System: Guided Transmission Media: Twisted pair,
Coaxial, Fiber optics. Unguided media (Wireless Transmission): Radio Waves, Microwave,
Bluetooth.

3 Data Link Layer 10

Design Issues: Framing, Error Control: Error Detection and Correction (Hamming Code, CRC,
Checksum), Flow Control: Stop and Wait, Sliding Window (Go Back N, Selective Repeat),
Elementary Data Link protocols, HDLC,PPP.
Medium Access Control Sublayer:
Channel Allocation problem, Multiple Access Protocol (Aloha, Carrier Sense Multiple Access
(CSMA/CA, CSMA/CD), Wired LANS: Ethernet, Ethernet Standards, Virtual LANs.
4 Network Layer 12
Network Layer design issues, Communication Primitives: Unicast, Multicast, Broadcast. IPv4
Addressing (Classfull and Classless), Subnetting, Supernetting design problems ,IPv4 Protocol,
Network Address Translation (NAT) 4.2 Routing algorithms : Shortest Path (Dijkastra‘s), Link
state routing, Distance Vector Routing 4.3 Protocols - ARP,RARP, ICMP, IGMP 4.4 Congestion
control algorithms: Open loop congestion control, Closed loop congestion control, QoS
parameters, Token & Leaky bucket algorithms.
5 Transport Layer 08
The Transport Service: Port Addressing, Transport service primitives, Berkeley Sockets,
Connection management (Handshake, Teardown), UDP, TCP, TCP state transition, TCP timers
5.2 TCP Flow control (sliding Window), TCP Congestion Control: Slow Start .
6 Application Layer 06
DNS: Name Space, Resource Record and Types of Name Server. HTTP, HTTPS,SMTP, Telnet,
FTP, DHCP.

List of Laboratory Experiments: (At LeastTen)

1. A Study of LAN Topology.
B. Study of various Network devices.
2. Installation & Configuration of NS2 in Linux environment. -Study of diff. topologies and create duplex
link in NS2.
3. Building of wired & wireless topology using Network tool.
4. Write a program to implement
A) Error Detection and correction
B) Framing
5. Implement stop and wait protocol in NS2.
6. Write a program to implement Sliding Window- Selective Repeat, Go Back n.
7. Build class A & Class B Network using router and Implement subnetting concept.
8. Write a program to implement Routing algorithm.
9. Write a program to find out class of a given IP address, subnet mask & first & last IP address of that block.
10. Write a program to implement Congestion Control algorithm.
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

11. Write a program to build client-server model on different computers. Implement TCP-UDP scenario in
NS2/NS3.
12. Install and configure Network Management/ Monitoring Tools.
Any other experiment based on syllabus may be included, which would help the learner to understand
topic/concept.

Books Recommended:
Text books:
1. A.S. Tanenbaum, ―Computer Networks‖, Pearson Education, (4e)
2. B.A. Forouzan, ―Data Communications and Networking‖, TMH (5e)
3. Oliver C Ibe - Fundamentals of Data Communication Networks, First , Wiley Publications.
4. James F. Kurose, Keith W. Ross, ―Computer Networking, A Top-Down Approach Featuring the Internet‖,
Addison Wesley, (6e)
Reference Books:
1. S.Keshav: An Engineering Approach To Computer Networking, Pearson
2. Natalia Olifer& Victor Olifer,―Computer Networks: Principles, Technologies & Protocols for Network
Design‖, Wiley India, 2011.
3. Larry L.Peterson, Bruce S.Davie, Computer Networks: A Systems Approach, Second Edition (The Morgan
Kaufmann Series in Networking).
Evaluation Scheme:
Semester End Examination (A):
Theory:
1. Question paper will be based on the entire syllabus summing up to 75 marks..
2. Total duration allotted for writing the paper is 3 hrs.
Laboratory:
2. Oral& Practical examination will be based on the entire syllabus including, the practicals performed
during laboratory sessions.
Continuous Assessment (B):
Theory:
1. Two term tests of 25 marks each will be conducted during the semester out of which; one will be a
compulsory term test (on minimum 02 Modules) and the other can either be a term test or an assignment
on live problems or a course project.
2. Total duration allotted for writing each of the paper is 1 hr.
3. Average of the marks scored in both the two tests will be considered for final grading.
Laboratory: (Term work)
Laboratory work will be based on DJ19CEL405 with minimum 10 experiments to be incorporated.
The distribution of marks for term work shall be as follows:
iii. Laboratory work (Performance of Experiments): 15 Marks
iv. Journal Documentation (Write-up and Assignments: 10 marks
The final certification and acceptance of term work will be subject to satisfactory performance of laboratory work
and upon fulfilling minimum passing criteria in the term work.

Prepared by Checked by Head of the Department Principal

 Proposed Syllabus for Second Year Biomedical Engineering - Semester IV (Autonomous)
Program: Common for All programs(Academic Year 2020-2021) Semester : IV

Course :Constitution of India Course Code :DJ19A2

Evaluation Scheme
Teaching Scheme
(Hours / week) Semester End Continuous Assessment Marks
Examination Marks (A) (B) Total
marks
Term Term (A+ B)
Theory Avg.
Test 1 Test 2
Total
Practical Tutorial
Lectures Credits - - - - -

Laboratory Examination Term Work

Oral &
Oral Practical
Practical -
01 - - - -
- - -

Objectives:
1. To provide basic information about Indian constitution.
2. To identify individual role and ethical responsibility towardssociety.
3. To understand human rights and itsimplications.

Outcomes: On completion of the course, learner will be able to

1. Have general knowledge and legal literacy and thereby to take up competitive examinations.
2. Understand state and central policies, fundamentalduties.
3. Understand Electoral Process, special provisions.
4. Understand powers and functions of Municipalities, Panchayats and Co- operative Societies,
5. Understand Engineering ethics and responsibilities of Engineers
6. Understand Engineering Integrity & Reliability

Detailed Syllabus : (unit wise)

Unit Description Duration

1 Introduction to the Constitution of India
The Making of the Constitution and Salient features of the Constitution. 02
Preamble to the Indian Constitution Fundamental Rights & its limitations.
2 Directive Principles of State Policy:
Relevance of Directive Principles State Policy Fundamental Duties. 05
Union Executives – President, Prime Minister Parliament Supreme Court of India.
3 State Executives:
Governor, Chief Minister, State Legislature High Court of State. 07
Electoral Process in India, Amendment Procedures, 42nd, 44th, 74th, 76th,
 Syllabus for Second Year Computer Engineering - Semester IV (Autonomous)
(Academic Year 2020-2021)

86th&91stAmendments.
4 Special Provisions:
For SC & ST Special Provision for Women, Children & Backward Classes Emergency
Provisions.
Human Rights: 04
Meaning and Definitions, Legislation Specific Themes in Human Rights- Working of
National Human Rights Commission in India Powers and functions of Municipalities,
Panchyats and Co – OperativeSocieties.
5 Scope & Aims of Engineering Ethics:
Responsibility of Engineers Impediments to Responsibility. 06
Risks, Safety and liability of Engineers, Honesty, Integrity & Reliability in Engineering

Books Recommended :

Text books:
1. Durga Das Basu: “Introduction to the Constitution on India”, (Students Edn.) Prentice –Hall
EEE, 19th / 20th Edn., 2001
2. Charles E. Haries, Michael S Pritchard and Michael J. Robins “Engineering Ethics”
Thompson Asia, 2003-08-05.

Reference Books:
1. M.V.Pylee, “An Introduction to Constitution of India”, Vikas Publishing, 2002.
2. M.Govindarajan, S.Natarajan, V.S.Senthilkumar, “Engineering Ethics”, Prentice – Hall of
India Pvt. Ltd. New Delhi, 2004
3. Brij Kishore Sharma,“ Introduction to the Constitution of India”, PHI Learning Pvt. Ltd., New
Delhi, 2011.
4. Latest Publications of Indian Institute of Human Rights, New Delhi

Website Resources:
1. www.nptel.ac.in
2. www.hnlu.ac.in
3. www.nspe.org
4. www.preservearticles.com