Download With effect from SCHEME OF INSTRUCTION & EXAMINATION B.E.II YEAR (CSE) (Autonomous)

With effect from Academic Year 2012-13
SCHEME OF INSTRUCTION & EXAMINATION
B.E.II YEAR (CSE) (Autonomous)
COMPUTER SCIENCE & ENGINEERING
Semester-I
S.No.
Syllabus
Ref-No.
SUBJECT
Scheme of
Scheme of Examination
Instruction
Periods per Duration Maximum Credits
Week
in Hours
Marks
----------------------------L/T
D/P
Univ- SessExam ionals
THEORY
1 CS 201 UE Data Structures
4
-
3
75
25
4
2 CS 202 UE Discrete Mathematics
4
-
3
75
25
4
3 CS 203 UE Logic & Switching Theory
4
-
3
75
25
4
4 CS 204 UE Computer Organization
4
-
3
75
25
4
5 MT 201 UE Mathematics-III
4
-
3
75
25
4
PRACTICALS
1 CS 231 UE Data Structures Lab
-
3
3
50
25
2
2 EC 241 UE Basic Electronics Lab
-
3
3
50
25
2
3 EE 241 UE Electrical Engineering Lab
-
3
3
50
25
2
20
9
-
525
200
26
TOTAL
1
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I-Semester
CS 201 UE
DATA STRUCTURES
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
4 Periods per week
3 Hours
75 Marks
25 Marks
4
UNIT -I
Performance and complexity analysis: Space complexity, time complexity,
asymptotic notation (big oh), complexity analysis examples.
Linear list-array representation: vector representation, multiple lists single array.
Linear list-linked representation: singly linked lists, circular lists, doubly linked
lists, Applications (polynomial arithmetic).
Arrays and matrices: row and column major representations, special matrices,
sparse matrices.
UNIT -II
Stacks: Array representation, linked representation, applications (recursive calls,
infix to postfix, postfix evaluation).
Queues: Array representation, linked representation.
Skip lists and hashing: skip lists representation, hash table representation,
application- text compression.
UNIT- III
Trees: Definitions and properties, representation of binary trees, operations, binary
tree traversal. Binary search trees: Definitions, operations on binary search trees.
Balanced search trees: AVL trees, B-trees.
UNIT -IV
Graphs: Definitions and properties, representation, graph search methods (DFS
and BFS)
Application of graphs: shortest path algorithm (Dijkstra), minimum spanning
tree(Prim’s and Kruskal's algorithms).
2
UNIT -V
Sorting and complexity analysis: Selection sort, Insertion sort, Quick sort, Merge
sort, Closest pair of points, Heap sort.
Suggested Reading :
1. Sartaj Sahni “Data Structures--Algorithms and Applications in C++”
(Second Edition) Universities Press (India) Pvt. Ltd., 2005.
2. Mark Allen Weiss "Data Structures and Problem Solving using C++"
(Second Edition) Addison-Wesley, 2000.
3. Michael T. Goodrich, Roberto Tamassia, David Mount “Data Structures
and Algorithms in C++", Wiley India Pvt. Ltd., 2004.
3
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
CS 202 UE
DISCRETE MATHEMATICS
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
4 Periods per week
3 Hours
75 Marks
25 Marks
4
UNIT- I
Mathematical Logic: Statements and Notation, Connectives, Normal Forms,
Theory of Inference, Predicate Calculus.
UNIT -II
Combinatorics:Basics of Counting, Permutation and Combinations-with
repetitions, Constrained repetitions, Binomial and Multinomial theorems, Principle
of Inclusion-Exclusion.
UNIT -III
Recurrence relations – generating functions of sequences, coefficients of generating
functions, Solution of Recurrence relations – substitution, generating functions,
characteristic roots, Non-homogeneous recurrence relations.
UNIT - IV
Algebraic Structures: Algebraic system-general properties, semi groups, monoids,
homomorphism, groups, residue arithmetic, group codes and their applications.
UNIT -V
Graphs: Concepts, Isomorphism, Trees, Spanning trees, Directed trees, Binary
trees, Planar graphs, Euler & Hamiltonian graphs, Chromatic number.
4
Suggested Reading:
1. Tremblay JP, Manohar R “Discrete Mathematical Structures with
Applications to Computer Science”, McGraw Hill, 1987.
2. Shanker Rao G “Mathematical Foundations of Computer Science”,
I K International Publishing House Pvt. Ltd., 2006.
3. Mott Joe L, Abraham Kandel, Baker TP “Discrete Mathematics for
Computer Scientists & Mathematicians”, Prentice Hall NJ, 2 nd Edition,
1986.
5
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
CS 203 UE
LOGIC & SWITCHING THEORY
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
4 Periods per week
3 Hours
75 Marks
25 Marks
4
UNIT -I
Binary Systems: Introduction to Number Systems, Binary Logic.
Boolean Algebra: Axiomatic definition of Boolean algebra operators, Postulates
and theorems, Boolean functions, Canonical forms and Standard forms,
Simplification of Boolean functions using theorems.
UNIT- II
Minimization of switching functions: Karnaugh map method, Quine-McCluskey
tabular method, Determination of Prime implicants and Essential prime implicants.
UNIT -III
Combinational Logic Design: Single output and multiple output combinational
circuit design, AND-OR, OR-AND and NAND/NOR realizations, Exclusive-OR
and Equivalence functions, Binary adders, Subtractors, Code conversion, Decoders,
Multiplexers, Encoders.
UNIT -IV
Introduction to Relay Networks, Analysis and Synthesis of Contact Networks.
Symmetric Networks: Properties of Symmetric functions, Synthesis of Symmetric
networks, Identification of Symmetric functions.
UNIT -V
Introduction to Sequential Logic Design: Latch, Various types of flip-flops and
their excitation tables, Classification of Sequential circuits, The Sequential Circuit
Model, Design of simple Synchronous sequential circuits such as counters,
Introduction to Asynchronous machines.
6
Suggested Reading:
1. M. Mano “Digital Design”, Prentice Hall of India, 2nd Edition, 1994.
2. Zvi Kohavi “Switching and Finite Automata Theory”, Tata McGraw Hill,
2nd Edition, 1978.
7
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
CS 204 UE
COMPUTER ORGANIZATION
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
4 Periods per week
3 Hours
75 Marks
25 Marks
4
UNIT -I
Data Representation: Data types, Complements, Fixed and Floating Point
representations, other Binary codes.
Overview of Computer function and Interconnection: Computer components,
Interconnection structures, Bus interconnection, Bus structure, Data transfer.
UNIT-II
Register Transfer Microoperations: Register Transfer Language, Register
Transfer, Bus and Memory Transfers, Arithmetic, Logic and Shift microperations,
Arithmetic Logic Shift Unit.
Basic Computer Organization and Design: Instruction Codes, Computer
Registers, Computer Instructions, Timing and Control, Instruction Cycle, Memory
reference instruction, Input-Output and Interrupt.
UNIT-III
Microprogrammed Control : Control memory, Address Sequencing,
Microprogram example, Design of Control Unit.
Central Processing Unit: General Register Organization, Stack Organization,
Instruction formats, Addressing modes, Data Transfer and Manipulation, Program
control, RISC.
Computer Arithmetic: Addition and Subtraction, Multiplication, Division,
Floating Point Arithmetic Operations, Decimal Arithmetic Unit.
Parallel Processing, Pipelining: Arithmetic, Instruction and RISC Pipelines.
UNIT -IV
Input-Output Organization: Peripheral Devices, Input-Output Interface,
Asynchronous data transfer, Modes of Transfer, Priority Interrupt, Direct Memory
Access(DMA), I/O Processor, Serial Communication.
8
UNIT -V
Memory Organization: Memory hierarchy, Main Memory, RAM and ROM,
Auxiliary memory, Associative memory, Cache memory, Virtual memory,
Memory Management hardware.
Assessing and Understanding Performance: CPU performance and its factors,
Evaluating performance.
Suggested Reading:
1. Morris Mano M “Computer System Architecture”, 3rd Edition, PHI, 1993.
2. William Stallings “Computer Organization and Architecture”, PHI, 6th
Edition, 2003.
3. David A Patterson, John L Hennessy “Computer Organization and Design”,
Morgan Kaufmann, 2005.
9
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
MT 201 UE
MATHEMATICS-III
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
4 Periods per week
3 Hours
75 Marks
25 Marks
4
Objectives:
 To introduce Laplace transforms, Functions of Complex Variables, the
power series expansions, bilinear transformation and conformal mapping.
 To introduce and discuss various numerical methods like solving
Algebraic and
Transcendental equations, interpolation, numerical
differentiation and solutions of ordinary differential equations.
 To introduce Normal and  2 distributions, and the tests of significance, i.e.
t-test, F- test and  2 test.
UNIT- I
Laplace transformation: Introduction of Laplace transforms, sufficient condition
for existence of Laplace transform, Laplace transform of derivatives, Laplace
transform of integrals, Translation theorems (I&II shifting theorems),
Differentiation of Laplace transform(Multiplication by t), Integration of Laplace
transform( Division by t ), Convolution theorem, Solving initial value problems
using Laplace transform.
UNIT-II
Functions of
Complex Variables: Limits and continuity of function,
differentiability and analyticity, necessary & sufficient conditions for a function to
be analytic, Cauchy- Reimann equations in polar form, harmonic functions,
complex integration, Cauchy’s integral theorem, extension of Cauchy’s integral
theorem for multiple connected regions, Cauchy’s integral formula, Cauchy’s
formula for derivatives and their applications.
10
UNIT-III
Power series, Taylor’s series, Laurent’s series, zeros and singularities, residues,
residue theorem, evaluation of real integrals using residue theorem, bilinear
transformation, conformal mapping.
UNIT-IV
Numerical methods: Solution of Algebraic and Transcendental equationsBisection method, Regula falsi method, Newton-Raphson method, Solution of
linear system of equations, Gauss elimination method, Gauss- Seidel iteration
method, Interpolation-Lagrange’s interpolation, Newton’s divided difference
interpolation, Newton’s Forward and Backward difference interpolations,
Numerical differentiation, Interpolation approach, Numerical solutions of ordinary
differential equations , Taylor’s series method, Euler method, Runge-Kutta
method of 4th order.
UNIT-V
Probability and Statistics: Introduction to distributions, Normal and
 2 distributions, Tests of significance: t-test, F- test,  2 - test.
Suggested Reading:
1. R.K. Jain & S.R.K. Iyengar “Advanced Engineering Mathematics”, Third
Edition, Narosa Publications, 2007.
2. H.K. Dass, Er.Rajnish Verma “Higher Engineering Mathematics”,
S.Chand & Company Ltd., 2011.
Reference Books:
1.
2.
3.
4.
5.
6.
Kreyszig E “Advanced Engineering Mathematics”, 8th Edition,
John Wiley & Sons Ltd.,2006.
R.V. Churchill “Complex Variables & its Applications”, McGraw-Hill
Book Company, INC.
Dr.B.S Grewal “Higher Engineering Mathematics”, 40th Edition, Khanna
Publishers.
N.P.Bali & Manish Goyal “A text book of Engineering Mathematics”,
Laxmi Publication.
Dr.M. Venkata Krishna “Probability and Statistics”.
Dr.P.P Gupta and Dr.G.S. Malik “Calculus of Finite Differences and
Numerical Analysis”, Krishna Prakasham Media.
11
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
CS 231 UE
DATA STRUCTURES LAB
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
3 Periods per week
3 Hours
50 Marks
25 Marks
2
Programming exercise using C++ for the following:
1. Implementation of Singly Linked List, Doubly Linked List and Circular List.
2. Implementation of Stacks, Queues (using both arrays and linked lists).
3. Infix to Postfix conversion, evaluation of postfix expression.
4. Polynomial arithmetic using linked list.
5. Implementation of Binary Search and Hashing.
6. Implementation of recursive and iterative traversals on binary tree.
7. Implementation of Binary Search Tree.
8. Implementation of operations on binary tree (delete entire tree, copy entire tree,
mirror image, level order, search for a node etc.)
9. Implementation of Selection, Shell, Merge and Quick sorts.
10. Implementation of Heap Sort.
11. Implementation of operations on AVL Trees.
12. Implementation of traversal on Graphs.
13. Implementation of B-Trees.
Note : To debug these programs it is recommended to use a debugging tool.
12
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
EC 241 UE
BASIC ELECTRONICS LAB
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
3 Periods per week
3 Hours
50 Marks
25 Marks
2
Experiments to be done
1.
Characteristics of Semi-conductor diodes ( Ge, Si, Ze ).
2.
Static Characteristics of BJT (CE).
3.
Static Characteristics of FET.
4.
Full wave Rectifier with and without filters.
5.
Transistor as an amplifier.
6.
CRO Applications.
7.
Current series Feedback amplifier.
8.
Voltage series FB amplifier.
9.
RC phase shift oscillator, Hartley oscillator.
10.
Operational amplifier applications.
11.
RC coupled amplifier frequency response.
12.
Emitter follower and Source Follower.
13.
Frequency response of FET Amplifier.
Suggested Reading:
1.
2.
David A Bell “Laboratory Manual for Electronic Devices and Circuits”,
PHI, 2007.
RL Borlestand and L Nashelsky “Electronic Devices and Circuit Theory”,
PHI , New Delhi, 2006.
13
With effect from Academic Year 2012-13
B.E. II Year (Computer Science & Engineering) I - Semester
EE 241 UE
ELECTRICAL ENGINEERING LAB
Instruction
Duration of University Examination
University Examination
Sessionals
Credits
3 Periods per week
3 Hours
50 Marks
25 Marks
2
Experiments to be done
1. Verification of Kirchoff’s Laws
2. Verification of Thevinin’s & Norton’s Theorems
3. Study of Three-Phase Balanced Circuits
4. Measurement of Power by Two – Wattmeter Method
5. Study of Single – Phase RLC Series Circuits
6. Magnetization Curve of a Separately Excited DC Generator
7. Load Characteristics of Shunt Generator
8. Performance Characteristics of Shunt Motor
9. Speed Control of DC Shunt Motor
10. O.C. and S.C. Tests on Single – Phase Transformer
11. Load Test on Single – Phase Transformer
12. Load Test on Three – Phase Induction Motor
Note: At least TEN experiments should be conducted in the Semester.
14