Professional Documents
Culture Documents
Year
C
SEMESTER
2
DATA STRUCTURES
Course Objectives: Upon the Completion of this course, student will
be able to do the following
To assess how the choice of data structures and algorithm design
methods impacts the performance of programs.
To choose the appropriate data structure and algorithm design method
for a specified application.
To study the systematic way of solving problems, various methods of
organizing large amounts of data.
To solve problems using data structures such as linear lists, stacks,
queues, hash tables, binary trees, heaps, tournament trees, binary
search trees, and graphs and writing programs for these solutions.
To employ the different data structures to find the solutions for specific
problems.
Course Outcomes:
UNIT I:
Preliminaries of algorithm, Algorithm analysis and complexity,
Data structure- Definition, types of data structures: Stacks, Queues, Linked
List, Trees, Graphs-Advantages & disadvantages.
Recursion: Definition, Design Methodology and Implementation of recursive
algorithms, Linear and binary recursion, recursive algorithms for factorial
function, GCD computation, Fibonacci sequence, Towers of Hanoi, Tail
recursion
UNIT II:
SEARCHING & SORTING TECHNIQUES
6. Mark allen weiss ,Data structures and algorithm analysis in C, 2nd ed,
WEB LINKS:
1. http://www.cplusplus.com/doc/tutorial/structures/
2. https://discuss.codechef.com/questions/.../data-structures-andalgorithms
3. www.webcrawler.com