CS301 Midterm Current Paper 17 dec 2016
Here I am going to share CS301 paper which was held on 17 december 2016
The questions in CS301 current paper was like:
|CS301 Midterm Current Paper|
If we delete node 7 then which node will take its place? Assume that we want in-order predecessor should take its place.
Convert X +Y - Z into postfix Expression
What is the best case of adding an item in an array list? Also state the reason.
Consider the following AVL tree.Insert new node 45 in this tree and make tree balance. You have to show only the complete AVL tree, steps are not required.
How can we implement the function of shifting element right or left in a list data structure ?
How parameters are passed (by value or reference) in the following languages?