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 Is A Binary Tree Where Every Node Has A Value Every Nodes Left Subtree Contains Only Values Less Than Or Equal To The Nodes Value And Every Nodes Right Subtree Contains Only Values That Are Greater Then Or Equal ? Strictly Binary Tree Binary Search Tree Avl Tree All Of These B
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 B
CS301 Is The Stack Characteristic But Was Implemented Because Of The Size Limitation Of The Array Isfull() Isempty() Pop() Push() Isempty() Isfull() Push() Pop() C
CS301 It Is Necessary Fro Huffman Encoding Tree To Be Avl Tree Binary Tree Complete Binary Tree None Of These B
CS301 It Will Be Efficient To Place Stack Elements At The Start Of The List Because Insertion And Removal Take Time Variable Constant Inconsistent None Of The Above B
CS301 Let Heap Stored In An Array As H = [50 40 37 32 28 22 36 13]. In Other Words The Root Of The Heap Contains The Maximum Element. What Is The Result Of Deleting 40 From This Heap [50 32 37 13 28 22 36] [37 28 32 22 36 13] [37 36 32 28 13 22] [37 32 36 13 28 22] A
CS301 Linked Lists Are Collections Of Data Items Lined Up In A Row Insertions And Deletions Can Be Made Only At The Front And The Back Of A Linked List True False 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 Mergesort Makes Two Recursive Calls. Which Statement Is True After These Recursive Calls Finish But Before The Merge Step? Elements In The First Half Of The Array Are Less Than Or Equal To Elements In The Second Half Of The Array None Of The Given Options The Array Elements Form A Heap Elements In The Second Half Of The Array Are Less Than Or Equal To Elements In The First Half Of The Array D
CS301 Next Item In A Linked List Is Known As Index Item Node Child C
CS301 Non Recursive Calls Are Faster Than The Recursive Calls True False A
CS301 Parameters In Function Call Are Passed Using Stack Queue Binary Search Tree Avl Tree A
CS301 Queue Follows Last In First Out First In Last Out First In First Out None Of These C
CS301 Reference Is Not Really An Address It Is __________ A Synonym An Antonym A Value A Number A
CS301 Searching An Element In An Avl Tree Take Maximum Time (Where N Is No. Of Nodes In Avl Tree) 1.44 Log2N 1.66 Log2N Log2(N+1) Log2(N+1) -1 A
CS301 See The Below Code And Fill The Appropriate Answer For? Void Fastlnorder(Treenod+P) {While((P+Nextinorder(P)) !+ ? ) Cout << P->Getinfo();} Dummy Rootnode Lth Rth A
CS301 Select The One False Statement About Binary Trees Every Binary Tree Has At Least One Node Every Non-Empty Tree Has Exactly One Root Node Every Node Has At Most Two Children Every Non-Root Node Has Exactly One Parent A
CS301 Suppose A Is An Array Containing Numbers In Increasing Order But Some Numbers Occur More Than Once When Using A Binary Search For A Value The Binary Search Always Finds __________ The First Occurrence Of A Value The Second Occurrence Of A Value May Find First Or Second Occurrence Of A Value None Of The Given Options A
CS301 Suppose A Pointer Has Been Declared In Main But Has Not Assigned Any Variable Address Then That Pointer Points To First Byte In Main Function That Pointer Contains A Null Value None Of These That Pointer Points To Any Memory Address D
CS301 Suppose Currentnode Refers To A Node In A Linked List (Using The Node Class With Member Variables Called Data And Nextnode). What Boolean Expression Will Be True When Cursor Refers To The Tail Node Of The List? (Currentnode == Null) (Currentnode->Nextnode == Null) (Nextnode.Data == Null) (Currentnode.Data == 0.0) A