Course code Course Name L-T-P Credits Year of

Introduction
CS201 DISCRETE COMPUTATIONAL 3-1-0-4 2016
STRUCTURES
Pre-requisite: NIL
Course Objectives
1. To introduce mathematical notations and concepts in discrete mathematics that is
essential for computing.
2. To train on mathematical reasoning and proof strategies.
3. To cultivate analytical thinking and creative problem solving skills.

Syllabus
Review of Set theory, Countable and uncountable Sets, Review of Permutations and
combinations, Pigeon Hole Principle, Recurrence Relations and Solutions, Algebraic systems
(semigroups, monoids, groups, rings, fields), Posets and Lattices, Prepositional and Predicate
Calculus, Proof Techniques.

Expected Outcome:
Students will be able to
1. identify and apply operations on discrete structures such as sets, relations and functions
in different areas of computing.
2. verify the validity of an argument using propositional and predicate logic.
3. construct proofs using direct proof, proof by contraposition, proof by contradiction and
proof by cases, and by mathematical induction.
4. solve problems using algebraic structures.
5. solve problems using counting techniques and combinatorics.
6. apply recurrence relations to solve problems in different domains.

Text Books
1. Trembly J.P and Manohar R, Discrete Mathematical Structures with Applications to
Computer Science, Tata McGrawHill Pub.Co.Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied
Introduction, 4/e, Pearson Education Asia, Delhi, 2002.
References:
1. Liu C. L., Elements of Discrete Mathematics, 2/e, McGrawHill Int. editions, 1988.
2. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, Discrete Mathematical
Structures, Pearson Education Pvt Ltd., New Delhi, 2003
3. Kenneth H.Rosen, Discrete Mathematics and its Applications, 5/e, Tata McGraw Hill
Pub. Co. Ltd., New Delhi, 2003.
4. Richard Johnsonbaugh, Discrete Mathematics, 5/e, Pearson Education Asia, New
Delhi, 2002.
5. Joe L Mott, Abraham Kandel, Theodore P Baker, Discrete Mathematics for Computer
Scientists and Mathematicians, 2/e, Prentice-Hall India, 2009.
 Course Plan
Hou End Sem
Module Contents rs Exam
(54) Marks
Review of elementary set theory :
Algebra of sets Ordered pairs and Cartesian products 3
Countable and Uncountable sets
Relations :-
Relations on sets Types of relations and their properties 6
Relational matrix and the graph of a relation Partitions
I 15 %
Equivalence relations - Partial ordering- Posets Hasse
diagrams - Meet and Join Infimum and Supremum
Functions :-
Injective, Surjective and Bijective functions - Inverse of a 1
function- Composition

Review of Permutations and combinations, Principle of 3

inclusion exclusion, Pigeon Hole Principle,
Recurrence Relations:
Introduction- Linear recurrence relations with constant 4
coefficients Homogeneous solutions Particular solutions
II 15 %
Total solutions
Algebraic systems:-
Semigroups and monoids - Homomorphism, Subsemigroups 2
and submonoids

FIRST INTERNAL EXAM

Algebraic systems (contd):-
Groups, definition and elementary properties, subgroups, 6
Homomorphism and Isomorphism, Generators - Cyclic Groups,
III Cosets and Lagranges Theorem 15 %
Algebraic systems with two binary operations- rings, fields-sub 2
rings, ring homomorphism

Lattices and Boolean algebra :-

Lattices Sublattices Complete lattices Bounded Lattices - 7
Complemented Lattices Distributive Lattices Lattice
IV 15 %
Homomorphisms.
Boolean algebra sub algebra, direct product and
homomorphisms 3
SECOND INTERNAL EXAM
Propositional Logic:-
Propositions Logical connectives Truth tables 2
V 20 %
Tautologies and contradictions Contra positive Logical 3
 equivalences and implications

Rules of inference: Validity of arguments. 3

Predicate Logic:-
Predicates Variables Free and bound variables Universal 3
and Existential Quantifiers Universe of discourse.
Logical equivalences and implications for quantified statements
Theory of inference : Validity of arguments.
VI 20 %
3
Proof techniques:
Mathematical induction and its variants Proof by Contradiction
Proof by Counter Example Proof by Contra positive.
3
END SEMESTER EXAM
Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV; All
four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV; Two
questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

 Course Course Name L-T-P -Credits Year of
code Introduction

CS202 Computer Organization and 3-1-0-4 2016

Architecture
Pre-requisite: CS203 Switching theory and logic design
Course Objectives
1. To impart an understanding of the internal organization and operations of a computer.
2. To introduce the concepts of processor logic design and control logic design.
Syllabus
Fundamental building blocks and functional units of a computer. Execution phases of an
instruction. Arithmetic Algorithms. Design of the processing unit how arithmetic and logic
operations are performed. Design of the control unit hardwired and microprogrammed
control. I/O organisation interrupts, DMA, different interface standards. Memory
Subsystem different types.
Expected outcome
Students will be able to:
1. identify the basic structure and functional units of a digital computer.
2. analyze the effect of addressing modes on the execution time of a program.
3. design processing unit using the concepts of ALU and control logic design.
4. identify the pros and cons of different types of control logic design in processors.
5. select appropriate interfacing standards for I/O devices.
6. identify the roles of various functional units of a computer in instruction execution.

Text Books:
1. Hamacher C., Z. Vranesic and S. Zaky, Computer Organization ,5/e, McGraw Hill,
2011.
2. Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013.
References:
1. Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013.
2. Patterson D.A. and J. L. Hennessey, Computer Organization and Design, 5/e, Morgan
Kauffmann Publishers, 2013.
3. William Stallings, Computer Organization and Architecture: Designing for
Performance, Pearson, 9/e, 2013.
4. Chaudhuri P., Computer Organization and Design, 2/e, Prentice Hall, 2008.
5. Rajaraman V. and T. Radhakrishnan, Computer Organization and Architecture,
Prentice Hall, 2011.
6. Messmer H. P., The Indispensable PC Hardware Book, 4/e, Addison-Wesley, 2001
Course Plan
Module Contents Hours Sem.ExamMarks
(51)
I Basic Structure of computersfunctional units 6 15%
basic operational concepts bus structures
software. Memory locations and addresses
memory operations instructions and instruction
sequencing addressing modes ARM Example
(programs not required). Basic I/O operations
stacks subroutine calls.
II Basic processing unit fundamental concepts 10 15%
instruction cycle - execution of a complete
instruction multiple- bus organization
sequencing of control signals.
Arithmetic algorithms: Algorithms for
multiplication and division of binary and BCD
numbers array multiplier Booths
multiplication algorithm restoring and non-
restoring division algorithms for floating point,
multiplication and division.

FIRST INTERNAL EXAMINATION

III I/O organization: accessing of I/O devices 8 15%
interrupts direct memory access buses interface
circuits standard I/O interfaces (PCI, SCSI, USB)

IV Memory system : basic concepts semiconductor 9 15%

RAMs memory system considerations
semiconductor ROMs flash memory cache
memory and mapping functions.

SECOND INTERNAL EXAMINATION

V Processor Logic Design: Register transfer logic 9 20%
inter register transfer arithmetic, logic and shift
micro operations conditional control statements.
Processor organization:design of arithmetic unit,
logic unit, arithmetic logic unit and shifter status
register processor unit design of accumulator.

VI Control Logic Design: Control organization 9 20%

design of hardwired control control of processor
unit PLA control. Micro-programmed control:
Microinstructions horizontal and vertical micro
instructions micro-program sequencer micro
programmed CPU organization.

END SEMESTER EXAM

Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical/design questions..

 Course Course Name L-T-P-Credits Year of Introduction
No.
Switching Theory and Logic Design
CS203 3-1-0-4 2016
Pre-requisite: Nil
Course Objectives
1. To impart an understanding of the basic concepts of Boolean algebra and digital systems.
2. To impart familiarity with the design and implementation of different types of practically used
sequential circuits.
3. To provide an introduction to use Hardware Description Language

Syllabus
Introduction to Number Systems, Boolean Algebra, Canonical Forms, Logic Gates, Digital Circuit
Design, Combination Logic Circuit Design, Sequential Circuit Design, Registers, Counter, Memory
modules, Programmable Logical Arrays, Hardware Description Language for Circuit Design,
Arithmetic algorithms
Expected Outcome:
Students will be able to:-
1. apply the basic concepts of Boolean algebra for the simplification and implementation of logic
functions using suitable gates namely NAND, NOR etc.
2. design simple Combinational Circuits such as Adders, Subtractors, Code Convertors, Decoders,
Multiplexers, Magnitude Comparators etc.
3. design Sequential Circuits such as different types of Counters, Shift Registers, Serial Adders,
Sequence Generators.
4. use Hardware Description Language for describing simple logic circuits.
5. apply algorithms for addition/subtraction operations on Binary, BCD and Floating Point
Numbers.
Text Books:
1. Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013. [Chapters:
1, 2, 3, 4, 5, 6, 7].
2. Floyd T. L., Digital Fundamentals, 10/e, Pearson Education, 2009. [Chapters: 5, 6].
3. M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007. [Chapter
10.1, 10.2, 10.5, 10.6, 10.7].
4. Harris D. M. and, S. L. Harris, Digital Design and Computer Architecture, 2/e, Morgan
Kaufmann Publishers, 2013 [Chapter 4.1, 4.2]
References:

1. Tokheim R. L., Digital Electronics Principles and Applications, 7/e, Tata McGraw Hill,
2007.
2. Mano M. M. and M. D Ciletti, Digital Design, 4/e, Pearson Education, 2008.
3. Rajaraman V. and T. Radhakrishnan, An Introduction to Digital Computer Design, 5/e,
Prentice Hall India Private Limited, 2012.
4. Leach D, Malvino A P, Saha G, Digital Principles and Applications, 8/e, McGraw Hill
Education, 2015.
COURSE PLAN
Contact
Module Contents Sem. Exam
Hours
Marks;%
(52)
 Number systems Decimal, Binary, Octal and
Hexadecimal conversion from one system to another
representation of negative numbers representation of
I BCD numbers character representation character
coding schemes ASCII EBCDIC etc.

Addition, subtraction, multiplication and division of

binary numbers (no algorithms). Addition and subtraction
10 15%
of BCD, Octal and Hexadecimal numbers.

Representation of floating point numbers precision

addition, subtraction, multiplication and division of
floating point numbers

Introduction Postulates of Boolean algebra Canonical

and Standard Forms logic functions and gates

II methods of minimization of logic functions Karnaugh

map method and QuinMcClusky method 09 15%

Product-of-Sums Simplification Dont-Care

Conditions.

Combinational Logic: combinational Circuits and design

Procedure binary adder and subtractor multilevel
NAND and NOR circuits Exclusive-OR and
Equivalence Functions.
III
10 15%
Implementation of combination logic: parallel adder,
carry look ahead adder, BCD adder, code converter,
magnitude comparator, decoder, multiplexer, de-
multiplexer, parity generator.

Sequential logic circuits: latches and flip-flops edge-

triggering and level-triggering RS, JK, D and T flip-
flops race condition master-slave flip-flop.
08 15%
Clocked sequential circuits: state diagram state
IV reduction and assignment design with state equations

Registers: registers with parallel load - shift registers

universal shift registers application: serial adder.

Counters: asynchronous counters binary and BCD

V 08 20%
ripple counters timing sequences synchronous
counters up-down counter, BCD counter, Johnson
counter timing sequences and state diagrams.
 Memory and Programmable Logic: Random-Access
Memory (RAM)Memory DecodingError Detection
and Correction Read only Memory (ROM),
Programmable Logic Array (PLA).
VI
HDL: fundamentals, combinational logic, adder,
08 20%
multiplexer.

Arithmetic algorithms: Algorithms for addition and

subtraction of binary and BCD numbers, algorithms for
floating point addition and subtraction.

Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/design/numerical questions.

 Course Course Name L-T-P -Credits Year of Introduction
code
CS204 Operating Systems 3-1-0-4 2016
Pre-requisite: CS205 Data structures
Course Objectives
1. To impart fundamental understanding of the purpose, structure, functions of operating
system.
2. To impart the key design issues of an operating system

Syllabus

Basic concepts of Operating System, its structure, Process management, inter-process

communication, process synchronization, CPU Scheduling, deadlocks, Memory
Management, swapping, segmentation, paging, Storage Management - disk scheduling,
RAID, File System Interface-implementation. Protection.

Expected outcome
Students will be able to:
1. identify the significance of operating system in computing devices.
2. exemplify the communication between application programs and hardware devices
through system calls.
3. compare and illustrate various process scheduling algorithms.
4. apply appropriate memory and file management schemes.
5. illustrate various disk scheduling algorithms.
6. appreciate the need of access control and protection in an operating system.
Text Book:
1. Abraham Silberschatz, Peter B Galvin, Greg Gagne, Operating System Concepts, 9/e,
Wiley India, 2015.
References:
1. Garry Nutt, Operating Systems: 3/e, Pearson Education, 2004
2. Bhatt P. C. P., An Introduction to Operating Systems: Concepts and Practice, 3/e,
Prentice Hall of India, 2010.
3. William Stallings, Operating Systems: Internals and Design Principles, Pearson,
Global Edition, 2015.
4. Andrew S Tanenbaum, Herbert Bos, Modern Operating Systems, Pearson, 4/e, 2015.
5. Madnick S. and J. Donovan, Operating Systems, McGraw Hill, 2001.
6. Hanson P. B., Operating System Principle, Prentice Hall of India, 2001.
7. Deitel H. M., An Introduction to Operating System Principles, Addison-Wesley,
1990.

Course Plan
Module Contents Hours Sem. Exam marks
(52)
 I Introduction: Functions of an operating system. 15%
Single processor, multiprocessor and clustered
systems overview. Kernel Data Structures
Operating Systems used in different computing
environments.
7
Operating System Interfaces and
implementation - User Interfaces, System Calls
examples. Operating System implementation -
approaches. Operating System Structure
Monolithic, Layered, Micro-kernel, Modular.
System Boot process.
II Process Management: Process Concept 9 15%
Processes-States Process Control Block
Threads. Scheduling Queues Schedulers
Context Switching. Process Creation and
Termination.

Inter Process Communication: Shared Memory,

Message Passing, Pipes.
FIRST INTERNAL EXAMINATION
III Process Synchronization: Critical Section- 15%
Peterson's solution. Synchronization Locks, 9
Semaphores, Monitors, Classical Problems
Producer Consumer, Dining Philosophers and
Readers-Writers Problems
IV CPU Scheduling Scheduling Criteria 8 15%
Scheduling Algorithms.

Deadlocks Conditions, Modeling using graphs.

Handling Prevention Avoidance Detection-
Recovery.
SECOND INTERNAL EXAMINATION
V Memory Management: Main Memory Swapping 20%
Contiguous Memory allocation Segmentation 9
Paging Demand paging
VI Storage Management: Overview of mass storage 10 20%
structure- disks and tapes. Disk structure
accessing disks. Disk scheduling and management.
Swap Space.

File System Interface: File Concepts Attributes

operations types structure access methods.
File system mounting. Protection. File system
implementation. Directory implementation
allocation methods. Free space Management.
Protection Goals, Principles, Domain. Access
Matrix.
END SEMESTER EXAM
Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical/design questions.

 Course code Course Name L-T-P-Credits Year of
Introduction
CS205 Data Structures 3-1-0-4 2016
Pre-requisite: B101-05 Introduction to Computing and Problem Solving
Course Objectives

1. To impart a thorough understanding of linear data structures such as stacks, queues and their
applications.
2. To impart a thorough understanding of non-linear data structures such as trees, graphs and their
applications.
3. To impart familiarity with various sorting, searching and hashing techniques and their
performance comparison.
4. To impart a basic understanding of memory management.

Syllabus
Introduction to various programming methodologies, terminologies and basics of algorithms
analysis, Basic Abstract and Concrete Linear Data Structures, Non-linear Data Structures, Memory
Management, Sorting Algorithms, Searching Algorithms, Hashing.

Expected Outcome:
Students will be able to
1. compare different programming methodologies and define asymptotic notations to analyze
performance of algorithms.
2. use appropriate data structures like arrays, linked list, stacks and queues to solve real world
problems efficiently.
3. represent and manipulate data using nonlinear data structures like trees and graphs to design
algorithms for various applications.
4. illustrate and compare various techniques for searching and sorting.
5. appreciate different memory management techniques and their significance.
6. illustrate various hashing techniques.

Text Books:
1. Samanta D., Classic Data Structures, Prentice Hall India, 2/e, 2009.
2. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures: A Pseudocode Approach with C,
2/e, Cengage Learning, 2005.
References
1. Horwitz E., S. Sahni and S. Anderson, Fundamentals of Data Structures in C, University Press
(India), 2008.
2. Aho A. V., J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson
Publication,1983.
3. Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata
McGraw Hill, 1995.
4. Peter Brass, Advanced Data Structures, Cambridge University Press, 2008
5. Lipschuts S., Theory and Problems of Data Structures, Schaums Series, 1986.
6. Wirth N., Algorithms + Data Structures = Programs, Prentice Hall, 2004.
7. Hugges J. K. and J. I. Michtm, A Structured Approach to Programming, PHI, 1987.
8. Martin Barrett, Clifford Wagner, And Unix: Tools For Software Design, John Wiley, 2008
reprint.
 COURSE PLAN
Sem.
Module Contents Hours
Exam
(56)
Marks
Introduction to programming methodologies structured
approach, stepwise refinement techniques, programming style,
documentation analysis of algorithms: frequency count,
I 9 15%
definition of Big O notation, asymptotic analysis of simple
algorithms. Recursive and iterative algorithms.

Abstract and Concrete Data Structures- Basic data structures

vectors and arrays. Applications, Linked lists:- singly linked
list, doubly linked list, Circular linked list, operations on
II 9 15%
linked list, linked list with header nodes, applications of linked
list: polynomials,.

Applications of linked list (continued): Memory management,

memory allocation and de-allocation. First-fit, best-fit and
worst-fit allocation schemes
III 9 15%
Implementation of Stacks and Queues using arrays and linked
list, DEQUEUE (double ended queue). Multiple Stacks and
Queues, Applications.

String: - representation of strings, concatenation, substring

searching and deletion.

Trees: - m-ary Tree, Binary Trees level and height of the

IV tree, complete-binary tree representation using array, tree 10 15%
traversals (Recursive and non-recursive), applications. Binary
search tree creation, insertion and deletion and search
operations, applications.

Graphs representation of graphs, BFS and DFS (analysis not

required) applications.

Sorting techniques Bubble sort, Selection Sort, Insertion sort,

V 09 20%
Merge sort, Quick sort, Heaps and Heap sort. Searching
algorithms (Performance comparison expected. Detailed
analysis not required)

Linear and Binary search. (Performance comparison expected.

Detailed analysis not required)
Hash Tables Hashing functions Mid square, division,
VI 10 20%
folding, digit analysis, collusion resolution and Overflow
handling techniques.
Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical/design questions.

 Course Course Name L-T-P - Year of
code Credits Introduction
CS206 Object Oriented Design and Programming 2-1-0-3 2016
Pre-requisite: CS205 Data structures
Course Objectives
1. To introduce basic concepts of object oriented design techniques.
2. To give a thorough understanding of Java language.
3. To provide basic exposure to the basics of multithreading, database connectivity etc.
4. To impart the techniques of creating GUI based applications.
Syllabus
Object oriented concepts, Object oriented systems development life cycle, Unified Modeling
Language, Java Overview, Classes and objects, Parameter passing, Overloading, Inheritance,
Overriding, Packages, Exception Handling, Input/Output, Threads and multithreading,
Applets, Event Handling mechanism, Working with frames and graphics, AWT Controls,
Swings, Java database connectivity.
Expected outcome.
Students will be able to:
1. apply object oriented principles in software design process.
2. develop Java programs for real applications using java constructs and libraries.
3. understand and apply various object oriented features like inheritance, data
abstraction, encapsulation and polymorphism to solve various computing problems
using
Java language.
4. implement Exception Handling in java.
5. use graphical user interface and Event Handling in java.
6. develop and deploy Applet in java.
Text Books:
1. Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.
2. Bahrami A., Object Oriented Systems Development using the Unified Modeling
Language, McGraw Hill, 1999.
References:
1. Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013.
2. Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008.
3. Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005.
4. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004.
5. Sierra K., Head First Java, 2/e, O'Reilly, 2005.
6. Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.
7.
Course Plan
Module Contents Hours Sem.
(42) ExamMarks
I Object oriented concepts, Object oriented 08 15%
systems development life cycle. Unified
Modeling Language, UML class diagram, Use-
case diagram.

Java Overview: Java virtual machine, data types,

operators, control statements, Introduction to
Java programming.
 II Classes fundamentals, objects, methods, 07 15%
constructors, parameter passing, overloading,
access control keywords.
FIRST INTERNAL EXAMINATION
III Inheritance basics, method overriding, abstract 06 15%
classes, interface. Defining and importing
packages. Exception handling fundamentals,
multiple catch and nested try statements.
IV Input/Output: files, stream classes, reading 06 15%
console input. Threads: thread model, use of
Thread class and Runnable interface, thread
synchronization, multithreading.
SECOND INTERNAL EXAMINATION
V String class - basics. 07 20%
Applet basics and methods. Event Handling:
delegation event model, event classes, sources,
listeners.
VI Introduction to AWT: working with frames, 08 20%
graphics, color, font. AWT Control
fundamentals. Swing overview. Java database
connectivity: JDBC overview, creating and
executing queries, dynamic queries.
END SEMESTER EXAM

Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/design questions.

 Course code Course Name L-T-P -Credits Year of
Introduction
CS207 ELECTRONIC DEVICES & 3-0-0-3 2016
CIRCUITS
Pre-requisite: BE101-04 Introduction to Electronics Engg.
Course Objectives:
1. To introduce to the students the fundamental concepts of electronic devices and circuits
for engineering applications
2. To develop the skill of analysis and design of various analog circuits using electronic
devices
3. To provide comprehensive idea about working principle, operation and applications of
electronic circuits
4. To equip the students with a sound understanding of fundamental concepts of operational
amplifiers
5. To expose to the diversity of operations that operational amplifiers can perform in a wide
range of applications
6. To expose to a variety of electronic circuits/systems using various analog ICs

Syllabus
RC Circuits, Diode Circuits, Regulated power supplies, Field effect transistor, DC analysis of
BJT, RC Coupled amplifier, MOSFET amplifiers, Feedback amplifiers, Power amplifiers,
Oscillators, Multivibrators, Operational Amplifier and its applications, Timer IC.

Expected Outcome:
Students will be able to
1. explain, illustrate, and design the different electronic circuits using electronic
components
2. design circuits using operational amplifiers for various applications

Text Books:
1. David A Bell, Electronic Devices and Circuits, Oxford University Press, 2008
2. Salivahanan S. and V. S. K. Bhaaskaran, Linear Integrated Circuits, Tata McGraw Hill,
2008
References :
1. Neamen D., Electronic Circuits, Analysis and Design, 3/e, TMH, 2007
2. Robert Boylestad and L Nashelsky, Electronic Devices and Circuit Theory, Pearson.
3. Bogart T. F., Electronic Devices Circuits, 6/e, Pearson, 2012.
4. Maini A. K. and V. Agrawal, Electronic Devices and Circuits, Wiley India, 2011.
5. K.Gopakumar, Design and Analysis of Electronic Circuits, Phasor Books, Kollam, 2013
6. Millman J. and C. Halkias, Integrated Electronics, 2/e, McGraw-Hill, 2010.

Course Plan
Module Contents Hou Sem
rs Exam
(40) Marks
1 Wave shaping circuits: Sinusoidal and non-sinusoidal wave
shapes, Principle and working of RC differentiating and
integrating circuits, Conversion of one non-sinusoidal wave 5 15%
shape into another.
Clipping circuits - Positive, negative and biased clipper.
 Clamping circuits - Positive, negative and biased clamper.
Voltage multipliers- Voltage doubler and tripler.
Simple sweep circuit using transistor as a switch.
2 Regulated power supplies: Review of simple zener voltage
regulator, Shunt and series voltage regulator using transistors,
Current limiting and fold back protection, 3 pin regulators-78XX
and 79XX, IC 723 and its use as low and high voltage regulators, 4
DC to DC conversion, Circuit/block diagram and working of
SMPS. 15 %

Field effect transistors: JFET Structure, principle of

operation and characteristics, Comparison with BJT.
MOSFET- Structure, Enhancement and Depletion types, 3
principle of operation and characteristics.
FIRST INTERNAL EXAM
3 Amplifiers: Introduction to transistor biasing, operating point,
concept of load line, thermal stability, fixed bias, self bias,
voltage divider bias. Classification of amplifiers, RC coupled
amplifier - voltage gain and frequency response. Multistage
amplifiers - effect of cascading on gain and bandwidth.
15 %
7
Feedback in amplifiers - Effect of negative feedback on
amplifiers.

MOSFET Amplifier- Circuit diagram and working of common

source MOSFET amplifier.

4 Oscillators: Classification, criterion for oscillation, analysis of

Wien bridge oscillator, Hartley and Crystal oscillator.

Non-sinusoidal oscillators: Astable, monostable and bi-stable 5 15 %

multivibrators using transistors (Only design equations and
working of circuit are required, Analysis not required).

SECOND INTERNAL EXAM

5 Operational amplifiers: Differential amplifier, characteristics
of op-amps(gain, bandwidth, slew rate, CMRR, offset voltage,
offset current), comparison of ideal and practical op-
amp(IC741), applications of op-amps- scale changer, sign
changer, adder/summing amplifier, subtractor, integrator, 8 20 %
differentiator,

Schmitt trigger, Wien bridge oscillator.

6 Integrated circuits: Active filters Low pass and high pass
(first and second order) active filters using op-amp with gain (No
analysis required).
D/A and A/D convertors important specifications, Sample and
hold circuit.
Binary weighted resistor and R-2R ladder type D/A convertors.
(concepts only). 8 20 %
Flash, dual slope and successive approximation type A/D
convertors.
Circuit diagram and working of Timer IC555, astable and
monostablemultivibrators using 555.

END SEMESTER EXAM

Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical/design questions.

Course code Course Name L-T-P -Credits Year of Introduction
CS208 Principles of Database Design 2-1-0-3 2016
Pre-requisite: CS205 Data structures
Course Objectives
1. To impart the basic understanding of the theory and applications of database management
systems.
2. To give basic level understanding of internals of database systems.
3. To expose to some of the recent trends in databases.

Syllabus:
Types of data, database and DBMS, Languages and users. Software Architecture, E-R and
Extended E-R Modelling, Relational Model concepts and languages, relational algebra and tuple
relational calculus, SQL, views, assertions and triggers, HLL interfaces, relational db design, FDs
and normal forms, Secondary storage organization, indexing and hashing, query optimization,
concurrent transaction processing and recovery principles, recent topics.
Expected outcome.
Students will be able to:
1. define, explain and illustrate the fundamental concepts of databases.
2. construct an Entity-Relationship (E-R) model from specifications and to perform the
transformation of the conceptual model into corresponding logical data structures.
3. model and design a relational database following the design principles.
4. develop queries for relational database in the context of practical applications
5. define, explain and illustrate fundamental principles of data organization, query
optimization and concurrent transaction processing.
6. appreciate the latest trends in databases.

Text Books:
1. Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design
andApplication Programming, Pearson Education, 2013.
2. Sliberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw
Hill, 2011.
References:
1. Powers S., Practical RDF, OReilly Media, 2003.
2. Plunkett T., B. Macdonald, et al., Oracle Big Data Hand Book, Oracle Press, 2013.
Course Plan
Hours
Module Contents Sem.ExamMarks
(42)
Introduction: Data: structured, semi-structured and
unstructured data, Concept & Overview of DBMS, Data
Models, Database Languages, Database Administrator,
Database Users, Three Schema architecture of DBMS. 06 15%
I
Database architectures and classification. (Reading:
ElmasriNavathe, Ch. 1 and 2. Additional Reading:
Silbershatz, Korth, Ch. 1) Entity-Relationship Model:
Basic concepts, Design Issues, Mapping Constraints,
 Keys, Entity-Relationship Diagram, Weak Entity Sets,
Relationships of degree greater than 2 (Reading:
ElmasriNavathe, Ch. 7.1-7.8)
Relational Model: Structure of relational Databases,
Integrity Constraints, synthesizing ER diagram to
relational schema (Reading: ElmasriNavathe, Ch. 3 and
II 8.1, Additional Reading: Silbershatz, Korth, Ch. 2.1- 06 15%
2.4) Database Languages: Concept of DDL and DML
relational algebra (Reading: Silbershatz, Korth, Ch
2.5-2.6 and 6.1-6.2, ElmasriNavathe, Ch. 6.1-6.5)
FIRST INTERNAL EXAM
Structured Query Language (SQL): Basic SQL
Structure, examples, Set operations, Aggregate
Functions, nested sub-queries (Reading:
ElmasriNavathe, Ch. 4 and 5.1) Views, assertions and 07 15%
III
triggers (Reading: ElmasriNavathe, Ch. 5.2-5.3,
Silbershatz, Korth Ch. 5.3). Functions, Procedures
and HLL interfaces (Reading: Silbershatz, Korth Ch.
5.1-5.2).
Relational Database Design: Different anomalies in
designing a database, normalization, functional
dependency (FD), Armstrongs Axioms, closures,
Equivalence of FDs, minimal Cover (proofs not
IV required). Normalization using functional dependencies, 07 15%
INF, 2NF, 3NF and BCNF, lossless and dependency
preserving decompositions (Reading: Elmasri and
Navathe, Ch. 14.1-14.5, 15.1-15.2. Additional Reading:
Silbershatz, Korth Ch. 8.1-8.5)
SECOND INTERNAL EXAM
Physical Data Organization: index structures, primary,
secondary and clustering indices, Single level and
Multi-level indexing, B-Trees and B+-Trees (basic
structure only, algorithms not needed), Indexing on
V multiple keys (Reading Elmasri and Navathe, Ch. 17.1- 08 20%
17.4) Query Optimization: algorithms for relational
algebra operations, heuristics-based query optimization,
Cost-based query optimization (Reading Elmasri and
Navathe, Ch. 18.1-18.3, 18.6-18.8)
Transaction Processing Concepts: overview of
concurrency control and recovery acid properties, serial
VI and concurrent schedules, conflict serializability. Two- 08 20%
phase locking, failure classification, storage structure,
stable storage, log based recovery, deferred database
 modification, check-pointing, (Reading Elmasri and
Navathe, Ch. 20.1-20.5 (except 20.5.4-20.5.5) ,
Silbershatz, Korth Ch. 15.1 (except 15.1.4-15.1.5), Ch.
16.1 16.5) Recent topics (preliminary ideas only):
Semantic Web and RDF(Reading: Powers Ch.1, 2),
GIS, biological databases (Reading: Elmasri and
Navathe Ch. 23.3-23.4) Big Data (Reading: Plunkett
and Macdonald, Ch. 1, 2)
END SEMESTER EXAM

Question Paper Pattern:

1. There will be five parts in the question paper A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering module III and IV;
All four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering module III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts

6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical/design questions.

 Course No. Course Name L-T-P - Credits Year of
Introduction
CS231 DATA STRUCTURES LAB 0-0-3-1 2016
Pre-requisite: CS205 Data structures
Course Objectives
1. To implement basic linear and non-linear data structures and their major operations.
2. To implement applications using these data structures.
3. To implement algorithms for various sorting techniques.

List of Exercises/Experiments : (Minimum 12 are to be done)

1. Implementation of Stack and Multiple stacks using one dimensional array. **

2. Application problems using stacks: Infix to post fix conversion, postfix and pre-fix
evaluation, MAZE problem etc. **

3. Implementation of Queue, DEQUEUE and Circular queue using arrays.

4. Implementation of various linked list operations. **

5. Implementation of stack, queue and their applications using linked list.

6. Implementation of trees using linked list

7. Representation of polynomials using linked list, addition and multiplication of

polynomials. **

8. Implementation of binary trees using linked lists and arrays- creations, insertion, deletion
and traversal. **

9. Implementation of binary search trees creation, insertion, deletion, search

10. Application using trees

11. Implementation of sorting algorithms bubble, insertion, selection, quick (recursive and
non-recursive), merge sort (recursive and non-recursive), and heap sort.**

12. Implementation of searching algorithms linear search, binary search.**

13. Representation of graphs and computing various parameters (in degree, out degree etc.) -
adjacency list, adjacency matrix.

14. Implementation of BFS, DFS for each representation.

15. Implementation of hash table using various mapping functions, various collision and
overflow resolving schemes.**

16. Implementation of various string operations.

 17. Simulation of first-fit, best-fit and worst-fit allocations.

18. Simulation of a basic memory allocator and garbage collector using doubly linked list.

** mandatory.
Expected Outcome:
Students will be able to:
1. appreciate the importance of structure and abstract data type, and their basic usability in
different applications
2. analyze and differentiate different algorithms based on their time complexity.
3. implement linear and non-linear data structures using linked lists.
4. understand and apply various data structure such as stacks, queues, trees, graphs, etc. to
solve various computing problems.
5. implement various kinds of searching and sorting techniques, and decide when to choose
which technique.
6. identify and use a suitable data structure and algorithm to solve a real world problem.
Course code Course Name L-T-P-Credits Year of
Introduction
CS232 Free and Open Source Software Lab 0-0-3-1 2016
Pre-requisite: CS204 Operating systems
Course Objectives: To expose students to FOSS environment and introduce them to use open
source packages in open source platform.
List of Exercises/Experiments: (Minimum 12 exercises/experiments are mandatory)
1. Getting started with Linux basic commands and directory structure, execute file, directory
operations.
2. Linux commands for redirection, pipes, filters, job control, file ownership, file permissions,
links and file system hierarchy.
3. Shell Programming : Write shell script to show various system configuration like
Currently logged user and his logname
Your current shell
Your home directory
Your operating system type
Your current path setting
Your current working directory
Show Currently logged number of users
4. Write shell script to show various system configuration like
About your OS and version, release number, kernel version
Show all available shells
Show mouse settings
Show computer CPU information like processor type, speed etc
Show memory information
Show hard disk information like size of hard-disk, cache memory, model etc
File system (Mounted)
5. Shell script program for scientific calculator.
6. Write a script called addnames that is to be called as follows, where classlist is the name of
the classlist file, and username is a particular student's username.
./addnamesclasslistusername
The script should
check that the correct number of arguments was received and print an usage message if
not,
check whether the classlist file exists and print an error message if not,
check whether the username is already in the file, and then either
print a message stating that the name already existed, or
add the name to the end of the list.
7. Version Control System setup and usage using GIT.
Creating a repository
Checking out a repository
Adding content to the repository
Committing the data to a repository
 Updating the local copy
Comparing different revisions
Revert
Conflicts and Solving a conflict
8. Text processing and regular expression with Perl, Awk: simple programs, connecting with
database e.g., MariaDB
9. Shell script to implement a script which kills every process which uses more than a specified
value of memory or CPU and is run upon system start.
10. GUI programming : Create scientific calculator using Gambas or try using GTK or QT
11. Running PHP : simple applications like login forms after setting up a LAMP stack
12. Advanced linux commands curl, wget, ftp, ssh and grep
13. Application deployment on a cloud-based LAMP stack/server with PHP eg: Openshift,
Linode etc.
14. Kernel configuration, compilation and installation : Download / access the latest kernel
source code from kernel.org, compile the kernel and install it in the local system. Try to
view the source code of the kernel
15. Virtualisation environment (e.g., xen, kqemu, virtualbox or lguest) to test an applications,
new kernels and isolate applications. It could also be used to expose students to other
alternate OSs like *BSD
16. Compiling from source : learn about the various build systems used like the auto* family,
cmake, ant etc. instead of just running the commands. This could involve the full process
like fetching from a cvs and also include autoconf, automake etc.,
17. Introduction to packet management system : Given a set of RPM or DEB, how to build and
maintain, serve packages over http or ftp. and also how do you configure client systems to
access the package repository.
18. Installing various software packages. Either the package is yet to be installed or an older
version is existing. The student can practice installing the latest version. Of course, this
might need Internet access.
Install samba and share files to windows
Install Common Unix Printing System(CUPS)
Expected outcome:
Students will be able to:
1. Identify and apply various Linux commands
2. Develop shell scripts and GUI for specific needs
3. Use tools like GIT, .
4. Perform basic level application deployment, kernel configuration and installation, packet
management and installation etc.
 Course No. Course Name L-T-P - Credits Year of
Introduction
CS233 ELECTRONICS CIRCUITS LAB 0-0-3-1 2016
Pre-requisite: CS207 Electronic devices & circuits
Course Objectives:
1. To introduce the working of analog electronic circuits.
2. To design, implement and demonstrate analog circuits using electronic components.
3. To provide hands-on experience to the students so that they are able to put theoretical
concepts to practice.
4. To use computer simulation tools such as PSPICE, or Multisim to the simulation of
electronic circuits.
5. To create an ability to develop descriptions, explanations, predictions and models using
evidence .
6. To create an ability to communicate effectively the scientific procedures and explanations
about the experiments in oral/report forms.

List of Exercises/Experiments :
(Minimum 13 experiments are to be done in the semester, at least 6 each should be selected from
the first(Exp. 1-10) and second(Exp. 11-20) half. Experiment no. 18 is compulsory).

1. Forward and reverse characteristics of PN diode and Zener diode

2. Input and output characteristics of BJT in CE configuration and evaluation of parameters
3. RC integrating and differentiating circuits-Transient response with different time constant
4. RC low pass and high pass circuits- Frequency response with sinusoidal input
5. Clipping circuits (Positive, negative and biased) - Transient and transfer characteristics
6. Clamping circuits (Positive, negative and biased)- Transient characteristics
7. Bridge Rectifier - with and without filter- ripple factor and regulation
8. Simple Zener regulator- Line and load characteristics
9. RC coupled CE amplifier Mid band gain and frequency response
10. RC phase shift or Wien bridge oscillator using transistor
11. Astable and Monostable multivibrators using transistors
12. Series voltage regulator (Two transistors)- Line and load characteristics
13. Voltage regulator using LM 723)- Line and load characteristics
14. Astable and mono stable multivibrators using 555 Timer
15. Inverting and non-inverting amplifier using op-amp IC741
16. Instrumentation amplifier using op-amp IC741
17. RC phase shift or Wien bridge oscillator using op-amp IC741
18. Simulation of simple circuits (at least 6 from above) using any SPICE software(Transient,
AC and DC analysis)
Expected Outcome:
Students will be able to:
1. identify basic electronic components, design and develop electronic circuits.
2. Design and demonstrate functioning of various discrete analog circuits
3. Be familiar with computer simulation of electronic circuits and how to use it proficiently
for design and development of electronic circuits.
4. Understand the concepts and their applications in engineering.
5. Communicate effectively the scientific procedures and explanations in formal technical
presentations/reports.
Course code Course Name L-T-P - Credits Year of
Introduction
CS234 DIGITAL SYSTEMS LAB 0-0-3-1 2016
Pre-requisite: CS203 Switching theory and logic design
Course Objectives:
1. To familiarize students with digital ICs, the building blocks of digital circuits
2. To provide students the opportunity to set up different types of digital circuits and study
their behaviour
List of Exercises/Experiments : ( minimum 12 exercises/experiments are mandatory)
1. Familiarizations and verification of the truth tables of basic gates and universal gates.
2. Verification of Demorgan's laws for two variables.
3. Implementation of half adder and full adder circuits using logic gates.
4. Implementation of half subtractor and full subtractor circuits using logic gates.
5. Implementation of parallel adder circuit.
6. Realization of 4 bit adder/subtractor and BCD adder circuits using IC 7483.
7. Implementation of a 2 bit magnitude comparator circuit using logic gates.
8. Design and implementation of code convertor circuits
9. a) BCD to excess 3 code b) binary to gray code
10. Implementation of multiplexer and demultiplexer circuits using logic gates. Familiarization
with various multiplexer and demultiplexer ICs.
11. Realization of combinational circuits using multiplexer/demultiplexer ICs.
12. Implementation of SR, D, JK, JK master slave and T flip flops using logic gates.
Familiarization with IC 7474 and IC 7476.
13. Implementation of shift registers using flip flop Integrated Circuits.
14. Implementation of ring counter and Johnson counter using flip flop Integrated Circuits.
15. Realization of asynchronous counters using flip flop ICs.
16. Realization of synchronous counters using flip flop ICs. Familiarization with various
counter Integrated Circuits.
17. Implementation of a BCD to 7 segment decoder and display.
18. Simulation of Half adder, Full adder using VHDL.
(Note: The experiments may be done using hardware components and/or VHDL)
Course outcome:
Students will be able to:
1. identify and explain the digital ICs and their use in implementing digital circuits.
2. design and implement different kinds of digital circuits.