|
|
TOTAL(52 HRS)
1.INSTRUCTION TO DATA STRUCTURE:(2hrs)
Definiton ,Classification of data structures-primitive and non primitive,Operations on data structures
2.DYNAMIC MEMORY ALLOCATION AND POINTER:(4 HRS)
Definition Accessing the address of a variable and initializing pointers,Accessing a variable through its pointer ,Meaning of static and dynamic memory allocation,
Memory allocation function:malloc,calloc,free and realloc
3.RECURSION:(4 HRS)
Definition,recursion in C,Writing Recursive programs-Binomial coefficient,Fibonacci,GCD
4.SEARCHING AND SORT:(4 HRS)
Basic seacrh techniques,search algorithm seacrhing techniques:sequential seach,Binary seacrh-Iterative and recursive methods,Comparision between sequential and binary search
SORT(10 HRS)
General background:Definition,different types:Bubble sort,Selection sort,Merge sort,Insertion sort,Quick sort
5. STACK:(7 HRS)
Definition,Array reprsentation of stack,Operation on stack:Imfix,
prefix and postfix,Application of stacks
6.QUEUE(7 HRS)
Definiton ,Array representation of queue ,Type of queue:Simple queue,Circular queue,Double ended queue ,priority queue,
operations on all the types of queues
7.LINKED LIST(7 HRS)
Definition,Components of linked list,Representation of linked list,Advantages and disadvantages of linked li8st.Types of linked list :Singly linked list ,Doubly linked list,Circular linkled list and circular doubly linked list.Operations on singaly linked list:creation,insertion,deletion,search and display
8.TREE(HR 7)
Definition,Complete binary tree,binary search tree,heap tree terminology:root ,node,edge,path,depth,parent node,ancestor of a node.Binary tree:Array representation of tree,Creation of binary tree.Traversal of binary tree:Preorder,Inorder and postorder
Recursive methods,Comparison between sequential and binary search
|
No responses found. Be the first to respond and make money from revenue sharing program.
|