Scribd
Upload
19 views15 pages

DSA Lecture1

Uploaded by

Manas Kagankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
19 views15 pages

DSA Lecture1

Uploaded by

Manas Kagankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

Data Structures & Algorithms

(Lecture 01 & 02)

Prof. P. T. Sawant
Asst. Prof.
Department of Computer Science & Information
Technology
Introduction
Agenda
 Teaching Scheme

 Evaluation scheme

 Credits

 Syllabus overview

 Course Learning Outcomes

 References

 Basics of Data Structures and Algorithms


Teaching Scheme

TH - 3 credits
Tut - 0 credit
Total - 3 credits
Evaluation Scheme
Syllabus
Syllabus
Unit 1: Introduction to Data Structures and Algorithms
Introduction to data structures, Need and Applications, Primitive and Non-primitive data
structures, Operations on data structures, Abstract Data Types, Algorithms, Analysis
of Algorithm: Complexities and Asymptotic notations, Examples .

Unit 2: Linear Data Structures


Array, Stack: Definition, Representation, Operations and Applications of Stack. Queue:
Definition, Representation, Operations and Applications of Linear Queue, Circular
queue, Deque, Priority Queue.
Syllabus (Cond..)
Unit 3: Linked Lists
Definition, Terminologies, Representation, Operations, Singly linked list, Doubly
linked list, Circular linked list, Stack using linked list, Queue using linked list.

Unit 4: Trees
Definition, Terminologies and Applications, Binary trees and types. Binary tree
traversals, Binary search trees, AVL tree, B tree, B+tree.
Syllabus (Cond..)
Unit 5: Graph
Definition, Terminologies and Applications, Types of graphs, Representation of graph
using adjacency matrix and adjacency list, Graph traversal Techniques: Depth first
and Breath first search, Articulation point in a graph .

Unit 6: Applications of Data Structures


• Reversing string using stack, Evaluation of postfix expression using stack, Infix to
postfix conversion using stack, Tower of Hanoi, Addition of two polynomials,
Hashing, File Handling in C
Course Learning Outcomes
On completion of this course the student will be able to:

1. Explain the basic terminologies of data structures and algorithms

2. Write algorithms for operations to be performed on data structures

3. Demonstrate the working of stack, queue, linked list, tree and graph data structures

4. Compare static and dynamic representations of linear and non-linear data structures

5. Choose appropriate data structures while developing solution to the problem


References
Text Books:
1.G. S. Baluja, “Data Structure Through C: A Practical Approach”, Dhanpat Rai
Publications, Fourth Edition

2.A. S. Tanenbaum, Y. Langsam, M. J. Augenstein, “Data Structure using C”, (PHI)


Second Edition

3. Ellis Horowitz, Satraj Sahani, Saguthevar Rajasejaran, “Fundamentals of Computer


Algorithms”, Universities Press, Second Edition.

Reference Books:
1.Alfred V. Aho, John E. Hopcroft, J. D. Ullman, “Data structures and Algorithms”,
Addision Welsely Series, Third Edition
2.Ashok N. Kamthane, “Introduction to Data Structures in C”, Pearson Education,
Third Edition
3.Yashwant P. Kanetkar, “Data Structures through C”, BPB Publications, Second
Edition
Basics of Data Structures & Algorithms
Data Structures and Algorithms

Algorithm + Data Structure = Program


Thank You

You might also like