FOURTH SEMESTER DIPLOMA COMPUTER SCIENCE DATASTRUCTURE
REVISION-06 SYLLABUS
UNIT-1
1.Understand Pointers
*Discuss features of pointers
*Explain pointer declaration
*Discuss pointers arithmetic
*State the method of accessing variables
using pointers
*Implement One dim & two dim arrays
using pointers
*Explain array of pointers
*Explain pointer to pointer
*Discuss use of pointer to handle string
*Discuss void pointer
*Explain use of pointers as function
arguments
*Define recursion
*Discuss features of structure
*Explain declaration & initialization
of structures
*Explain structure within structure
*Explain array of structures
*Explain use of pointers to structures
*Explain passing structure to functions
*Define union
*Differentiate Structure and union
*Implement string operations such as string
length,compare,copy,sub-string using User defined functions.
*Explain and implement pattern matching
*Explain dynamic memory allocation
UNIT II
*List different sorting techniques
*Implement bubble sort
*Implement selection sort
*Implement insertion sort
*Implement quick sort
*Implement bucket sort
*Implement Heap sort
*Define merging
*Understanding external sort
*Implement merge sort
*Define searching
*implement linear search
*implement binary search
*Compare the different sorting algorithms
such as bubble sort,quick sort,selection sort,heap sort ,insertion sort ,merge
sort
*Compare different searching algorithms
such as linear searching and binary searching
UNIT-III
*Define linked list
*Study operations on linked
list-traversal,searching,insertion and deletion of nodes
*Explain singly linked list(SLL)
*Implement SLL
*Explain circular linked list
*Implement circular linked list
*Explain doubly linked list(DLL)
*Implement DLL
*Explain circular DLL
*Implement circular DLL
UNIT-IV
*Define stack
*Describe the push and pop operation of
stack
*Implement stack using arrays
*Implement stack using pointers
*Explain applications of stack
*Define queue
*Explain the operations on queue-insert and
delete
*Implement queue using arrays
*Implement queue using pointers
*implement circular implementation of a
queue
*Explain double ended queue-Input restricted
Dqueue & output restricted Dqueue
*Explain priority queue-ascending and
descending
*Understand applications of queue
UNIT-V
*Define tree
*Understand
terms-root,node,child,parent,link,leaf,level,height,degree of a
node,sibling,terminal node,path length,forest,labeled trees
*Explain binary tree
*Discuss the different operation on tree
*State the applications of trees
*Implement binary tree
operations-insertion,deletion of node and searching
*Discuss tree traversal methods
*Implemet tree traversal algorithms-inorder
,preorder,postorder
*Discuss Binary Search Tree(BST)
*Discuss the use of threaded binary tree
*Define graph
*Explain searching methods-DFS,BFS
*Explain Dijkstra algorithm to find
shortest path
*Implement Dijkstra algorithm
0 comments:
Post a Comment