There were total 26 question… o
ut of which 20 are multiple choice and last 6 question are descriptive 2 question of 2marks and two question of 3marks and last 2 question of 5 marks..
Following are the quiz which I remembered -à
Question No:21
Develop level two binary tree. 2marks
Question No.22
How we can avoid the problem of Dangling reference 2marks
Question No.25
What is the post order and level order of given model 5marks
Question No:1 ( Marks: 1 ) - Please choose one
Which one of the following calling methods does not change the original value of the argument in the calling function?
º None of the given options
º Call by passing the value of the argument
º Call by passing reference of the argument
º Call by passing the address of the argument
Question No: 3 ( Marks: 1 ) - Please choose one
AVL Tree is,
º Non Linear data structure
º Linear data structure
º Hybrid data structure (tahseen743@yahoo.com)
º None of the given options
Question No: 6 ( Marks: 1 ) - Please choose one
“--” is a _________operator.
º Unary
º Binary
º Ternary
º None of the above
Question No: 10 ( Marks: 1 ) - Please choose one
_________ is a binary tree where every node has a value, every node's left sub tree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater then or equal?
ºStrictly Binary Tree
ºBinary Search tree
ºAVL tree
ºAll of these
Question No: 12 ( Marks: 1 ) - Please choose one
Queue follows,
► Last in First out
► First in Last out
► First in First out
► None of these
| Question No: 4 | ( Marks: 1 ) - Please choose one |
A tree is an AVL tree if
► Any one node fulfills the AVL condition
► At least half of the nodes fulfill the AVL condition
► All the nodes fulfill the AVL condition
► None of the given options
Question No: 8 ( Marks: 1 ) - Please choose one
We can add elements in QUEUE From _________
► Front
► Rear
► From Both Rare and Front
► None of these
Posts
No comments:
Post a Comment