This document outlines a course on data structures. The course aims to teach students to analyze algorithm complexity, apply concepts of common data structures like linked lists, stacks, and queues, and develop programs for searching and sorting algorithms as well as trees and graphs. The course is divided into 5 units covering these topics in algorithms analysis, linear data structures, linked representations, searching and sorting, and trees and graphs. References for further reading are also provided.
This document outlines a course on data structures. The course aims to teach students to analyze algorithm complexity, apply concepts of common data structures like linked lists, stacks, and queues, and develop programs for searching and sorting algorithms as well as trees and graphs. The course is divided into 5 units covering these topics in algorithms analysis, linear data structures, linked representations, searching and sorting, and trees and graphs. References for further reading are also provided.
This document outlines a course on data structures. The course aims to teach students to analyze algorithm complexity, apply concepts of common data structures like linked lists, stacks, and queues, and develop programs for searching and sorting algorithms as well as trees and graphs. The course is divided into 5 units covering these topics in algorithms analysis, linear data structures, linked representations, searching and sorting, and trees and graphs. References for further reading are also provided.
This document outlines a course on data structures. The course aims to teach students to analyze algorithm complexity, apply concepts of common data structures like linked lists, stacks, and queues, and develop programs for searching and sorting algorithms as well as trees and graphs. The course is divided into 5 units covering these topics in algorithms analysis, linear data structures, linked representations, searching and sorting, and trees and graphs. References for further reading are also provided.
4 0 0 3 Course Outcomes: At the end of the course, a student will be able to CO 1 Analyse complexity of algorithms. CO 2 Apply concepts of linked lists, stacks and queues. CO 3 Develop programs for searching and sorting. CO 4 Develop programs using concepts of trees. CO 5 Apply concepts of graphs UNIT-I (12 Lectures) ANALYSIS OF ALGORITHMS: Efficiency of algorithms, apriori analysis, asymptotic notations, time complexity of an algorithm using O notation, polynomial Vs exponential algorithms, average, best and worst case complexities, analyzing recursive programs. STACKS: Introduction, stack operations, applications. QUEUES: Introduction, Operations on queues, circular queues, other types of queues, applications. UNIT-II (12 Lectures) LINKED LISTS: Introduction, Singly linked lists, circularly linked lists, doubly linked lists, multiple linked lists, applications. LINKED STACKS AND LINKED QUEUES: Introduction, operations on linked stacks and linked queues, dynamic
G V P College of Engineering (Autonomous) 2014
78 CSE
memory management and linked stacks, implementation of linked
representations, applications. UNIT-III (12 Lectures) SEARCHING: Introduction, linear search, transpose sequential search, interpolation search, binary search, Fibonacci search. INTERNAL SORTING: Introduction, bubble sort, insertion sort, selection sort, merge sort, quick sort. UNIT-IV (12 Lectures) TREES AND BINARY TREES: Introduction, 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. BINARY SEARCH TREES AND AVL TREES: Introduction, binary search trees: definition and operations, AVL Trees: definition and operations, applications. UNIT-V (12 Lectures) GRAPHS: Introduction, definitions and basic terminologies, representations of graphs, graph traversals and applications. TEXT BOOKS: 1. G A V PAI, Data Structures and Algorithms, Concepts, Techniques and Applications, Volume 1, 1st Edition, Tata McGraw-Hill, 2008. 2. Richard F. Gilberg & Behrouz A. Forouzan, Data Structures, A Pseudo code Approach with C, 2nd Edition, Cengage Learning India Edition, 2007.
G V P College of Engineering (Autonomous) 2014
CSE 79
REFERENCES: 1. Langsam ,M. J. Augenstein, A. M. Tanenbaum, Data structures using C and C++, 2ndEdition, PHI Education,2008. 2. Sartaj Sahni, Ellis Horowitz ,Fundamentals of Data Structures in C, 2ndEdition, Orient blackswan , 2010. WEB REFERENCES: http://nptel.iitm.ac.in/video.php?subjectId=106105085
