Data Structure (CS-303)
rgpv bhopal, diploma, rgpv syllabus, rgpv time table, how to get transcript from rgpv, rgpvonline,rgpv question paper, rgpv online question paper, rgpv admit card, rgpv papers, rgpv scheme
B.Tech RGPV notes AICTE flexible curricula Bachelor of technology
Syllabus
UNIT 1:
Review of C programming language.Introduction to Data Structure: Concepts of
Data and Information, Classification of Data structures, Abstract Data Types,
Implementation aspects: Memory representation. Data structures operations and
its cost estimation. Introduction to linear data structures- Arrays, Linked List:
Representation of linked list in memory, different implementation of linked list.
Circular linked list, doubly linked list, etc. Application of linked list: polynomial
manipulation using linked list, etc.
UNIT 2:
Stacks: Stacks as ADT, Different implementation of stack, multiple stacks.
Application of Stack: Conversion of infix to postfix notation using stack,
evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different
implementation of queue, Circular queue, Concept of Dqueue and Priority Queue,
Queue simulation, Application of queues.
UNIT 3:
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree -
Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of
various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B*
tree and red-black tree.
UNIT 4:
Graphs: Introduction, Classification of graph: Directed and Undirected graphs,
etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First
Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal,
Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between
different graph algorithms. Application of graphs.
UNIT 5:
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort,
Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of
various sorting techniques. Searching: Basic Search Techniques: Sequential
search, Binary search, Comparison of search methods. Hashing & Indexing. Case
Study: Application of various data structures in operating system, DBMS etc.
NOTES
- Unit 1
- Unit 2
- Unit 3
- Unit 4
- Unit 5
Text Books
1. AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”,
Prentice Hall India.
2. Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson
Education.
Books Recommended
1. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
2. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
3. Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with
application”, TMH.
4. Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach
with C”, Thomson press.
You May Also Like
- ES-301 - Energy & Environmental Engineering
- CS-302 - Discrete Structure
- CS-304 - Digital Systems
- CS-305 - Object Oriented Programming & Methodology
- CS-306 - Computer Workshop
- BT-107 - Evaluation of Internship-I completed at I year level
- BT-307 - 90 hrs Internship based on using various softwares –Internship -II