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 Which One Of The Following Operators Has Higher Priority Than All Of Others? Multiplication Operator Minus Operator Plus Operator Exponentiation Operator A
CS301 Which Of The Following Statement Is Correct? A Threaded Binary Tree Is A Binary Tree In Which Every Node That Does Not Have A Left Child Has A Thread (In Actual Sense A Link) To Its Inorder Successor A Threaded Binary Tree Is A Binary Tree In Which Every Node That Does Not Have A Right Child Has A Thread (In Actual Sense A Link) To Its Preoredr Successor A Threaded Binary Tree Is A Binary Tree In Which Every Node That Does Not Have A Right Child Has A Thread (In Actual Sense A Link) To Its Inorder Successor A Threaded Binary Tree Is A Binary Tree In Which Every Node That Does Not Have A Right Child Has A Thread (In Actual Sense A Link) To Its Postorder Successor C
CS301 3 + 5 * 6 - 7 * (8 + 5) Which Of The Following Is A Correct Equivalent Expression(S) For The Above? 3 6 5 + * 7 5 8 + - * 3 6 5 7 5 8 + * + - * 3 5 6 + * 7 8 5 + - * 3 5 6 * + 7 8 5 + * - D
CS301 Use Of Binary Tree In Compression Of Data Is Known As Traversal Heap Union Huffman Encoding D
CS301 If We Want To Find Median Of 50 Elements Then After Applying Buildheap Method How Many Times Deletemin Method Will Be Called ? 5 25 35 50 B
CS301 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 B
CS301 When Should You Use A Const Reference Parameter? Whenever The Parameter Has Huge Size Whenever The Parameter Has Huge Size The Function Changes The Parameter Within Its Body And You Do Not Want These Changes To Alter The Actual Argument Whenever The Parameter Has Huge Size The Function Changes The Parameter Within Its Body And You Do Want These Changes To Alter The Actual Argument Whenever The Parameter Has Huge Size And The Function Does Not Change The Parameter Within Its Body B
CS301 What Requirement Is Placed On An Array So That Binary Search May Be Used To Locate An Entry? The Array Elements Must Form A Heap The Array Must Have At Least 2 Entries The Array Must Be Sorted The Array"S Size Must Be A Power Of Two C
CS301 Which Of The Following Method Is Helpful In Creating The Heap At Once? Insert Add Update Preculatedown D
CS301 Which One Of The Following Is Not The Property Of Equivalence Relation Reflexive Symmetric Transitive Associative D
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 Consider The Following Infix Expression. 5 + 6/2 If One Converts The Above Expression Into Postfix What Would Be The Resultant Expression? 56/ + 2 5 6 2 / + 5 6 / 2 + /62 + 5 B
CS301 Suppose You Implement A Min Heap (With The Smallest Element On Top) In An Array. Consider The Different Arrays Below; Determine The One That Cannot Possibly Be A Heap: 16 18 20 22 24 28 30 16 20 18 24 22 30 28 16 24 18 28 30 20 22 16 24 20 30 28 18 22 D
CS301 The Operation For Adding An Entry To A Stack Is Traditionally Called Add Append Insert Push D
CS301 In The Call By Value Methodology A Copy Of The Object Is Passed To The Called Function True False A
CS301 A Queue Is A Data Structure Where Elements Are Inserted At The Front And Removed From The Back Inserted And Removed From The Top Inserted At The Back And Removed From The Front Inserted And Removed From Both Ends A
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 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 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 If There Are N External Nodes Is A Binary Tree Then What Will Be The No. Of The Internal Nodes In This Binary Tree? N-1 N N+1 N+2 C