• Define Linear and non-linear data structures.
• List and discuss the different types of linear data structures.
• Differentiate Stack and Queue
• Understand the Operations of Stack
• Explain the applications of stack
• Explain Linked lists and its implementation
• Define a tree and the different terms related with trees.
• Describe the different ways of traversing a binary tree.
• Discuss the various operations on Binary Search tree.
• Define graph terminologies and describe the different ways of traversing a graph.
• Write the algorithm for different types of sorting.
• Write the algorithm for different types of searching

1. Write a program in ‘C’ to perform PUSH and POP operations in stack by using array1. Write a program in ‘C’ to perform PUSH and POP operations in stack by using array
2. Write a program in ‘C’ to display the reverse of a string using a stack.
3. Write a program in ‘C’ to evaluate a post fix expression.
4. Write a program in ‘C’ to create a queue containing ten elements and perform delete and insert operations using array.
5. Write a program in ‘C’ to implement recursive function.
6. Write a program in ‘C’ to create a singly linked list containing at least five elements. Make necessary assumptions.
7. Write a program in ‘C’ to delete the first node that contains an integer data item of a single linked list.
8. Write a program in ‘C’ to create a binary tree.
9. Write a program in ‘C’ for pre-order traversal of a binary tree.
10. Write a program in ‘C’ for binary searching
11. Write a program in ‘C’ to sort ‘N’ Numbers using Insertion sort.
12. Write a program in ‘C’ to sort ‘N’ Numbers using bubble sort.
13. Write a program in ‘C’ to sort ‘N’ Numbers using selection sort.
14. Write a program in ‘C’ to sort ‘N’ Numbers using s Quick Sort

Operations on Stack (PUSH & POP)- Implementing Push and Pop OperationsImplementation of stack through arrays–Applicationsof Stack : Reversing a list- Polish notations - Conversion of infix to postfix expression- Evaluation of postfix expression.

Properties of Recursive algorithms/functions – Advantages and Disadvantages of Recursion, Tower of Hanoi Problem.

The queue and its representation - implementation of Queues and their operations - implementation of Circular queues and their operations - Dequeue and Priority queues (Concepts only)

Node, Address, Pointer, Information, Null Pointer, Empty list -.Type of lists : Singly linked list , Doubly linked list, Circular list - Representation of singly linked lists in Memory-Difference between Linked & sequential List – Advantages and Disadvantages of Linked list- Operations on a singly linked list (only algorithm) : Traversing a singly linked list, Searching a singly linked list, Inserting a new node in a singly linked list ( front, middle, end), Deleting a node from a singly linked list (front, middle, rear) - Doubly linked list, Circular linked lists (Concepts only, no implementations)

Terminologies: Degree of a node, degree of a tree, level of a node, leaf node, Depth / Height of a tree, In-degree & out-Degree, Path, Ancestor & descendant nodes-, siblings - Type of Trees : Binary tree - List representation of Tree - Binary tree traversal: In order traversal, Preorder traversal, Post order traversal, Binary Search Tree.

Introduction - Terminologies: graph, node (Vertices), arcs (edge), directed graph, in-degree, out-degree, adjacent, successor, predecessor, relation, weight, path, length - Representations of a graph - Adjacency Matrix Representation - Adjacency List Representation - Traversal of graphs : Depth- first search (DFS), Breadth-first search (BFS) - Applications of Graph

Introduction - Algorithms and “C” programs for : Selection sort, Insertion sort, Bubble sort - Algorithms only : Merge Sort, Radix sort, Shell sort, Quick sort.

Introduction - Algorithms and “C” programs for Linear search and Binary search

1. Data Structures, Sey Mour Lipschutz Schaum;s outlines, TMH Private Limited, New Delhi, Indian Adapted Edition 2006. 20th Reprint 2011
2. Data Structures with C, Sey Mour Lipschutz, Schaum;s outlines, TMH Private First Reprint 2011
3. Data Structures A Programming approach with C, Dharmender Singh Kushwaha and Arun Kumar Misra, Prentice Hall of India, New Delhi 2012