Professional Documents
Culture Documents
Deptt.: Computer Science & Engineering LABORATORY: Data Structures LAB Semester: Iii
Deptt.: Computer Science & Engineering LABORATORY: Data Structures LAB Semester: Iii
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
Q14. What is the difference between int (*p)[10] and int *p[10] ?
Ans: int (*p)[10] means that p is a pointer pointing to an array of size 10 whereas int *p[10] means
that p is an array of pointers of size 10. all containing integer type values.
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
Q44. what is the time complexity of heap sort in average and worst case?
Ans: O(n log n)
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
Q55. what is the relation between the branches and nodes in a b-tree?
Ans: n=B+1
Where n is the number of nodes
and B is the number of branches.
Q59. what are the operations that can be performed on data structure?
Ans: traversing, searching,inserting,deleting
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
Ans: a linked list is a linear collection of data elements called nodes where the linear order is given by
means of pointers.
DEPTT. : COMPUTER SCIENCE & ENGINEERING LABORATORY: Data Structures LAB SEMESTER: III
Ans: it is a notation in which operator is placed before 2 operands eg. +AB. It is also called prefix
notation.
Q77. how does computer evaluates arithmetic expression which is in infix notation?
Ans: 1. first it is converted to postfix notation.
2.then postfix expression is evaluated using stacks.