MCA06

Data structure through C language
Year / Semester: 
2nd Semester
Objective: 

Data Structure Through C Language

Credits: 
4

UNIT 1 :    Introduction to Data Structure        

Basic concept of data, data type, Elementary structure, Arrays: Types, memory representation, address translation functions for one & two dimensional arrays and different examples.

UNIT 2 :    Algorithms       

Complexity, time-Space, Asymptotic Notation

UNIT 3 :    Linked List       

Introduction to Linked List , representation of single linked list, linked list operations :Insertion into a linked list, deletion a linked list, searching and traversal of elements and their comparative studies with implementations using array structure.

UNIT 4 :    Stack       

Definitions, representation using array and linked list structure, applications of stack.

UNIT 5 :    Queue       

Definitions, representation using array, linked representation of queues, application of queue.

UNIT 6 :    Searching       

Linear and Binary search techniques, Their advantages and disadvantages, Analysis of Linear and Binary search

UNIT 7 :    Sorting       

Sorting algorithms (Complexity, advantages and disadvantage, implementation), bubble sort, insertion sort, selection sort, quick sort.

UNIT 8 :    Trees       

Definition and implementation : Binary Tree, Tree traversal algorithms (inorder, preorder, postorder), postfix, prefix notations; Binary Search Tree: Searching in BST, insertion and deletion in BST.

UNIT 9 :    Graph       

Introduction to Graph, Graph representation : adjacency matrix, adjacency list,     Traversal of graph : depth first search and breadth first search.
 

Suggested Readings: 

1. Rajni Jindal, Data Structure Using C, Umesh Publications
2. Horowitz, Fundamental of Data Structure, Galgotia Publication