FOURTH SEMESTER

Sl. No Sub. Code Subject L-T-S Credits Hours

1 CSC401 Computer Organization and Architecture 3-1-0 4 4

2 CSC402 Theory of Computation 3-0-0 3 3

3 CSC403 Design and Analysis of Algorithms 3-1-0 4 4

4 CSC404 Object Oriented Programming 3-0-0 3 3

5 CSC405 Signals and Systems 3-0-0 3 3

6 YYO44*/ Open Elective - 1/ 3-0-0 3 3

HSC431 Psychology

7 CSS451 Computer Organization Laboratory 0-0-3 1.5 3

8 CSS452 Object Oriented Programming Laboratory 0-0-3 1.5 3

9 CSS453 Signal Processing Laboratory 0-0-3 1.5 3

10 XXS481 Co-curricular Activities - IV (Optional) 0-0-0 0 0

TOTAL 18-2-19 24.5 29

4th Semester
Basket of Open Elective – 1
CSO441 Data Structures and Algorithms
CSO442 Object Oriented Technology
CSC 401 Computer Organization and Architecture 3-1-0 4Credits 4Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 401 Computer PCR 3 1 0 4 4
Organization and
Architecture
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
Digital Logic Design (CSC302) CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
Course ● CO1: Analyze the various parts of a modern computer functional units, bus structure,
Outcomes addressing modes and Computer arithmetic.
● CO2: Identify the process involved in executing an instruction and fetching the word
from memory.
● CO3: Design the hardwired and micro-programmed control units and
implementation of interrupts.
● CO4: Understand the memory hierarchy and design a memory system.
● CO5: Understand Pipelined execution and instruction scheduling.

Topics UNIT-I: Introduction: Evolution of computers, Basic Structure of Computers: Basic

Covered Operational Concepts, GPR based and stack based organisation. Bus Structures,
Performance Measurement: Processor Clock, Basic Performance Equation, Clock Rate,
Machine Instructions and Programs: Memory Location and Addresses, Memory Operations,
Instructions and Instruction Sequencing, Addressing Modes, Assembly Language, Basic
Input and Output Operations, Encoding of Machine Instructions (Huffman encoding etc).
(12L)

UNIT-II: Fundamental concepts of the processing Unit: Fetching and Storing words,
Register Transfer, Execution of instruction, Arithmetic Operations: Addition and
Subtraction of Signed Numbers, Design of Fast Adders, Combinational and Sequential
ALU, ALU expansion strategies, Design of Multipliers and Dividers, Wallace tree and
Booth’s Multipliers, Floating Point Numbers (IEEE754), Floating Point Operations,
Multiplication of Positive Numbers, Signed Operand Multiplication (Booth’s Multiplication
etc.), Fast Multiplication, Integer Division. (10L)

UNIT-III: Computer Organization and Design (Datapath and control path): Instruction
codes, computer registers, computer instructions, timing & control, instruction cycle,
memory reference instructions, Hard-wired Control, Micro programmed Control: Micro
instruction, Microprogram sequencing, Input/output Organization: Accessing I/O Devices,
Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple
Devices, Controlling Device Requests, Exceptions, Direct Memory Access, Buses, Interface
Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, Bus Arbitration schemes, USB.
(Brief overview of 8085/8086 microprocessor). (12L)

UNIT-IV: Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only
Memories, Speed, Size, and Cost, Cache Memories – Mapping Functions, Replacement
Algorithms, page mode access, interleaved access. Performance Considerations, Virtual
Memories, Secondary Storage. (12L)
 UNIT-V: Basic concepts of pipelining, the instruction pipeline – pipeline hazards –
instruction level parallelism – reduced instruction set –Computer principles – RISC versus
CISC. Introduction to GPP, ASIP and ASIC etc. (10L)
Text Books, Text Books:
and/or 1. David A Patterson, John L Hennessy, “Computer Organization and Design”, (The
reference Hardware/Software Interface) Morgan Kaufmann.
material 2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th Edition,
Tata McGraw Hill.

Reference Books:
1. William Stallings, “Computer Organization and Architecture”.
2. Nicholas P Carter, “Computer Architecture & Organisation”.
CSC 402 Theory of Computation 3-0-0 3Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
Theory of PCR 3 0 0 3 3
CSC402 Computation
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
Discrete Mathematics (CSC CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
301)
Course ● CO1: Explain the concept of regular languages through regular expressions and
Outcomes finite automata.
● CO2: Describe context-free languages and context free grammars.
● CO3: Design grammars and automata for various languages.
● CO4: Examine the power of Turing machines and design TM for simple problems.
● CO5: Analyze the concept of undecidability in the context of Turing machine
design.
Topics 1. Regular sets and Regular Expression, Non-deterministic and deterministic finite
Covered automata and their equivalence, Minimization of deterministic finite automata,
Regular expressions to Finite Automata. (10L)
2. Finite Automata with outputs. (2L)
3. Properties of Regular Sets: Pumping Lemma, Closure Properties, Decision
algorithms. (5L)
4. Context Free Grammars. Derivations. Ambiguity in grammars. (3L)
5. Chomsky hierarchy of languages and grammars. Regular grammars. (3L)
6. Normal Forms for Context free grammars. CNF and GNF. Closure properties of
context free languages, Pumping lemma for context free languages. Decision
Properties. (10L)
7. Pushdown automata. (3L)
8. Turing machines. Unrestricted Grammars. Properties of recursive and
r.e.languages, Undecidability. (6L)

Text Books, Text Books:

and/or 1. Introduction to Automata Theory, Languages and Computation
reference by J.E.Hopcroft, Rajiv Motwani and J.M.Ullman.
material Pearson Education.
2. Introduction to Languages and Theory of Computation
By John C. Martin
McGraw Hill Education

Reference Books:
1. Elements of the Theory of Computation
By Harry R. Lewis and Christos H. Papadimitriou
Prentice Hall of India.
2. Theory of Automata and Formal Languages
By Anand Sharma
University Science Press
CSC 403 Design and Analysis of Algorithms 3-1-0 4Credits 4Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 403 Design and PCR 3 1 0 4 4
Analysis of
Algorithms
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
Discrete Mathematics (CSC CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
301), Data Structure and
algorithm (CSC 303)
Course ● CO1: Students will be able to define many important concepts such as asymptotic
Outcomes analysis, dynamic programming, recurrences etc.
● CO2: Students will be able to describe the key ideas of different algorithm design
paradigms.
● CO3: Can apply different algorithmic ideas efficiently to solve new problems.
● CO4: Students can analyze and understand the time complexity of the algorithms,
and its correctness.
● CO5: Can evaluate the hardness of an algorithm if required.
Topics Introduction and basic concepts: Algorithm, Asymptotic notations (big-Oh, big Omega,
Covered Theta, small-oh) and their significance, introduction to RAM model of computation,
complexity (Time Complexity, Space Complexity) analysis of algorithms, worst case and
average case. Solving Recurrences – Substitution method, Recurrence tree method and
Master Method, Finding maximum and minimum of n numbers, Finding the second largest
of n numbers and exact number of comparisons. (7L)

Lower bound: Lower bound for a problem. Computing the lower bound for sorting
(comparison based sorting) and computing the lower bound for computing convex hull using
the lower bound for sorting problem. (2L)

Amortized complexity analysis: aggregate analysis, accounting method and potential

method. Examples: storage allocation problem, binary counting problem and heap sort. (4L)

Using Induction to Design algorithm: The celebrity problem, Majority Finding problem.
(2L)

Divide and conquer Problem: Multiplication of two n-bit integers, Strassen’s Matrix
Multiplication problem, Closest pair of points, linear time median finding algorithm,
Convex hull and its computation. (6L)

The Greedy Algorithm: Greedy algorithms and their correctness proof: Interval
scheduling problem, Interval partitioning problem, Minimizing the Lateness of Intervals
problem, Fractional Knapsack Problem. (5L)

Dynamic Programming: Longest Common Subsequence, Matrix Chain Multiplication, 0-

1 Knapsack Problem, longest common subsequence problem. (6L)
 Backtracking Method, Branch and Bound Method. (2L)

Graph Algorithms: Depth First Search, Breadth First Search, Dijkstra's Single Source
Shortest Path algorithm; All pair shortest path algorithm, Minimum Spanning Tree (Prim's
and Kruskal's algorithm). (7L)

Randomized Algorithm: Las Vegas and Monte Carlo; Randomized Quick Sort algorithm
and Min Cut problem. (3L)

Reducibility between problems and NP-completeness: Different class of Problems (P,

NP, NP-Hard, NP-Complete), Discussion of different NP-complete problems like
satisfiability, clique, vertex cover, independent set, Hamiltonian cycle, set cover, dominating
set problem. (6L)

Approximation Algorithm: Approximation ratio for maximization problem and

minimization problem, Constant ratio approximation algorithms for metric travelling
salesperson problem (TSP) and vertex cover problem, log n ratio approximation algorithm
for Set Cover problem. (6L)

Text Books, Text Books:

and/or
reference 1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms,
material by Prentice Hall India.
2. J. Kleinberg and Eva Tardo, Algorithm Design by Pearson Education (Indian edition).
3. S. Dasgupta, C. Papadimitriou and U. Vazirani, Algorithms, by Tata McGraw-Hill.

Reference Books:

1. Michael T. Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis,

and Internet Examples, Second Edition, Wiley, 2006.
2. Algorithms: Design Techniques and Analysis Volume 7 of Lecture notes series on
computing, World Scientific, 1999.

Others: Tim Roughgarden’s video lectures and notes of CS161 and CS261; NPTEL’s
lectures on Design and Analysis of Algorithms; NMEICT video on Design of Algorithms
(http://www.nmeict.iitkgp.ac.in/Home/videoLink/10/3gp).
CSC 404 Object Oriented Programming 2-1-0 3Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 404 Object Oriented PCR 2 1 0 3 3
Programming
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
Introduction to Computing CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
(CSC01), Data Structures and
Algorithms (CSC303)
Course ● CO1: Apply Object oriented approach to design software.
Outcomes ● CO2: Implement programs using classes and objects.
● CO3: Specify the forms of inheritance and use them in programs.
● CO4: Analyze polymorphic behavior of objects.
● CO5: Design and develop GUI programs.
● CO6: Develop Applets for web applications.
Topics Course Introduction- Concepts of Object Oriented Programming, Procedural approach,
Covered Limitation of Procedural Language, Object concept. (2L)

Object Oriented Terminologies- Class concept, ADT, encapsulation, Cardinality, Data

hiding, Inheritance, Polymorphism, Advantages of OOPs, Advantages of OOPs, difference
between Procedural and Object Oriented Language, Evolution of C++. (4L)
Basic Input/Output in C++ - The 1st C++ Program (temperature conversion),
compilation, Input stream and output stream, Advantages of cin a cout over pritnf and
scanf. (3L)
Basic C++ features - Literals, Constants, Manipulators, Assertions, Enumerated Data
Types, Scope resolution operator. (5L)
Pointers & References in C++- Basic operations on pointers, Array of pointers, pointer to
an array, self referential structures, References in C++ , use of references. (7L)
Dynamic memory allocation/deallocation- Use of new and delete operator, multi-
dimensional array allocation, Examples. (5L)
Constructor and Destructor, Various examples of constructors, Constructor Salient
Features, Destructors,, Examples. (2L)
Functions in C++; Overloading- function call, Macros, and it’s limitations, Inline
function, Function Overloading, Constructor Overloading, Examples, Function with
Default arguments, Various Examples of Default arguments. (5L)
Writing C++ Classes- Class, C++ class vs Structure, This pointer, Memory Layout of C++
program, Static member of class. Static Member Functions, Static Object, Examples. (5L)
C++ Constants Revisited - Storage Allocation, Constants and References, Constant
member data and Functions, Constants Objects, Examples. (2L)
 Friend Function & Operator Overloading - Friend Functions, Use of friend functions,
friends as bridges, Various examples, Operator Overloading, examples, advantages of
friend functions during overloading. (6L)
Templates in C++, Generic function and classes, examples, syntax of a template, Template
class (5L)
Inheritance in C++, Derive class, Parameterized constructor in derive class, Protector
Specifier, Examples of different types of inheritance, Virtual Base Class, Up casting.
Polymorphism and virtual function, Function call finding, Virtual Functions, Examples.
Lecture (38): V Table and V pointer, Pure Virtual Function, Examples.
Lecture (39-40): Exception Handling in C++
Lecture (41): Unformatted Input/ Output operations, Formatted I/O functions, File
handling.

2-3 Lectures are planned for doubt clearance.

Text Books, Text Books:
and/or 1. Adam Drosdek, “DATA STRUCTURES AND ALGORITHMS IN C++” ,
reference Brooks/Cole Thomson Learning.
material 2. Bjarne Stroustrup “The C++ Programming Language”, Pearson Education.
3. E. Balaguruswamy, “Object Oriented Programming with C++”, Tata McGraw Hill.
Reference Books:
1. Bruce Eckel, “Thinking in C++”, Prentice Hall.
2. S. B. Lippman, J. Lajoie, B. E. Moo, “C++ Primer”, Addison-Wesley Professional
3. Bjarne Stroustrup, “Programming: Principles and Practice Using C++”, Addison-
Wesley Professional.
4. Effective C++: 50 Specific Ways to Improve Your Programs and Design by Scott
Meyers, 1997.
5. More Effective C++ by Scott Meyers, 2002.

Others:
NPTEL course link by Prof. Partha Pratim Das - https://onlinecourses-
archive.nptel.ac.in/noc19_cs10/preview
CSC 405 Signals and Systems 3-0-0 3Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSC 405 Signals and PCR 3 0 0 3 3
Systems
Pre-requisites Course Assessment methods (Continuous Assessment (CA), Mid-Term
(MT), End Term (ET))
Calculus, Linear algebra CA+ MT + ET [CA: 15%, MT: 25%, ET: 60%]
Course The students, after successfully completing the course, will be able to:
Outcomes ● CO1: Understand the definitions, classifications, properties and applications of
signals and systems.
● CO2: Understand Laplace Transform, Fourier Transform, z-transform and other
mathematical operations on signals.
● CO3: Understand Properties of LTI system.
● CO4: Analyze continuous time and discrete time signals in time and Transform
domain by applying mathematical tools like Laplace transform, Fourier transform,
z-transform.
● CO5: Design and analyze continuous and discrete time systems.
● CO6: Compare continuous time and discrete time systems in real life applications.

Topics Introduction to Signals and systems, introduction to signals, classification of signals;

Covered mathematical operations of signals, some standard signals, generating signals using
standard signals. (6L)

Introduction to systems, classification of systems, Linear Time Invariant (LTI) Systems

(continuous-time and discrete-time systems), properties of LTI systems, impulse response,
convolution, causality, stability; (6L)
Impulse response of discrete-time LTI systems, discrete time convolution, difference
equations and analysis, developing equivalent discrete-time system from a given
continuous-time system and analysis of their stability; (4L)

Laplace Transform, Properties of Laplace Transform, Inverse Laplace Transform; (4L)

Applications of Laplace Transforms to design and analyse continuous-time systems,

transfer function of continuous-time systems, poles and zeros, stability analysis; (4L)

Introduction to z-Transform, Properties of z-Transform, Region of Convergence, Inverse

z-Transform; (3L)

Applications of z-Transforms to design and analyse Discrete Time Systems (3L)

Introduction to Fourier analysis, Fourier series for periodic signals, discrete spectrum of
periodic signals; (2L)
 Introduction to Fourier transform, properties of Fourier transform, energy and power
spectral density, frequency response of continuous-time systems, some problem examples;
(4L)

Fourier analysis of Discrete Signals, Discrete Time Fourier Transform (DTFT), Properties
of DTFT, Examples of DTFT, DFT. (4L)

Concept of state, state space analysis, state space representation of continuous time
systems (2L)

Text Books, Text Books:

and/or 1. Signals and Systems, 2nd ed., Simon Heykin and Barry Van Veen, John Wiley & Sons.
reference 2. Signals and Systems, Oppenheim and Willsky, Prentice Hall Signal Processing Series.
material
Reference Books:
1. Signal Processing and linear systems, B. P. Lathi, Oxford University Press.
2. Theory and Problems of Signals and Systems, Hsu, Schaum’s Outline Series.
CSS 451 Computer Organization Laboratory 0-0-3 1.5Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
Computer PCR 0 0 3 3 1.5
CSS 451 Organization
Laboratory
Pre-requisites Course Assessment methods (Continuous (CT) and End assessment
(EA))
Digital Logic Design (CSC302), CT+EA [CT: 60%, EA(Laboratory assignment + Viva Voce): 40%]
Digital Logic Design laboratory
(CSS351)
Course ● CO1: Understand the basic structure of digital computer.
Outcomes ● CO2: Understand the synchronous / asynchronous logic.
● CO3: Perform different operations with flip-flop.
● CO4: Understand arithmetic and control unit operation.
● CO5: Understand the basic concepts of Memory.
Topics 1. Introduction to Verilog HDL and Implementation of basic logic gates using Verilog.
Covered 2. Familiarization of Assembly language programming.
3. Implementation of combinational circuits using Verilog.
4. Implementation of sequential circuits using Verilog.
5. Implementation of Booth’s Multiplier circuit.
6. Synthesis of simple data path and Controllers, Processor Design
7. Implementation of Random Access Memory (RAM) to perform both R/W operation.
8. Mini project.
Text Books, Text Books:
and/or 1. David A Patterson, John L Hennessy, “Computer Organization and Design”, (The
reference Hardware/Software Interface) Morgan Kaufmann.
material 2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky: Computer Organization, 5th Edition,
Tata McGraw Hill.

Reference Books:
1. William Stallings, “Computer Organization and Architecture”.
2. Nicholas P. Carter, “Computer Architecture & Organisation”.
Others: Laboratory Manual
CSS 452 Object Oriented Programming Laboratory 0-0-3 1.5Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSS452 Object Oriented PCR 0 0 3 3 1.5
Programming
Laboratory
Pre-requisites Course Assessment methods (Continuous (CT) and End assessment
(EA))
Introduction to Computing CT+EA [CT: 60%, ET(Laboratory assignment + Viva Voce): 40%]
(CSC01), Data Structures and
Algorithms (CSC303)
Course ● CO1: Design and develop utilities for screen and keyboard processing.
Outcomes ● CO2: Design and implement TSR programs.
● CO3: Develop programs using objects and inheritance in Java Language.
● CO4: Design and implement GUI programs using components in Java
Language.
Topics Assignment 1: Design codes using OOL syntax; use of manipulators, dynamic allocation,
Covered multi-dimensional array writing application like addition, subtraction, multiplication,
finding factorial of a large numbers etc.
Assignment 2: Develop codes involving binary and text files involving string
manipulation, graph processing, etc.
Assignment 3: Design class library for implementing matrix, complex number, string,
stack, queue, linked list, heap, binary search tree, polynomial, etc.
Assignment 4: Develop class library to implement application like hashing, huffman code,
expression evaluation using the libraries developed in assignment 3.
Assignment 5: Enhance the class libraries in assignment 3&4 implementing function
overloading.
Assignment 6: Enhance the class libraries in assignment 3&4 implementing operator
overloading.
Assignment 7: Develop codes using inheritance.
Assignment 8: Design and develop template classes.
Assignment 9: Implement exception handling in some existing template classes .
Text Books, Text Books:
and/or 1. Bruce Eckel, “Thinking in C++”, Prentice Hall.
reference 2. S. B. Lippman, J. Lajoie, B. E. Moo, “C++ Primer”, Addison-Wesley Professional
material 3. Bjarne Stroustrup, “Programming: Principles and Practice Using C++”, Addison-
Wesley Professional.
4. Effective C++: 50 Specific Ways to Improve Your Programs and Design by Scott
Meyers, 1997.
5. More Effective C++ by Scott Meyers, 2002.

Others:

NPTEL course link by Prof. Partha Pratim Das - https://onlinecourses-

archive.nptel.ac.in/noc19_cs10/preview
CSS 453 Signal Processing Laboratory 0-0-3 1.5Credits 3Hours

Department of Computer Science and Engineering

Course Title of the course Program Core Total Number of contact hours Credit
Code (PCR) / Lecture Tutorial Practical Total
Electives (PEL) (L) (T) (P) Hours
CSS 453 Signals and PCR 0 0 3 3 1.5
Systems Laboratory
Pre-requisites: Course Assessment methods (Continuous (CT) and End assessment
(EA))
MATLAB, Python CT+EA [CT: 60%, ET(Laboratory assignment + Viva Voce): 40%]
Course ● CO1: Simulate signals and systems using modern computer software packages
Outcomes (Matlab/Python).
● CO2: Generate and characterize various continuous and discrete time signals.
● CO3: Analyze signals time and frequency domain.
● CO4: Characterize system dynamics using impulse responses, transfer functions.
● CO5: Analyze the systems using Laplace transform and Z-transform.
● CO6: Design and analyze linear time-invariant (LTI) systems.
Topics 1. Introduction to Computer Software Package Matlab/Python
Covered 2. Simulation of standard of signals like
a. Unit step
b. Unit impulse
c. Ramp
d. Periodic sinusoidal sequences.
3. Basic operation on signals: Addition, Subtraction, Multiplication, Division,
shifting, scaling, etc.
4. Convolve and analyze signals in time domain.
5. Laplace transform and inverse Laplace transform of signals.
6. Convolution of signals in transformed domain and verification of convolution
property of Fourier and Z-transform.
7. Study of LTI system and its stability.
8. Design of Stable LTI systems.
9. Design of FIR and IIR systems.
10. Implement Fast Fourier Transform algorithm of a signal.
Text Books, Text Books:
and/or 1. Signals and Systems Laboratory with MATLAB, Alex Palamides and Anastasia
reference Veloni, CRC Press, 2011.
material Reference Books:
2. Anywhere-Anytime Signals and Systems Laboratory, Nasser Kehtarnavaz,
Fatemeh Saki, Morgan & Claypool, 2017.