Pages

Ads 468x60px

Text Widget

Recent Posts

Download

Saturday 18 February 2012

Electrical & Electronics Engineering (III)

SEMESTER-3:












EE2204-DATA STRUCTURES AND ALGORITHMS

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.
TREE STRUCTURES
Need for non-linear 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
BALANCED SEARCH TREES AND INDEXING
AVL trees – Binary Heaps – B-Tree – Hashing – Separate chaining – open addressing – Linear probing
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
ALGORITHM DESIGN AND ANALYSIS
Greedy algorithms – Divide and conquer – Dynamic programming – backtracking – branch and bound – Randomized algorithms – algorithm analysis – asymptotic notations – recurrences – NP-complete problems
REFERENCE
Text Books
1.M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education Asia, 2002.
2.ISRD Group, “Data Structures using C”, Tata McGraw-Hill Publishing Company Ltd., 2006.
Reference Books
1.A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
2.R. F. Gilberg, B. A. Forouzan, “Data Structures: A Pseudocode approach with C”, Second Edition, Thomson India Edition, 2005.
3.Sara Baase and A. Van Gelder, “Computer Algorithms”, Third Edition, Pearson Education, 2000.
4.T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms", Second Edition, Prentice Hall of India Ltd, 2001.

EE2207-ELECTRONICS DEVICES & CIRCUITS LAB

LIST OF EXPERIMENTS
1.PN Junction diode and Rectifier Applications.
2.Bipolar Junction transistor -CE, CB, CC characteristics.
3.JFET – characteristics and parameter determination.
4.UJT & SCR Characteristics & UJT – Controlled SCR.
5.Characteristics of DIAC and TRIAC.
6.Characteristics of BJT Amplifier frequency response.
7.Characteristics of FET amplifier frequency response.
8.Characteristics of Class B amplifier – Darlington pair.
9.Characteristics of Differential amplifier.
10.Class D – Totempole configuration.
11.PSPICE modeling of electronic circuits.

EE2209-DATA STRUCTURES AND ALGORITHMS LABORATORY

LIST OF EXPERIMENTS
1.Implement singly and doubly linked lists.
2.Represent a polynomial as a linked list and write functions for polynomial addition.
3.Implement stack and use it to convert infix to postfix expression.
4.Implement array-based circular queue and use it to simulate a producer-consumer problem.
5.Implement an expression tree. Produce its pre-order, in-order, and post-order traversals.
6.Implement binary search tree.
7.Implement insertion in AVL trees.
8.Implement priority queue using heaps.
9.Implement hashing techniques.
10.Perform topological sort on a directed graph to decide if it is acyclic.
11.Implement Dijkstra's algorithm using priority queues.
12.Implement Prim's and Kruskal's algorithms.
13.Implement a backtracking algorithm for Knapsack problem.
14.Implement a branch and bound algorithm for traveling salesperson problem.
15.Implement any randomized algorithm.

EE2208-MEASUREMENTS AND INSTRUMENTATION LABORATORY

LIST OF EXPERIMENTS
1.Study of displacement and pressure transducers.
2.AC bridges.
3.DC bridges.
4.Instrumentation amplifiers.
5.A/D and D/A converters.
6.Study of transients.
7.Calibration of single-phase energy meter.
8.Calibration of current transformer.
9.Measurement of three phase power and power factor.
10.Measurement of iron loss.

0 comments:

Post a Comment

 

Sample text

Sample Text

Sample Text