JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Prerequisites

A course on Computer Programming & Data Structures

Course Objectives:

Introduces the basic concepts of Abstract Data Types. Reviews basic data structures such as stacks and queues. Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs, and B-trees. Introduces sorting and pattern matching algorithms.

Course Outcomes:

Ability to select the data structures that efficiently model the information in a problem. Ability to assess efficiency trade-offs among different data structure implementations or combinations. Implement and know the application of algorithms for sorting and pattern matching. Design programs using a variety of data structures, including hash tables, binary and general tree structures, search trees, tries, heaps, graphs, and B-trees.

List of Programs: Write a program to perform the following operations: Insert an element into a binary search tree. Delete an element from a binary search tree. Search for a key element in a binary search tree.

Write a program for implementing the following sorting methods: Merge sortb) Heap sortc) Quick sort

Write a program to perform the following operations: Insert an element into a B- tree. Delete an element from a B- tree. Search for a key element in a B- tree.

Write a program to perform the following operations: Insert an element into a Min-Max heap Delete an element from a Min-Max heap Search for a key element in a Min-Max heap

Write a program to perform the following operations: Insert an element into a Lefiist tree Delete an element from a Leftist tree Search for a key element in a Leftist tree

Write a program to perform the following operations: Insert an element into a binomial heap Delete an element from a binomial heap. Search for a key element in a binomial heap

Write a program to perform the following operations: Insert an element into a AVL tree. Delete an element from a AVL search tree. Search for a key element in a AVL search tree.

Write a program to perform the following operations: Insert an element into a Red-Black tree. Delete an element from a Red-Black tree. Search for a key element in a Red-Black tree.

Write a program to implement all the functions of a dictionary using hashing.

Write a program for implementing Knuth-Morris-Pratt pattern matching algorithm.

Write a program for implementing Brute Force pattern matching algorithm.

Write a program for implementing Boyer pattern matching algorithm.

Text Books:

Fundamentals of Data structures in C, E. Horowitz, S. Sahni and Susan Anderson Freed, 2nd Edition, Universities Press. Data Structures Using C – A.S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson education. Introduction to Data Structures in C, Ashok Kamthane, 1st Edition, Pearson.

Reference Books:

The C Programming Language, B.W. Kernighan, Dennis M. Ritchie, PHI/Pearson Education. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press. Data structures: A Pseudocode Approach with C, R.F. Gilberg And B. A. Forouzan, 2nd Edition, Cengage Learning.

M.Tech. (Data Science) I Year I Semester