Department of Computer Science and Engineering

DETAILED SYLLABUS CS2001 LOGIC DESIGN
Pre-requisite: Nil |L |T |P |C |
|3 |0 |2 |4 |
Total Hours: 70 Hrs
Module 1 (10 (T) + 7(P) Hours) Number systems and codes, Boolean algebra: postulates and theorems,
constants, variables and functions, switching algebra, Boolean functions
and logical operations, Karnaugh map: prime cubes, minimum sum of products
and product of sums
Module 2 (10 (T) + 7(P) Hours)
Quine-McClusky algorithm, prime implicant chart, cyclic prime implicant
chart, Petrick's method, Combinational Logic: introduction, analysis and
design of combinational logic circuits, parallel adders and look-ahead
adders, comparators, decoders and encoders, code conversion,
multiplexers and demultiplexers, parity generators and checkers
Module 3 (10 (T) + 7(P) Hours)
Programmable Logic Devices, ROMs, PALs, PLAs, PLA folding, design for
testability. Introduction to sequential circuits, memory elements, latches
Module 4 (12 (T) + 7(P) Hours)
Flip-flops, analysis of sequential circuits, state tables, state diagrams,
design of sequential circuits, excitation tables, Mealy and Moore models,
registers, shift registers, counters References:
1. T. L. Floyd, R. P. Jain, Digital Fundamentals, 8/e, Pearson Education,
2006
2. C. H. Roth, Jr., L. L. Kinney, Fundamentals of Logic Design, 6/e,
Cengage Learning, 2009
3. M M Mano, M D Ciletti, Digital Design, 4/e, Pearson Education, 2008
4. N. N. Biswas, Logic Design Theory, Prentice Hall of India, New Delhi,
1993
CS2301 INTRODUCTION TO PROGRAMMING Pre-requisite: Nil |L |T |P |C |
|4 |0 |0 |4 |
Total Hours: 56 Hrs Module I: (14 Hours)
Data types, operators and expressions: Identifiers and keywords, data
types, literals, variables, constants, operators- arithmetic, assignment,
comparison, logical, bit-wise. Special operators
Input output streams- I/O streams, keyboard and screen I/O, manipulators,
I/O stream flags.
Control statements: conditional expressions, loop statements, nested
control structures, breaking control statements.
Module 2: (14 Hours)
Functions and program structures: Defining functions, return statement,
function prototype, user defined functions, actual and formal arguments,,
local Vs global variables, default arguments, order of function
declaration, mutually invocated functions, nested functions, scope rules,
side effects, storage class specifiers, recursive functions, preprocessors,
header files, standard functions.
Arrays: Array notation, declaration, initialization, processing with
arrays, arrays and functions, multidimensional arrays, and character
arrays.
Pointers and strings: Pointer arithmetic, pointers and functions, pointers
to functions, passing a function to another function, pointers and arrays,
arrays of pointers, pointers and strings, pointers to pointers.
Structures, union and bit fields: declaration of structure, processing with
structure, initialisation, function and structure, arrays of structures,
nested structures, pointers and structures, Union, bit fields, typedef,
enumeration.
Module III (14 Hours):
Classes and objects: Structures and classes, declaration, member function,
defining the objects of a class, accessing members, arrays of classes,
union and classes, nested classes.
Special member functions: Constructors, destructors, inline functions,
static class members, friend functions, dynamic memory allocation, this
pointer, mutable.
Single and multiple inheritance: Single inheritance, types of base classes,
types of derivation, multiple inheritance, container classes, member access
control.
Overloading functions and operators: Functions overloading, operator
overloading, Binary and unary operators overloading.
Module IV (14 Hours):
Polymorphism and virtual functions: Polymorphism, early binding,
polymorphism with pointers, virtual functions, late binding, pure virtual
functions, abstract classes, constructors and destructors under
inheritance, virtual destructors, virtual bases classes.
Templates, namespaces and exception handling: function template, class
template, overloading function templates, exception handling, namespaces.
Data file operations: Opening and closing files, stream state member
functions, reading/ writing character files, binary file operations;
classes, structures, arrays and nested classes and file operations. Random
access file operations.
Introduction of standard template library (STL): Vector classes, double
ended queues, list classes, stack classes, queue classes, etc. References:
1. D Ravichandran, Programming with C++, 3/e, Tata McGraw Hill Education
Private Ltd, 2001. 2. Eric Nagler, Learning C++ - A hands-on approach, 3/e, Cengage Laerning
India, 2004.
MA6010 DISCRETE MATHEMATICS
Pre-requisite: Nil
|L |T |P |C |
|3 |0 |0 |3 |
Total Hours: 42 Hrs Module 1 ( 12 Hours)

Propositional Calculus: Propositions, Truth tables , tautologies and
contradictions, logical equivalence, logical arguments, normal forms,
consistency completeness and independence, formal proofs , natural
deduction. Predicate Calculus: predicates, quantifiers, arguments, theory
of inference, resolution algorithm. Module 2 ( 10 Hours) Relations and functions, pigeon hole principle, cardinals, countable and
uncountable sets, diagonalization, equivalence relations and partitions,
partial order, lattices, Boolean Algebra. Module 3 ( 10 Hours) Semi groups, monoids, groups and subgroups, homomorphism, cosets, normal
sub groups, products and quotients, Lagrange's theorem, permutation
groups, Cayley's theorem. Module 4( 10 Hours)
Rings, Integral domains, fields, ideals and quotient rings, Euclidian
domain, polynomial rings, division algorithm, field factorization, unique
factorization, field extensions. References
1. P. Grimaldi, Discrete and Combinatorial Mathematics, Addisson Wesley,
1994. 2. J.P Trembley, R. Manohar, Discrete Mathematical Structures with
applications to Computer Science, Tata Mc Graw Hill, New Delhi, 2003. 3. B.Kolman, R C Busby, Discrete Mathematical Structures for Computer
Science, PHI, 1994. 4. C.L Liu, Elements of Discrete Mathematics, 2/e, Mc Graw Hill, 1985. 5. J.L. Mott, A.Kandel, T.P Baker, Discrete Mathematics for Computer
Scientists and Mathematicians, 2/e, PHI, 1986. 6. J.K Truss, Discrete Mathematics for Computer Scientists, Addison
Wesley, 1999. 7. I.N Hernstein, Topics in Algebra, Wiley Eastern, 1975.
MS1001 PROFESSIONAL COMMUNICATION Pre-requisite: Nil |L |T |P |C |
|3 |0 |0 |3 |
Total Hours : 42 Hours Module 1 (11 Hours) Verbal Communication: Received pronunciation; how to activate passive
vocabulary; technical/non-technical and business presentations; questioning
and answer skills; soft skills for professionals; role of body postures,
movements, gestures, facial expressions, dress in effective communication;
information/Desk/Office/Telephone conversation; how to face an
interview/press conference; Group discussions, debates, elocution. Module 2 (9 Hours) Reading Comprehension: skimming and scanning; factual and inferential
comprehension; prediction; guessing meaning of words from context; word
reference; use and interpretation of visuals and graphics in technical
writing. Module 3 (11 Hours) Written Communication; note making and note taking; summarizing;
invitation; advertisement, agenda, notice and memos; job application;
resume and curriculum vitae; utility, technical, project and enquiry
reports; paragraph writing: General-specific, Problem-solution, Process-
Description, Data-Comment. Module 4 (11 Hours) Short essays: description and argument; comparison and contrast;
illustration; using graphics in writing; tables and charts, diagrams and
flow charts, maps and plans, graphs; how to write research paper; skills of
editing and revising; skills of referencing; what is a bibliography and how
to prepare it. References 1. Adrian Doff and Christopher Jones, Language in USE-Upper intermediate,
self-study workbook and classroom book, Cambridge University Press, 2000. 2. Sarah Freeman, Written Communication, Orient Longman, 1978. 3. Mark Ibbotson, Cambridge English for Engineering, Cambridge University
Press, November 2008. 4. T Balasubramanian, English Phonetics for Indian Students: A Workbook,
Mac Millan Publishers, India, 2000. 5. Chris Mounsey, Essays and Dissertation, Oxford University Press,
February 2005. 6. Sidney Greenbaum, The Oxford English Grammar, Oxford University Press,
March 2005 7. Krishna Mohan and Meera Banerjee, Developing Communication Skills, Mac
Millan India Ltd., 2000 8. Krishna Mohan and Meenakshi Raman, Effective English Communication, Tata
Mc-Graw Hill, 2000.
CS2391 INTRODUCTORY PROGRAMMING LABORATORY Pre-requisite: Nil |L |T |P |C |
|1 |0 |3 |3 |
Total Hours: 56 Hrs
Theory (14 Hours) Programming environment - scripting and shell programming, debugging tools.
Scheme programming language, Interpreter specification. Practical (42 Hours) Programming Assignments 1. Programming exercises, Searching, sorting with iterative
constructs. 2. Functions and parameter passing, recursion. 3. Pointers and linked list implementation 4. Program to illustrate the use of structures, and union, 5. Program to write classes and creation of objects illustrating the
pur