Syllabus Of Data Structures Using C

Introduction to Data structures:
Definition, Classification of data structures : primitive and non primitive. Operations on data structures.

Dynamic memory allocation and pointers:
Definition Accessing the address of a variable, Declaring and initializing pointers. Accessing a variable through its pointer. Meaning of static and dynamic memory allocation. Memory allocation functions : malloc, calloc, free and realloc.

Recursion:
Definition, Recursion in C, Writing Recursive programs – Binomial coefficient, Fibonacci, GCD.

Searching and Sorting Search:
Basic Search Techniques : Search algorithm searching techniques : sequential search, Binary search – Iterative and Recursive methods. Comparison between sequential and binary search.

Sort- General Background: Definition, different types: Bubble sort, Selection sort, Merge sort, Insertion sort, Quick sort

Stack – Definition, Array representation of stack, Operations on stack: Infix, prefix and postfix notations Conversion of an arithmetic expression from Infix to postfix. Applications of staks.

Queue - Definition, Array representation of queue, Types of queue: Simple queue, circular queue, double ended queue (deque) priority queue, operations on all types of Queues

Linked list – Definition, Components of linked list, Representation of linked list, Advantages and Disadvantages of linked list. Types of linked list : Singly linked list, Doubly linked list, Circular linked list and circular doubly linked list. Operations on singly linked list : creation, insertion, deletion, search and display.

Tree - Definition : Tree, Binary tree, Complete binary tree, Binary search tree, Heap Tree terminology : Root, Node, Degree of a node and tree, Terminal nodes, Nonterminal nodes, Siblings, Level, Edge, Path, depth, Parent node, ancestors of a node. Binary tree : Array representation of tree, Creation of binary tree. Traversal of Binary Tree : Preorder, Inorder and postorder.

Lab Programs
  1.  LINSERT Inserting a node in the front of the list
  2.  LDELETE Deleting the node based on Roll – No
  3.  LSEARCH Searching a node based on Roll-No
  4.  LDISPLAY Displaying all the nodes in the list
  1.  Given a KEY, Perform a search in Binary search tree. If it is found display Key found else insert the key in the Binary search tree.
  2.  While constructing the Binary search tree do not add any duplicate
  3.  Display the tree using any of the traversal method

No comments:

Post a Comment