28.01.2013 Views

THIAGARAJAR COLLEGE OF ENGINEERING: MADURAI – 625 015 ...

THIAGARAJAR COLLEGE OF ENGINEERING: MADURAI – 625 015 ...

THIAGARAJAR COLLEGE OF ENGINEERING: MADURAI – 625 015 ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Pointers, Dynamic Memory, and the `new' Operator, Memory Leaks, Scope and Namespaces, Expressions,<br />

Casting in Expressions, Control Flow, Functions ,Overloading ,Classes ,Constructors and Destructors,<br />

Classes and Memory Allocation, Class Friends and Class Members, The Standard Template Library, C++<br />

Program and File Organization An Example Program, Writing a C++ Program in design and coding<br />

-Testing and Validation.<br />

(10 Periods)<br />

UNIT II: Object Oriented Design: Object-Oriented Design Principles, Inheritance and Polymorphism,<br />

Inheritance in C++, Polymorphism ,Examples of Inheritance in C++, Multiple Inheritance and Class<br />

Casting, Interfaces and Abstract Classes, Templates, Exceptions, Recursion and Other Design Patterns.<br />

(10 Periods)<br />

(10 Periods)<br />

UNIT III: Stacks, Queues, and Recursion: Using Recursion ,Higher-Order Recursion, Stacks, A Simple<br />

Array-Based Implementation, Implementing Recursion and Function Calls, Queues, Linked Lists, Double-<br />

Ended Queues, Sample Case Study Application, A Quadratic-Time Algorithm, A Linear-Time Algorithm,<br />

C++ Implementation<br />

(10 Periods)<br />

UNIT IV: Trees: The Tree Abstract Data Type, Terminology and Basic Properties, Tree Functions, A<br />

Tree Interface, Basic Algorithms on Trees, Running-Time Assumptions, Depth and Height, Preorder<br />

Traversal, Postorder Traversal, Binary Trees, Properties of Binary Trees, 275 Traversals of a Binary Tree,<br />

The Template Function Pattern, Data Structures for Representing Trees, A Linked Structure for General<br />

Trees, Representing General Trees with Binary Trees.<br />

(10 Periods)<br />

UNIT V: Sorting & Graphs: Merge-Sort, Divide-and-Conquer, A C++ Implementation of Merge-Sort<br />

Merge-Sort and Recurrence Relations ,Graphs: The Graph Abstract Data Type , Data Structures for<br />

Graphs, The Edge List Structure, The Adjacency List Structure, The Adjacency Matrix Structure, Graph<br />

Traversal, Depth-First Search ,Breadth-First Search, Directed Graphs, Weighted Graphs.<br />

(10 Periods)<br />

(10 Periods)<br />

Text Book:<br />

Goodrich, Tamassia and Mount, “Data Structures and Algorithms in C++”, 2004 Wiley Higher<br />

Education.http://cpp.datastructures.net/index.html<br />

Reference Books:<br />

1. Data Structure & Algorithm Analysis in C++ by Mark Allen Weiss, Pearson Education Asia,<br />

2002.<br />

2. Algorithms in C++ by Robert Sedgewick, Pearson Education Asia, 2002<br />

• Microwave X Band bench.<br />

D67 MICROWAVE AND ANTENNA LAB<br />

Source Characteristics, V-I Characteristics, Power and Frequency Measurement<br />

Device Characterization<br />

Coupler, Attenuator, Slotted Line, Y I G Filter, Hybrid<br />

• Antenna measurements

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!