2ND YEAR 3RD SEMISTER

Hours per week

Sl. Broad
Category Course
Category Course Title Credits
No. Code L T P
Total

A. THEORY

Computer Organization
1 ENGG Major CS301 3 0 0 3 3
and Architecture

Design and Analysis of

2 ENGG Major CS302 3 1 0 4 4
Algorithms

3 SCI Minor M(CS)301 Discrete Mathematics 3 0 0 3 3

Digital Logic and

4 ENGG Minor EC(CS)301 3 0 0 3 3
Electronics

A. PRACTICAL

1 ENGG Computer Organization

Major CS391 0 0 3 3 1.5
and Architecture Lab

2 ENGG Design and Analysis of

Major CS392 0 0 3 3 1.5
Algorithms Lab

1.5
3 ENGG Minor EC(CS)391 Digital Electronics Lab 0 0 3 3

Skill
4 IT Workshop Lab
ENGG Enhancem CS393 0 1 3 4 2.5
(SciLab/MATLAB/C++)
ent Course

Total of Theory, Practical 26 20

Course Name: Computer Organization and
Architecture Course Code:CS301
Contact: 3:0:0
Total Contact Hours: 36L
Credits: 3

Prerequisite: Digital Electronics

Course Contents:
Module 1[8L]:

IntroductiontoCPUandconceptsofALU[2L],InstructionformatandInstructionCycle[1L],AddressingModes [1L] Fixed-

point multiplication -Booth's algorithm. [2L], Fixed-point division - Restoring and non-restoring algorithms[1L],
Floating-point number representation-IEEE754 format and Floating-point arithmetic operation[1L].

Module 2 [7L]:

Introduction to basic computer architecture [1L], Stored Program Concepts: Von Neumann & Harvard Architecture
[1L], RISC VS CISC [1L],Amdahl law [1L], Performance measurement parameters – MIPS, MFLOPS, SPEC ratings,
CPI etc. [2L] Micro programmed and hardwired control unit [1L].

Module 3[8L]:

Pipelining: Basic concepts, instruction and arithmetic pipeline[2L], data hazards, control hazards and
structuralhazards, techniques for handling hazards[2L]Pipeline vs. Parallelism, Levels of parallelism [1L], Instruction-
Level Parallelism: Basic Concepts, Techniques for Increasing ILP, Superscalar, SuperPipelined and VLIW Processor
Architectures [2L], Array and Vector Processors[1L]

Module 4[9L]:

Introduction to memory-RAM and ROM [1L], Register transfer, memory transfer, Tri-state bus buffer, Memory
Hierarchy: Secondary memory [1L], Main Memory [1L], Cache Memory [1L], Mapping Technique in cache memory:
Direct, Full Associative and Set Associative [2L], Performance Implementation in Cache Memory [1L], Virtual
memory Concepts [1L], page replacement policies [1L].

Module 5[4L]:

Multiprocessor architecture: taxonomy of parallel architectures; Flynn Classification [1L], Centralized and Shared-
memory architecture: synchronization [1L], Interconnection Network (Omega, Baseline, Butterfly, Crossbar) [2L].
Course Name: Design & Analysis of Algorithm
Course Code:CS302
Contact: 3:1:0
Total Contact Hours: 36L
Credits: 4

Prerequisites: To know data-structure and basic programming

ability

Course Content:

Module-1 [4L]

Algorithm Development & Complexity Analysis: [4L] Stages of algorithm development for solving a problem:
Describing the problem, identifying a suitable technique, Design of an algorithm, Proof of Correctness of the
algorithm. Time and Space Complexity, Different Asymptotic notations – their mathematical significance.Solving
Recurrences: Substitution Method, Recurrence Tree Method, Master Theorem (Statement Only).

Module-2 [14L]

Algorithm Design Techniques Brute force techniques – Traveling Salesman Problem, Divide and Conquer - Matrix
multiplication: Strassenalgorithm, Greedy techniques - Fractional Knapsack problem, Job Sequencing with Deadline,
Graph Coloring, Finding Minimum Cost Spanning Tree, Dynamic programming - O/1 Knapsack problem, Matrix
chain multiplication, Travelling Salesman Problem, Backtracking-N-Queens Problem, Knights Tour on Chess Board.

Module-3 [3L]

String matching problem:Different techniques – Naive algorithm, string matching using finite automata, and Knuth,
Morris, Pratt (KMP) algorithm with their complexities.

Module-4 [5L]

Graph Algorithms Single Source Shortest Path -DijkstraAlgorithm, All pair shortest path – Floyd-Warshall Algorithm.
Network Flows, Maximum Flows – Ford-Fulkerson Algorithm, Push Re-label Algorithm, Minimum Cost Flows –
Cycle Cancelling Algorithm.

Module-5 [5L]

Complexity Classes:The Class P, The Class NP, Reducibility and NP-completeness – SAT (without proof), 3-SAT,
Vertex Cover, Independent Set, Maximum Clique.

Module-6 [5L]

Approximation and Randomized Algorithms [3L], Approximation Algorithms - The set-covering problem – Vertex
cover, K-center clustering. Randomized Algorithms - The hiring problem, Finding the global Minimum. Recent
Trends[2L]
Course Name: Discrete Mathematics
Course Code: M(CS)301
Contact: 3:0:0
Total Contact Hours: 36L
Credits: 3

Prerequisites: Higher Secondary Level Mathematics

CourseContent:

Module -1[16L]

Set Theory [8L]Set: Operations and Properties of set, Finite Set, Power Set, Cardinality of finite set, Cartesian
Product, Relation: Types of Relations, Properties of BinaryRelation, Equivalence Relation, Partial Ordering Relation
and Poset, Lattice.[4L] Combinatorics and Counting: Sum and product rule, Permutation and Combination Principle
of InclusionExclusion. Pigeon Hole Principle.[2L] Generating Functions and Recurrence Relations: Recursively
defined relation and functions, Discrete Numeric Function, Growth of Functions, Problems on Recurrence Relations
and their solutions using differentmethods.[2L]

Module-2[16L]

Mathematical Logic and Proof Techniques [8L] Propositional Logic:Basicsof Boolean Logic, Idea of Propositional
Logic, well-formed formula, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Inference
theory of Propositional Logic.[3L] Predicate Logic: Idea of First Order Predicate Logic and Quantifiers, well-formed
formula of predicate, Inference theory of Predicate Logic.[3L] Proof Techniques: Some Terminology, Proof Methods
and Strategies, Forward Proof, Proof by Contradiction, Proof by Contraposition, Proof of Necessity and
Sufficiency.[2L].

Module-3 [8L]

Theory of Numbers [4L] Well-Ordering Principle, Divisibility theory and properties of Divisibility, Fundamental
theorem of Arithmetic, Prime and Composite Numbers. [2L] Greatest Common Divisor and Euclidean Algorithm,
Congruence, Residue Classes. [2L]

Module-4 [16L]

Algebraic Structures [8L] Concepts of Groups, Subgroups and Order, Cyclic Groups, Cosets, Normal Subgroups,
Permutation and Symmetric groups, Group Homomorphisms.[5L] Elementary properties of Rings and related
problems[1L] Elementary properties of Fields and related problems. [1L] Elementary properties of Vector Space and
related problems. [1L]

Module-5 [16L]

Graph Theory [8L] Graph Terminologies and their properties: Degree, Connectivity, Path, Cycle, Sub-
Graph, Isomorphism, Eulerian and Hamiltonian Walks, Matrix representation of graphs, Shortest Path in Graph.
[2L] Graph Colouring and Matching: Colouring Vertices and Chromatic Number, Colouring Edges and
Total Colouring, Independence and Chromatic Partitioning, Cliques, Perfect Graphs, Bounds on Chromatic
Numbers, Chromatic Polynomials, Matching.[3L] Tree: Rooted Trees,Binary Search Tree and Tree Sorting,
Spanning Tree, Weighted Trees and prefix codes. [3L]
Course Name: Digital Logic and Electronics
Course Code: EC(CS)301
Contact: 3:0:0
Credit: 3
Total Contact Hours: 36L

Pre-requisite:

Basic concepts of Logic gates, Truth Tables, Concept of basic components of a digital
computer.

Course Content: –

Module – 1[8L]
Binary Number System [1L]; BCD, ASCII, EBDIC, Gray codes and their conversions [1L], Introduction and laws of
Boolean algebra [1L], Boolean functions, Minterm and maxterm, Prime implicants, Representation in SOP and POS
forms[2L], Minimization of logic expressions by Karnaugh Map and algebraic method [3L]

Module – 2[8L]
Combinational circuits:
Adder and Subtractor (half-full adder &subtractor) [2L], Serial & Parallel Adder, Carry look ahead adder and
Parity Generator[2L], Encoder, Decoder, Multiplexer [2L], Demultiplexer, Comparator, Code Converters [2L]

Module – 3[12L]
Sequential Circuits:
Flip-Flops, SR, JK, Master slave JK, D, T, characteristic Tables, Excitation tables [5L]. Basic concept of Synchronous
and Asynchronous counters, Up/Down Counters, Ring counter, Johnson counter, Design of Modulo-N Counter,
Counter applications [5L]. Registers (SISO, SIPO, PIPO, PISO) [2L].

Module – 4[8L]
A/D and D/A conversion techniques – Basic concepts (D/A:R-2-R only [2L], A/D: successive approximation
[2L])Logic families- TTL, ECL, MOS and CMOS - basic concepts [2L],Programmable logic Array, programmable
Array logic, Sequential Programmable Devices [2L].
Course Name: Computer Organization and Architecture Lab Course
Code: CS391
Contact: 0:0:3
Credits: 1.5

Prerequisites:
Knowledge of designing different circuits in Computer Organization Lab

List of Experiment:
1. Implement different types of Basic gates and simulate for truth tableverification.
2. Implement half adder circuit and simulate for truth tableverification.
3. Implement full adder circuit and simulate for truth tableverification.
4. Implement half subtractor circuit and simulate for truth tableverification.
5. Implement a full subtractor circuit and simulate for truth tableverification.
6. Implement Multiplexer, De-Multiplexer circuit and simulate for truth tableverification.
7. Implement Encoder, Decoder circuit and simulate for truth table verification.
8. Implement different types of flip flop and simulate for truth tableverification.
9. Implement different types of parallel circuits (SISO, SIPO, PISO, PIPO) and simulate theresult.
10. Implement ALU and simulate theresult.
11. Implement a RAM chip and simulate theresult.
12. InnovativeExperiments.

Course Name: Design & Analysis of Algorithm Lab

Course Code: CS392
Contact: 0:0:3
Credit: 1.5

Prerequisite:
Programming knowledge

Course Content:
A. Implementation of various Divide & Conquer Methods; viz. MatrixMultiplication.
B. Implementations of various Dynamic Programming Methods, viz. Matrix Chain Multiplication Method, Travelling
Salesman Problemetc.
C. Implementations of various Branch & Bound Techniques,viz.
D. Implementations of various Backtracking Methods, viz. n-QueenProblem.
E. Implementations of Greedy Method, viz. Fractional Knapsack Problem, Job Sequencing Problemetc.
F. Implementations of String-matching Algorithm viz. Naïve Algorithm, String Matching with Finite
Automataetc.
G. Implementations of Various Graph Algorithms, viz. Dijkstra ‘s Algorithm, Floyd Algorithmetc.
H. Implementation of some Real-Life TrendyProblems
Course Name: Digital Electronics Lab
Course Code: EC(CS)391
Contact: 0:0:3
Credit: 1.5

Prerequisite:
Basic concepts of Logicgates, Truth Tables, function realization –minimization of Logic expressions by K-
map, Concept of basic components of a digital computer, Binary Arithmetic

Course Content:

1. A) Realization of basic gates and universalgates.

B) Realization of basic gates using universal gates.
2. Design a Half adder and Full Adder circuit using basic gates and verify itsoutput.
3. Design a Half subtractor and Full Subtractor circuit using basic gates and verify itsoutput
4. Design an Adder/Subtractor compositeunit.
5. Design of a ‗Carry-Look-AheadAddercircuit.
6. Realization of a)Encoder, b)Decoder c) Multiplexer, d) De-mux, e)Comparator and their Truth Tableverification.
7. Realization of RS / JK / D flip flops using logicgates.
8. Design of Shift Register using J-K / D FlipFlop.
9. Realization of Synchronous Up/Downcounters.
10. Design of MOD- NCounter
11. Study ofDAC
12. Study of logic families andPLDs

Course Name: IT Workshop Lab (SciLab/MATLAB/C++) Course

Code: CS393
Contact: 0:1:3
Credits: 2.5

Prerequisite
Computer Fundamentals and principles of computer programming

Course Content:

1. Introduction of UNIX/Linux Operating System which includes preliminary commands, start-up & shutdown
methodology,file.
2. Handling as well as introduction to editors like Vi editor, introduction to GNU C & C++ compiler, as well as
introduction to GNU & GDBscript.
3. Introduction to C++, basic loop control, executingprograms.
4. Writing functions, selection statements, review of functions and parameters, command line arguments, recursion,
I/O streams, arrays and string manipulation, pointers, structures &unions.
5. Object-Oriented Programming in C++, fundamentals of classes,constructors-destructors.
6. Dealing with member functions, operator overloading and polymorphism (both static &dynamic).
7. Dealing with inheritance, derived classhandling.
8. Abstract class, virtual class, overriding, template class, name-space & exceptionhandling.
9. Dynamic memory allocation, implementation of Linked Lists, using C++.
10.MATLAB Environment, variable, constant, operators, loop, function.
11.MATLAB Toolbox, MATLAB Graphicfunction.
12. Reading and Writing to file, Numericalsimulation.
13. Innovativeexperiments/Projects
 R23 B. Tech CSE

2nd Year 4thSemester

Sl Broad Course Hours per week
Category Course Title Credits
No. Category Code L T P Total
A. THEORY

1 ENGG Major CS401 Operating Systems 3 0 0 3 3

2 ENGG Major CS402 Computer Networks 3 0 0 3 3

Formal Language and

3 ENG Major CS403 3 0 0 3 3
Automata Theory
Probability and
4 SCI Minor M(CS)401 3 0 0 3 3
Statistics
Ability
Principles of
5 HUM Enhancement HU(CS)401 2 0 0 2 2
Management
Course
B. PRACTICAL
Operating Systems
1 ENGG Major CS491 0 0 3 3 1.5
Lab
Computer Networks
2 ENGG Major CS492 0 0 3 3 1.5
Lab
Programming using
3 ENGG Major CS493 0 0 3 3 1.5
Python
Numerical Methods
4 ENGG Minor M(CS)491 0 0 3 3 1.5
Lab
Ability
5 HUM Enhancement HU(CS)491 Soft Skill & Aptitude 2 0 0 2 1
Course
Total of Theory,Practical 28 21