Data Structure

The objective of this course includes: analysis of time and space complexity of algorithms; discuss the implementation of linear data structures such as stacks, queues and lists and their applications; discuss the different ways of writing and converting expressions like Infix, Prefix, and Postfix; discuss the implementation of non linear data structures such as trees and graphs and their applications; discuss the implementation of searching techniques such as Linear and Binary search; discuss the implementation of sorting techniques such as Insertion, Selection, Merge, Quick and Bubble sorting; and discuss the binary tree traversal techniques like Breadth First Search (BFS) and Depth First Search (DFS).