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 The Operation For Removing An Entry From A Stack Is Traditionally Called Delete Peek Pop Remove C
CS301 The Total Number Of Nodes On 10Th Level Of A Perfect Binary Tree Are 256 512 1024 Cant Be Determined D
CS301 The Tree Data Structure Is A Linear Data Structure Non-Linear Data Structure Graphical Data Structure Data Structure Like Queue B
CS301 There Is/Are __________ Case/S For Rotation In An Avl Tree 1 2 3 4 D
CS301 To Get The Memory Address Of A Variable We Use & % * $ A
CS301 Tree Data Structure Is A Linear Non Linear Circular None Of Above B
CS301 Union Is A Time Operation Constant Polynomial Exponential None Of The Given Options A
CS301 Use Of Binary Tree In Compression Of Data Is Known As Traversal Heap Union Huffman Encoding D
CS301 Void F(Int I Int &K) {I = 1;K = 2; } Suppose That A Main Program Has Two Integer Variables X And Y Which Are Given The Value 0. Then The Main Program Calls F(X Y); What Are The Values Of X And Y ? Both X And Y Are Still 0 X Is Now 1 But Y Is Still 0 X Is Still 0 But Y Is Now 2 X Is Now 1 And Y Is Now 2 C
CS301 Void Test_A(Int N) { Cout << N << ; If (N>0) Test_A(N-2); } What Is Printed By The Call Test_A(4)? 4 2 0 0 2 4 0 2 2 4 A
CS301 We Access Elements In Avl Tree In Linear Way Only Non Linear Way Only Both Linear And Non Linear Ways None Of The Given Options B
CS301 We Are Given N Items To Build A Heap This Can Be Done With Successive Inserts N-1 N N+1 N^2 B
CS301 We Can Add Elements In Queue From ___________ Front Rear From Both Rare And Front None Of These B
CS301 We Can Build A Heap In __________ Time Linear Exponential Polynomial None Of The Given Options A
CS301 We Convert The __________ Pointers Of Binary To Threads In Threaded Binary Tree Left Right Null None Of The Given Options C
CS301 We Have A Circular Array Implementation Of The Queue Class With Ten Items In The Queue Stored At Data[2] Through Data[11]. The Capacity Is 42 I.E. The Array Has Been Declared To Be Of Size 42. Where Does The Push Member Function Place The New Entry Data[1] Data[2] Data[11] Data[12] D
CS301 We Implement The Heap By __________ Threaded Tree Avl Tree Complete Binary Tree Expression C
CS301 What Is The Best Definition Of A Collision In A Hash Table? Two Entries Are Identical Except For Their Keys Two Entries With Different Data Have The Exact Same Key Two Entries With Different Keys Have The Same Exact Hash Value Two Entries With The Exact Same Key Have Different Hash Values C
CS301 What Is The Maximum Depth Of Recursive Calls A Function May Make? 1 2 N (Where N Is The Argument) There Is No Fixed Maximum D
CS301 What Kind Of List Is Best To Answer Questions Such As What Is The Item At Position N? Lists Implemented With An Array Doubly-Linked Lists Singly-Linked Lists Doubly-Linked Or Singly-Linked Lists Are Equally Best A