[Type the document title]
A.P.S COLLEGE OF ARTS AND SCIEN0CE
[Link], BANGALORE-19
II Semester BCA
Data structure:
Chapter1:
1).what is non-primitive ds?give example
[Link] ADT?
[Link] note on Queue ADT?
[Link] Algorithm and algorithm complexity.
[Link] is the relationship b/w ADT and Data structure.
[Link] space and time complexity.
[Link] Data Structure list the types of Data structure.
Chapter2:
[Link] explain best case, average case and worst case time complexity of an algorithm.
[Link] out the space required for matrix multiplication and factorial of a number.
[Link] big 0notation,Omega and Theta Notation.
[Link] algorithmic notation with examples.
[Link] all the case efficiency of an algorithm?
Chapter3:
[Link] any four string operations?
[Link] the difference storage representation of strings?
[Link] is pattern matching give an example?
[Link] any four string library functions in c?
[Link] a program to find length of a string, concatenate two strings ,compare two strings.
[Link] knuth-morrie prat algorithm[kmp algorithm]
Chapter4:
[Link] an array, linear array?
[Link] array as ADT?
[Link] c program to perform insert and delete operation on array.
[Link] between static array and dynamic array.
[Link] linear arrays and represented in memory?
[Link] is multidimensional array, spare matrices?
7. explain memory and row major representation of multi dimensional arrays.
Chapter5:
[Link] bubble sort, insertion sort and selection sort techniques.
[Link] the steps to sort the element 25,57,48,37,12,92,86,33 using selection sort?
[Link] merge sort works ? explain with an example
[Link] linear search works? explain with an example?
[Link] a. binary search ,[Link] search and its complexity.
[Link] linear and binary search techniques.
[Link] all types of sorting methods?
(concentrate on programs also(as example))
DN NOTES
Page 1
[Type the document title]
Chapter 6.
[Link] linked list (all types of linked list include)
[Link] linked list representation of stacks and queues.
3. write an algorithm for traversing a singly linked list , doubly and circular linked list?
[Link] singly linked list v/s doubly linked list?
[Link] is garbage collection?
[Link] types of operations on linked list?
[Link] static representation of linked list?
[Link] and disadvantages of all type of linked list?
[Link] of linked list?
[Link] the types of operations of singly linked list, doubly linked list, circular linked list?
((concentrate on programs also(as example))
Chapter 7
Write algorithm for push and pop operation on a linked stacks.
[Link] recursion of characteristics of recursion.
[Link] an algorithm for tower of Hanoi problem.
[Link] a program to generate Fibonacci series, factorial of a number, tower of honoi.
[Link] and disadvantages of recursion,
[Link] is infix notation ,prefix polish notation.
[Link] a c program to convert infix to postfix expression.
[Link] prefix and post fix form of the
a.(A+B)*C-(D-E))/(F+G) B.(A+B)*(C+D-E)*F C. (A+B)*(C+D)*(A+B)
Chapter 8:
[Link] queue as ADT?
[Link] advantages and disadvantages of array representation of queues.
[Link] linked list representation of queues.
[Link] types of queues with example?
[Link] the working of circular ,doubly and singly linked list with example.
[Link] the applications of queues.
[Link] an algorithm for insert and delete operations on a queue.
Chapter 9:
[Link] a)degree b)leaf c)level d)depth or height e)siblings f)forest
[Link] an algorithm for constructing a
a)binary search tree
b)red black tree
c)AVL Tree
d)B-Tree
[Link] is red black tree and explain the properties of red black trees.
[Link] is balance factor in AVL Trees? give example.
[Link] is heap tree ?how it is different from BST?
[Link] B-tree, explain B-tree
[Link] a algorithm for in order ,pre order and post order traversal of a binary tree.
[Link] the applications of trees.
[Link] is external searching ?give an example of B-Tree .
DN NOTES
Page 2
[Type the document title]
[Link] insert and delete operations in a red black tree with an example?
Chapter 10
[Link] hashing works with an example?
[Link] hast table as ADT?
[Link] are the characteristics of good hash functions?
[Link] is hast table? give example
[Link] various methods of choosing a hashing functions
DN NOTES
Page 3