141303 OBJECT-ORIENTED PROGRAMMING

UNIT I

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

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

Function and class templates - Exception handling – try-catch-throw paradigm –

exception specification – terminate and Unexpected functions – Uncaught exception.

UNIT IV

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

Streams and formatted I/O – I/O manipulators - file handling – random access – object serialization – namespaces - std namespace – ANSI String Objects – standard template library.

TEXT BOOKS:

1. B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2007.

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.

VISIT http://www.rejinpaul.com/2010/09/cs2203-object-oriented-programming_7692.html

### 141303 OBJECT-ORIENTED PROGRAMMING QUESTION PAPER QUESTION BANK MODEL QUESTION PAPERFOR UNIT1,UNIT2,UNIT3.UNIT4,UNIT5 IMPORTANT TWO MARKS AND 16 MARKS QUESTIONS ANNA UNIVERSITY OF TECHNOLOGY

### 141302 DIGITAL PRINCIPLES AND SYSTEM DESIGN QUESTION PAPER QUESTION BANK MODEL QUESTION PAPERFOR UNIT1,UNIT2,UNIT3.UNIT4,UNIT5 IMPORTANT TWO MARKS AND 16 MARKS QUESTIONS ANNA UNIVERSITY OF

141302 DIGITAL PRINCIPLES AND SYSTEM DESIGN

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES

Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra

and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh

map and tabulation methods – Implementation of Boolean functions using logic gates.

UNIT II COMBINATIONAL LOGIC

Combinational circuits – Analysis and design procedures - Circuits for arithmetic

operations - Code conversion – Introduction to Hardware Description Language (HDL)

UNIT III DESIGN WITH MSI DEVICES

Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable

logic - HDL for combinational circuits

UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC

Sequential circuits – Flip flops – Analysis and design procedures - State reduction and

state assignment - Shift registers – Counters – HDL for Sequential Circuits.

UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC

Analysis and design of asynchronous sequential circuits - Reduction of state and flow

tables – Race-free state assignment – Hazards. ASM Chart.

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.

MODEL QUESTION PAPER1

MODEL QUESTION PAPER2

MODEL QUESTION PAPER3

MODEL QUESTION PAPER4

MODEL QUESTION PAPER5

### 141301 DATA STRUCTURES QUESTION PAPER QUESTION BANK MODEL QUESTION PAPERFOR UNIT1,UNIT2,UNIT3.UNIT4,UNIT5 IMPORTANT TWO MARKS AND 16 MARKS QUESTIONS ANNA UNIVERSITY OF

Unit I Linear 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

Unit II Tree Structures

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 III Balanced Trees

AVL Trees – Splay Trees – B-Tree - heaps – binary heaps – applications of binary heaps

Unit IV Hashing and Set

Hashing – Separate chaining – open addressing – rehashing – extendible hashing - Disjoint Set ADT – dynamic equivalence problem – smart union algorithms – path compression – applications of Set

Unit V Graphs

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

TEXT BOOK

1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition , Pearson Education, 2005.

REFERENCES

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, First Edition Reprint 2003.

2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Edition, 2005.

### 181301 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS SYLLABUS

## Labels

- CSE QB (90)
- EEE QP (56)
- MBA QP (50)
- ECE QP (49)
- NOV/DEC 2011 QP (27)
- IT QB (26)
- CSE NOTES (20)
- ECE NOTES (17)
- FIRST YEAR QP (16)
- EEE NOTES (14)
- AREO QB (11)
- Production Engg. QP (11)
- CSE QP (9)
- IT NOTES (9)
- CIVIL QB (7)
- CSE DEPT (6)
- FIRST YEAR NOTES (6)
- IT QP (5)
- RESULTS (5)
- ECE QB (4)
- EEE QB (3)
- Mechanical Notes (3)
- Mechanical QB (3)
- Gulbaraga QP (2)
- TIME TABLE (2)
- APRIL/MAY 2011 (1)
- Annamalai Univ. QP (1)
- JNTU KAKINADA (1)
- JNTU KAKINADA QP (1)
- JNTU QUESTION PAPER (1)
- MCA NOTES (1)
- MCA QB (1)