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 Linear List Where ________ And ________ Take Place At The Same End . This End Is Called The ________ What Would Be The Correct Filling The Above Blank Positions? (I) Queue (Ii) Insertion (Iii) Removals (Iv) Top (I) Stack (Ii) Insertion (Iii) Removals (Iv) Bottom (I) Stack (Ii) Insertion (Iii) Removals (Iv) Top (I) Tree (Ii) Insertion (Iii) Removals (Iv) Top C
CS301 __________ Is The Maximum Number Of Nodes That You Can Have On A Stack-Linked List ? Zero 2N (Where N Is The Number Of Nodes In Linked List) Any Number None Of These C
CS301 __________ Only Removes Items In Reverse Order As They Were Entered Stack Queue Both Of These None Of These A
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 C
CS301 “+” Is A ___________Operator Unary Binary Ternary None Of The Above B
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 A Binary Relation R Over S Is Called An Equivalence Relation If It Has Following Property(S) Reflexivity Symmetry Transitivity All Of The Given Options D
CS301 A Binary Search Tree Should Have Minimum Of One __________ Node/S At Each Level 1 2 3 4 B
CS301 A Binary Tree Of N Nodes Has Log10 N Levels Log2 N Levels N / 2 Levels N X 2 Levels B
CS301 A Binary Tree With 24 Internal Nodes Has External Nodes 22 23 25 48 C
CS301 A Binary Tree With 33 Internal Nodes Has Links To Internal Nodes 31 32 33 66 B
CS301 A Binary Tree With 45 Internal Nodes Has ___________ Links To External Nodes 44 45 46 90 C
CS301 A Binary Tree With N Internal Nodes Has Links Links To Internal Nodes And __________ Links To External Nodes N+1 2N N-1 N+1 N-1 2N 2N N-1 N+1 N-1 2N N+1 C
CS301 A Complete Binary Tree Is A Tree That Is ___________ Filled With The Possible Exception Of The Bottom Level Partially Completely Incompletely Partly B
CS301 A Complete Binary Tree Of Height 3 Has Between __________ Nodes 8 To 14 8 To 15 8 To 16 8 To 17 B
CS301 A Complete Binary Tree Of Height Has Nodes Between 16 To 31 2 3 4 5 C
CS301 A Compound Data Structure Is The Data Structure Which Can Have Multiple Data Items Of Same Type Or Of Different Types. Which Of The Following Can Be Considered Compound Data Structure? Arrays Linklists Binary Search Trees All Of The Given Options D
CS301 A Kind Of Expressions Where The Operator Is Present Between Two Operands Called __________Expressions Postfix Infix Prefix None Of The Above B
CS301 A Linear Data Structure Is The Data Structure In Which Data Elements Are Arranged In A Sequence Or A Linear List. Which Of The Following Is Non Linear Data Structure? Arrays Linklists Binary Search Trees None Of These C