CS101 532 CS201 225 CS301 232 CS302 174 CS304 192 CS401 224 CS402 258 CS403 228 CS408 113 CS411 121 CS502 249 CS504 268 CS601 679 CS604 381 CS605 261 CS607 184 CS609 230 CS610 300 CS614 100 CS703 65
Code Question Option A Option B Option C Option D Answer
CS301 If You Know The Size Of The Data Structure In Advance I.E. At Compile Time Which One Of The Following Is A Good Data Structure To Use Array List Both Of These None Of These C
CS301 In A Min Heap Preculatedown Procedure Will Move Smaller Value And Bigger Value Left Right Right Left Up Down Down Up C
CS301 In A Perfectly Balanced Tree The Insertion Of A Node Needs __________ One Rotation Two Rotations Rotations Equal To Number Of Levels No Rotation At All A
CS301 In A Program A Reference Variable Say X Can Be Declared As Int &X ; Int *X ; Int X ; None Of The Given Options A
CS301 In A Selection Sort Of N Elements How Many Times The Swap Function Is Called To Complete The Execution Of The Algorithm? N-1 N Log N N2 1 A
CS301 In A Threaded Binary Tree Which Nodes Have Null Child Pointers All Leaf Nodes Nodes Other Then Leaf Nodes Root Node None Of The Nodes A
CS301 In An Array List The Current Element Is The First Element The Middle Element The Last Element The Element Where The Current Pointer Points To A
CS301 In An Array We Can Store Data Elements Of Different Types True False B
CS301 In An Avl Tree To Delete A Parent With Two Childs In A Straight Line Following Rotations Will Be Required Single Double Triple None B
CS301 In C What Is The Operation That You Can Not Do With Primitive Types? Assign A Value To Primitive Type Using A Literal Declare Primitive Types To Be Constant Using The Const Keyword Create A New Instance Of Primitive Type With New Keyword None Of These C
CS301 In Case Of Deleting A Node From Avl Tree Rotation Could Be Prolong To The Root Node Yes No A
CS301 In Complete Binary Tree The Bottom Level Is Filled From __________ Left To Right Right To Left Not Filled At All None Of The Given Options A
CS301 In Sequential Access Data Structure Accessing Any Element In The Data Structure Takes Different Amount Of Time. Tell Which One Of The Following Is Sequential Access Data Structure Arrays Lists Both Of These None Of These B
CS301 In The Call By Value Methodology A Copy Of The Object Is Passed To The Called Function True False A
CS301 In The Linked List Implementation Of The Stack Class Where Does The Push Member Function Places The New Entry On The Linked List? At The Head At The Tail After All Other Entries That Are Greater Than The New Entry After All Other Entries That Are Smaller Than The New Entry A
CS301 In The Worst Case Of Deletion In Avl Tree Requires ___________ Only One Rotation Rotation At Each Non-Leaf Node Rotation At Each Leaf Node Rotations Equal To Log2 N D
CS301 In Threaded Binary Tree The Null Pointers Are Replaced By Preorder Successor Or Predecessor Inorder Successor Or Predecessor Postorder Successor Or Predecessor Null Pointers Are Not Replaced B
CS301 In Which Of The Following Tree Parent Nodes Has Key Greater Than Or Equal To Its Both Children? Max Heap Binary Search Tree Threaded Binary Tree Complete Binary Tree D
CS301 In Which Of The Traversal Method The Recursive Calls Can Be Used To Traverse A Binary Tree ? In Preorder Traversal Only In Inorder Traversal Only In Postorder Traversal Only All Of The Given Options A
CS301 In___________ We Try To Have A Precise Problem Statement Analysis Design Coding None Of The Given A