Page 1 :
PPT, , a, , a, , DSUC (KCS-301), ASSIGNMENT- I, , Write the binary search algorithm to find the location (LOC) of an ITEM of information., What is the complexity of binary search algorithm?, What is doubly linked list? How it is different from the single linked list?, What is sparse matrix? How sparse matrix can be represented efficiently in memory?, What are the various Asymptotic notations? Explain each in brief., Write an algorithm to insert an ITEM into a linear array. Also write the algorithm for, deletion operation in a linear array., What is meant by circular linked list? Explain the linked representation of the following, polynomial expression in memory with suitable diagram., 4x3+6x7+ 10X46, Write the functions to perform the following operations in a doubly linked list., a) Creation of list of nodes., b) Insertion after a specific node,, c) Delete the node at a given position., d) Sort the list according to descending order., e) Display from the beginning to end.