Unit-1

Basic concepts of Data Structures; Basic Analysis of Algorithms – big-Oh notation, efficiency of algorithms, notion of time and space complexity. Stacks: properties, LIFO, functions, Simple problems.

Unit-2

Recursion – Simple Examples , Linear Recursion , Binary Recursion. Queues: Properties – FIFO- Functions, simple problems, Double Ended Queue, Circular Queue.

Unit-3

Linked Lists – Types, Properties , Functions, Simple problems. Vectors and Hash Tables – Functions and Properties. Sets – properties and implementation.

Preamble

This course aims to provide the students an introduction to the structure and functionalities of the common data structures used in computer science, and solve simple problems applying the properties and functionalities of these data structures.

Course Outcomes

The student at the end of the course will

CO – PO Mapping

Text Book

• Goodrich MT, Tamassia R, Goldwasser MH. Data structures and algorithms in Python. John Wiley & Sons Ltd; 2013.

Reference Book(s)

• Goodrich MT, Tamassia R, Data structures and algorithms in Java. Fifth edition, John Wiley & Sons; 2010.
• Tremblay JP, Sorenson PG. An introduction to data structures with applications. Second Edition, McGraw-Hill; 2002.
• Shaffer CA. Data Structures and Algorithm Analysis. Third Edition, Dover Publications; 2012.