CSE 3rd Sem R2008
CSE 3rd Sem R2008
com
AFFILIATED INSTITUTIONS
ANNA UNIVERSITY CHENNAI :: CHENNAI 600 113
CURRICULUM 2008
B.E. COMPUTER SCIENCE AND ENGINEERING
CURRICULA AND SYLLABI FOR III SEMESTER
SEMESTER III
(Applicable to the students admitted from the Academic year 2008–2009 onwards)
Code No. Course Title L T P C
THEORY
MA 2211 Transforms and Partial Differential Equations 3 1 0 4
CS 2201 Data Structures 3 0 0 3
CS 2202 Digital Principles and Systems Design 3 1 0 4
CS 2203 Object Oriented Programming 3 0 0 3
CS 2204 Analog and Digital Communication 3 1 0 4
GE 2021 Environmental Science and Engineering 3 0 0 3
PRACTICAL
CS 2207 Digital Lab 0 0 3 2
CS 2208 Data Structures Lab 0 0 3 2
CS 2209 Object Oriented Programming Lab 0 0 3 2
www.Vidyarthiplus.com Page 1
www.Vidyarthiplus.com
OBJECTIVES
The course objective is to develop the skills of the students in the areas of Transforms
and Partial Differtial Equations. This will be necessary for their effective studies in a
large number of engineering subjects like heat conduction, communication systems,
electro-optics and electromagnetic theory. The course will also serve as a prerequisite
for post graduate and specialized studies and research.
TEXT BOOKS
1. Grewal, B.S, ‘Higher Engineering Mathematics’ 40th Edition, Khanna publishers,
Delhi, (2007)
www.Vidyarthiplus.com Page 2
www.Vidyarthiplus.com
REFERENCES
1. Bali.N.P and Manish Goyal ‘A Textbook of Engineering Mathematics’, Seventh
Edition, Laxmi Publications(P) Ltd. (2007)
2. Ramana.B.V. ‘Higher Engineering Mathematics’ Tata Mc-GrawHill Publishing
Company limited, New Delhi (2007).
3. Glyn James, ‘Advanced Modern Engineering Mathematics’, Third edition-Pearson
Education (2007).
4. Erwin Kreyszig ’Advanced Engineering Mathematics’, Eighth edition-Wiley India
(2007).
www.Vidyarthiplus.com Page 3
www.Vidyarthiplus.com
Aim: To master the design and applications of linear, tree, balanced tree, hashing, set,
and graph structures.
Abstract Data Types (ADT) – List ADT – array-based implementation – linked list
implementation – cursor-based linked lists – doubly-linked lists – applications of lists –
Stack ADT – Queue ADT – circular queue implementation – Applications of stacks and
queues
Tree ADT – tree traversals – left child right sibling data structures for general trees –
Binary Tree ADT – expression trees – applications of trees – binary search tree ADT –
Threaded Binary Trees.
Unit V Graphs 9
Definitions – Topological sort – breadth-first traversal - shortest-path algorithms –
minimum spanning tree – Prim's and Kruskal's algorithms – Depth-first traversal –
biconnectivity – Euler circuits – applications of graphs
Total: 45
TEXT BOOK
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition , Pearson
Education, 2005.
REFERENCES
www.Vidyarthiplus.com Page 4
www.Vidyarthiplus.com
AIM
To provide an in-depth knowledge of the design of digital circuits and the use of
Hardware Description Language in digital system design.
OBJECTIVES
• To understand different methods used for the simplification of Boolean functions
• To design and implement combinational circuits
• To design and implement synchronous sequential circuits
• To design and implement asynchronous sequential circuits
• To study the fundamentals of VHDL / Verilog HDL
TUTORIAL = 15 TOTAL : 60
TEXT BOOKS
1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2007.
REFERENCES
1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing
House, Cengage Earning, 5th ed, 2005.
2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2007.
www.Vidyarthiplus.com Page 5
www.Vidyarthiplus.com
UNIT I 9
Object oriented programming concepts – objects – classes – methods and messages –
abstraction and encapsulation – inheritance – abstract classes – polymorphism.
Introduction to C++ – classes – access specifiers – function and data members – default
arguments – function overloading – friend functions – const and volatile functions - static
members – Objects – pointers and objects – constant objects – nested classes – local
classes
UNIT II 9
Constructors – default constructor – Parameterized constructors – Constructor with
dynamic allocation – copy constructor – destructors – operator overloading –
overloading through friend functions – overloading the assignment operator – type
conversion – explicit constructor
UNIT III 9
Function and class templates - Exception handling – try-catch-throw paradigm –
exception specification – terminate and Unexpected functions – Uncaught exception.
UNIT IV 9
Inheritance – public, private, and protected derivations – multiple inheritance - virtual
base class – abstract class – composite objects Runtime polymorphism – virtual
functions – pure virtual functions – RTTI – typeid – dynamic casting – RTTI and
templates – cross casting – down casting .
UNIT V 9
Streams and formatted I/O – I/O manipulators - file handling – random access – object
serialization – namespaces - std namespace – ANSI String Objects – standard template
library.
Total: 45
TEXT BOOKS:
REFERENCES:
1. Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second
Edition Reprint 2004..
2. S. B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Primer”, Fourth Edition,
Pearson Education, 2005.
3. B. Stroustrup, “The C++ Programming language”, Third edition, Pearson
Education, 2004.
www.Vidyarthiplus.com Page 6
www.Vidyarthiplus.com
TEXT BOOKS:
REFERENCES:
www.Vidyarthiplus.com Page 7
www.Vidyarthiplus.com
www.Vidyarthiplus.com Page 8
www.Vidyarthiplus.com
AIM
The aim of this course is to create awareness in every engineering graduate about the
importance of environment, the effect of technology on the environment and ecological
balance and make them sensitive to the environment problems in every professional
endeavour that they participates.
OBJECTIVE
At the end of this course the student is expected to understand what constitutes the
environment, what are precious resources in the environment, how to conserve these
resources, what is the role of a human being in maintaining a clean environment and
useful environment for the future generations and how to maintain ecological balance
and preserve bio-diversity. The role of government and non-government organization in
environment managements.
www.Vidyarthiplus.com Page 9
www.Vidyarthiplus.com
Field study of local area to document environmental assets – river / forest / grassland /
hill / mountain.
Total = 45
TEXT BOOKS
1. Gilbert M.Masters, ‘Introduction to Environmental Engineering and
Science’, 2nd edition, Pearson Education (2004).
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New
Delhi, (2006).
REFERENCE BOOKS
1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances
and Standards’, Vol. I and II, Enviro Media.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico
Publ., House, Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT LTD, New
Delhi, 2007.
www.Vidyarthiplus.com Page 10
www.Vidyarthiplus.com
LIST OF EXPERIMENTS
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic gates for
arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using basic
gates and MSI devices
4. Design and implementation of parity generator / checker using basic
gates and MSI devices
5. Design and implementation of magnitude comparator
6. Design and implementation of application using multiplexers/
Demultiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous counters
9. Simulation of combinational circuits using Hardware Description
Language (VHDL/ Verilog HDL software required)
10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software
required)
www.Vidyarthiplus.com Page 11
www.Vidyarthiplus.com
16 IC7445 40
17 IC7476 40
18 IC7491 40
19 IC555 40
20 IC7494 40
21 IC7447 40
22 IC74180 40
23 IC7485 40
24 IC7473 40
25 IC74138 40
26 IC7411 40
27 IC7474 40
www.Vidyarthiplus.com Page 12
www.Vidyarthiplus.com
To develop programming skills in design and implementation of data structures and their
applications.
Total: 45
www.Vidyarthiplus.com Page 13
www.Vidyarthiplus.com
1. Design C++ classes with static members, methods with default arguments, friend
functions. (For example, design matrix and vector classes with static allocation,
and a friend function to do matrix-vector multiplication)
2. Implement complex number class with necessary operator overloadings and type
conversions such as integer to complex, double to complex, complex to double
etc.
3. Implement Matrix class with dynamic memory allocation and necessary methods.
Give proper constructor, destructor, copy constructor, and overloading of
assignment operator.
4. Overload the new and delete operators to provide custom dynamic allocation of
memory.
5. Develop a template of linked-list class and its methods.
6. Develop templates of standard sorting algorithms such as bubble sort, insertion
sort, merge sort, and quick sort.
7. Design stack and queue classes with necessary exception handling.
8. Define Point class and an Arc class. Define a Graph class which represents
graph as a collection of Point objects and Arc objects. Write a method to find a
minimum cost spanning tree in a graph.
9. Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square,
Circle, Ellipse, Triangle, Polygon, etc. Design a simple test application to
demonstrate dynamic polymorphism and RTTI.
10. Write a C++ program that randomly generates complex numbers (use previously
designed Complex class) and writes them two per line in a file along with an
operator (+, -, *, or /). The numbers are written to file in the format (a + ib). Write
another program to read one line at a time from this file, perform the
corresponding operation on the two complex numbers read, and write the result
to another file (one per line).
1. PC – 30 nos.
• Processor – 2.0 GHz or higher
• RAM – 256 MB or higher
• Hard disk – 20 GB or higher
• OS- Windows 2000/ Windows XP/ NT
www.Vidyarthiplus.com Page 14
www.Vidyarthiplus.com
www.Vidyarthiplus.com Page 15