EE 9305 Data Structures and algorithms syllabus download

EE9305 DATA STRUCTURES AND ALGORITHMS L T P C
3 0 0 3
AIM
The aim of this course is to provide an introduction to computer algorithms and data
structures, with an emphasis on foundational material.
OBJECTIVES
At the end of the course students should
 Have a good understanding of the fundamental data structures used in computer
science
 Have a good understanding of how several fundamental algorithms work, particularly
those concerned with sorting, searching and graph manipulation
 Be able to analyze the space and time efficiency of most algorithms
 Be able to design new algorithms or modify existing ones for new applications and
reason about the efficiency of the result26
UNIT I INTRODUCTION AND BASIC DATA STRUCTURES 9
Problem solving Techniques and Examples - Abstract Data Type (ADT) - The List ADT -
Arrays - Stacks and Queues: Implementation and Applications.
UNIT II ADVANCED DATA STRUCTURES 9
Trees: Preliminaries - Binary Tree - Tree Traversals - Binary Search Trees - AVL Trees.
UNIT III SORTING AND HASHING 9
Sorting by Selection - Sorting by Insertion - Sorting by Exchange - Sorting by
Diminishing Increment - Heap Sort - Heaps - Maintaining the Heap Property - Building a
Heap - Heap Sort Algorithm - Quick Sort - Description - Performance of quick sort -
Analysis of Quick Sort.. Hashing - General Idea - Hash Functions - Separate Chaining -
Open Addressing - Rehashing - Extendible Hashing.
UNIT IV ALGORITHM DESIGN TECHNIQUES 9
The role of Algorithms in computing - Getting Started - Growth of functions. Divide and
Conquer - Dynamic Programming - Greedy Algorithm - Backtracking - Branch and
Bound - Randomized Algorithms
UNIT V GRAPHS ALGORITHMS 9
Elementary Graph Algorithms - Minimum Spanning Trees - Single-source Shortest Paths
- All Pairs Shortest Paths.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. M A Weiss, “Data Structures and Algorithm Analysis in C++”, 3rdEdition, Pearson
Education, 2007.
2. Thomas H Cormen, Charles E Leiserson and Ronald L Rivest, “Introduction to
Algorithms”, 2ndEdition, Prentice Hall of India, 2002.
REFERENCES:
1. R G Dromey, “How to Solve it by Computers”, Pearson Education Asia, 2005.
2. Robert L Kruse, Clovis L Tando and Bruce P Leung, “Data Structures and
Program Design in C”, 2ndEdition, Prentice Hall of India.
3. Jean Paul Trembley, Paul G Sorenson, “An Introduction to Data Structures with
Applications”, 2ndEdition, Tata McGraw Hill, 2007.

EE9302 Power system Analysis syllabus download

EE9302 POWER SYSTEM ANALYSIS L T P C
3 1 0 4
AIM
To become familiar with the modeling of various power system components and different
methods of analysis for power system planning and operation.
OBJECTIVES
 To model steady-state operation of large-scale power systems and to solve the
power flow problems using efficient numerical methods suitable for computer
simulation.
 To model and analyse power systems under abnormal (fault) conditions.
 To model and analyse the dynamics of power system for small-signal and large
signal disturbances and o design the systems for enhancing stability.
UNIT I INTRODUCTION 12
Overview of Power System Analysis: Importance of system planning and operational
analysis; Distinction between steady state, quasi steady state and transient analysis; Per
phase analysis of symmetrical three phase system, single line diagram, per unit
representation; different models for generator, load and transmission lines based on the
analysis of interest – π equivalent circuit of transformer with off nominal-tap ratio.
UNIT II BASICS OF ANALYSIS AND COMPONENT MODELLING 12
Primitive network and its matrices, bus admittance matrix formation by inspection
method and singularity transformation method, bus impedance matrix formation by L-U
factorisation of bus admittance matrix and by building algorithm. Symmetrical component
transformation, sequence impedances and sequence networks.
UNIT III POWER FLOW ANALYSIS 12
Importance of power flow analysis in planning and operation of power systems; Power
flow problem: Description of the problem, classification of buses into P-Q buses, P-V
(voltage-controlled) buses and slack bus. Power flow equations and solution:
Development of power flow model in complex variable form, Iterative solution using
Gauss-Seidel and Newton-Raphson methods including Q-limit check for voltagecontrolled buses, flow chart- numerical examples.

UNIT IV FAULT ANALYSIS 12
Symmetrical short circuits: Thevenin’s theorem and applications, short circuit analysis -
numerical examples. Short circuit capacity - circuit breaker selection. Unsymmetrical
short circuits: Derivation of fault current for LG, LL, LLG short circuits and development
of interconnection of sequence networks.
UNIT V STABILITY ANALYSIS 12
Description of power system stability problem; importance of stability analysis in power
system planning and operation; classification of power system stability. Single Machine
Infinite Bus (SMIB) system: Development of swing equation; power-angle equation;
Equal Area Criterion; determination of critical clearing angle and time; algorithm for
numerical solution of swing equation using modified Euler method; usage of numerical
algorithm for determination of critical clearing time by trial and error – digital simulation.

L: 45 T: 15 TOTAL: 60 PERIODS23
TEXT BOOKS:
1. Hadi Saadat, ‘Power System Analysis’, Tata McGraw Hill Publishing Company
Ltd., New Delhi, 2002.
2. John J. Grainger and W.D. Stevenson Jr., ‘Power System Analysis’, Tata McGraw
Hill Publishing Company Ltd., New Delhi,2003.
3. D.P.Kothari , I.J. Nagarath, ‘Power System Engineering’,Tata McGraw-Hill
Publishing Company Ltd., NewDelhi, 2007
REFERENCES:
1. P. Kundur, ‘Power System Stability and Control, Tata McGraw-Hill Publishing
Company Ltd., New Delhi, 1994.
2. I.J. Nagrath and D.P. Kothari, ‘Modern Power System Analysis’, Tata McGraw-Hill
Publishing Company Ltd., New Delhi, 1990.
3. Olle. I. Elgerd, ‘Electric Energy Systems Theory – An Introduction’, Tata McGraw
Hill Publishing company Limited, New Delhi, Second Edition, 2003.