Menu_634636953603897235_CS2201 Data Structures Syllabus
2
SEMESTER II CS2201 DAT A STRUCTURES DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, B. I. T. MESRA MODULE – I Algorithm !"# A"!l$i o% Algorithm: Definition, Structure and Properties of Algorithms, Development of an Algorithm, Data Structures and Algorithms, Data Structure – Definition and Classification, Efficiency of Algorithms, Apriory Analysis, Asymptotic Notations, Time Compleity of an Algorithm using O Notation, Polynomial !s Eponential Algorithms, Av erage, "est and #o rst case Compleities, Analy$ing %ecursive Programs& MODULE – II Arr! $& St!'( !"# )*+*+ : Ar ray 'pe rat ions, Num(er of Ele ments in an Ar ray , %ep res ent ati on of Ar ray s in )emory , Applications of Array, Stac*+ntroduction, Stac* 'perations, Applications of Stac*, -ueues+ntroduction, 'perations on -ueues, Circular -ueues, 'ther Types of -ueues, Applications of -ueues& MODULE – III Li"(+# Lit& Li"(+# St!'( !"# Li"(+# )*+*+ : Singly .in*ed .ists, Circularly .in*ed .ists, Dou(ly .in*ed .ists, )ultiply .in*ed .ists, Applications of .in*ed .ists, ntroduction to .in*ed Stac* and .in*ed -ueues, 'perations on .in*ed Stac*s and .in*ed -ueues, Dynamic )emory )anagement and .in*ed Stac*, mplementations of .in*ed %epresentations, Applications of .in*ed Stac*s and .in*ed -ueues& MODULE – I, Gr!-h: ntro ducti on, Defin itions and "asic Terminolog ies, %epre senta tions of /raph s, /raph Traver sals, Single +Source Shortest+Path Pro(lem, )inimum Cost Spanning Trees& MODULE – , Tr++& Bi"!r$ Tr++& BST& A,L Tr++ !"# B Tr++ : Trees: Definition and "asic Terminologies, %epresentation of Trees, "inary Tre es: "asic Ter minolog ies and Ty pes, %epre senta tion of "ina ry Trees, "ina ry Tr ee Traversals, Threaded "inary Trees , Applications, "ST 0 A!. Trees: ntroduction, "ST: Definition and 'perations, A!. Trees: Definition and 'perations, " Trees: ntroduction, m+1ay search trees: Definition and 'perations, " Trees: Definition and 'perations& MODULE – ,I Sorti"g: ntroduction, Shell Sort, -uic* Sort, 2eap Sort& MODULE – ,II S+!r'hi"g: ntroduction, "inary Search, Transpose Se3uential Search, nterpolation Search& T+t Boo(/ / A ! Pai – Data Structures and Algorithms: Concepts, Techni3ues and Applications, 4 nd Edn, Tata )c/ra1+2ill, 4556 R+%+r+"'+ Boo(: 7& 8& P& Trem(lay & P& /& Sorenson – An ntroduction to Data Structures #ith Applic ations, 4 nd Edn, )c/ra1+2ill, n c& Ne1 9or*, N9, SA& 4& Sey mour .ipsc hut $ – Dat a Structures , ; th Edn, < th %eprint 4556, Ta ta )c/ra1+2ill& =& Adam Dr o$de* – Data Stru cture s and Algorit hms in C>> , Thoms on .ear ning, Ne 1 Delhi – 4 55?&
-
Upload
dwarak-chaluvadi -
Category
Documents
-
view
215 -
download
0
description
Syllabus
Transcript of Menu_634636953603897235_CS2201 Data Structures Syllabus
CP2201
SEMESTER II
CS2201
DATA STRUCTURES DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING, B. I. T. MESRAMODULE I
Algorithms and Analysis of Algorithms: Definition, Structure and Properties of Algorithms, Development of an Algorithm, Data Structures and Algorithms, Data Structure Definition and Classification, Efficiency of Algorithms, Apriory Analysis, Asymptotic Notations, Time Complexity of an Algorithm using O Notation, Polynomial Vs Exponential Algorithms, Average, Best and Worst case Complexities, Analyzing Recursive Programs.
MODULE II
Arrays, Stacks and Queues: Array Operations, Number of Elements in an Array, Representation of Arrays in Memory, Applications of Array, Stack-Introduction, Stack Operations, Applications of Stack, Queues-Introduction, Operations on Queues, Circular Queues, Other Types of Queues, Applications of Queues.
MODULE III
Linked List, Linked Stacks and Linked Queues: Singly Linked Lists, Circularly Linked Lists, Doubly Linked Lists, Multiply Linked Lists, Applications of Linked Lists, Introduction to Linked Stack and Linked Queues, Operations on Linked Stacks and Linked Queues, Dynamic Memory Management and Linked Stack, Implementations of Linked Representations, Applications of Linked Stacks and Linked Queues.
MODULE IV
Graphs: Introduction, Definitions and Basic Terminologies, Representations of Graphs, Graph Traversals, Single-Source Shortest-Path Problem, Minimum Cost Spanning Trees.
MODULE V
Trees, Binary Trees, BST, AVL Trees and B Trees: Trees: Definition and Basic Terminologies, Representation of Trees, Binary Trees: Basic Terminologies and Types, Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Applications, BST & AVL Trees: Introduction, BST: Definition and Operations, AVL Trees: Definition and Operations, B Trees: Introduction, m-way search trees: Definition and Operations, B Trees: Definition and Operations.
MODULE VI
Sorting: Introduction, Shell Sort, Quick Sort, Heap Sort.
MODULE VII
Searching: Introduction, Binary Search, Transpose Sequential Search, Interpolation Search.
Text Book:
G A V Pai Data Structures and Algorithms: Concepts, Techniques and Applications, 2nd Edn, Tata McGraw-Hill, 2008
Reference Books:
1. J. P. Tremblay , P. G. Sorenson An Introduction to Data Structures With Applications, 2nd Edn, McGraw-Hill, Inc. New York, NY, USA.
2. Seymour Lipschutz Data Structures, 6th Edn, 9th Reprint 2008, Tata McGraw-Hill.
3. Adam Drozdek Data Structures and Algorithms in C++, Thomson Learning, New Delhi 2007.
