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 Queue Follows Last In First Out First In Last Out First In First Out None Of These C
CS301 Which Of The Following Statement Is Not Correct About Find Operation: It Is Not A Requirement That A Find Operation Returns Any Specific Name Just That Finds On Two Elements Return The Same Answer If And Only If They Are In The Same Set One Idea Might Be To Use A Tree To Represent Each Set Since Each Element In A Tree Has The Same Root Thus The Root Can Be Used To Name The Set Initially Each Set Contains One Element Initially Each Set Contains One Element And It Does Not Make Sense To Make A Tree Of One Node Only B
CS301 Which One Is A Self-Referential Data Type? Stack Queue Link List All Of These C
CS301 A Binary Tree Of N Nodes Has Log10 N Levels Log2 N Levels N / 2 Levels N X 2 Levels B
CS301 The Data Of The Problem Is Of 2Gb And The Hard Disk Is Of 1Gb Capacity To Solve This Problem We Should Use Better Data Structures Increase The Hard Disk Space Use The Better Algorithm Use As Much Data As We Can Store On The Hard Disk B
CS301 Merge Sort And Quick Sort Both Fall Into The Same Category Of Sorting Algorithms. What Is This Category? O(Nlogn) Sorts Interchange Sort Average Time Is Quadratic None Of The Given Options D
CS301 If There Are 56 Internal Nodes In A Binary Tree Then How Many External Nodes This Binary Tree Will Have? 54 55 56 57 D
CS301 Next Item In A Linked List Is Known As Index Item Node Child C
CS301 Consider A Binary Tree Represented By The Following Array: A B C D E F G H I J K L Is It A Strictly Binary Tree? Yes No B
CS301 When An Array Of Object Is Created Dynamically Then There Is No Way To Provide Parameterized Constructors For Array Of Objects True False A
CS301 ___________ Is A Data Structure That Can Grow Easily Dynamically At Run Time Without Having To Copy Existing Elements Array () List Both Of These None Of These C
CS301 Consider A Min Heap Represented By The Following Array: 10 30 20 70 40 50 80 60 After Inserting A Node With Value 31.Which Of The Following Is The Updated Min Heap? 10 30 20 31 40 50 80 60 70 10 30 20 70 40 50 80 60 31 10 31 20 30 40 50 80 60 31 31 10 30 20 70 40 50 80 60 A