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 | 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 | What Will Be Postfix Expression Of The Following Infix Expression? Infix Expression : A+B*C-D | Ab+C*D- | Abc*+D- | Abc+*D- | Abcd+*- | B | |
CS301 | When A Complete Binary Tree Represented By An Array Then For Any Array Element At Position I The Parent Is At Position | 2I-1 | 2I | 2I+1 | Floor(I/2) | D | |
CS301 | When A Complete Binary Tree Represented By An Array Then If Right Child Is At Position 5 Then Left Child Will Be At Position | 2 | 3 | 4 | 6 | C | |
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 | When An Operator Is Used In Between Two Operands This Is Which Type Of Notation | Prefix | Postfix | Infix | None Of The Above | C | |
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 | When We Have Declared The Size Of The Array It Is Not Possible To Increase Or Decrease It During The __________Of The Program | Declaration | Execution | Defining | None Of The Abov | B | |
CS301 | Which Formula Is The Best Approximation For The Depth Of A Heap With N Nodes? | Log (Base 2) Of N | The Number Of Digits In N (Base 10) E.G. 145 Has Three Digits | The Square Root Of N | N | A | |
CS301 | Which Of The Following Abstract Data Types Are Not Used By Integer Abstract Data Type Group? | Short | Int | Float | Long | C | |
CS301 | Which Of The Following Can Be The Inclusion Criteria For Pixels In Image Segmentation | Pixel Intensity | Texture | Threshold Of Intensity | All Of The Given Options | D | |
CS301 | Which Of The Following Can Be Used To Reverse A String Value | Stack | Queue | Both Of These | None Of These | A | |
CS301 | Which Of The Following Concept Is Not Associated With Stream? | Source | Template | Destination | State | B | |
CS301 | Which Of The Following Heap Method Increase The Value Of Key At Position „P" By The Amount „Delta"? | Increasekey(P Delta) | Decreasekey(P Delta) | Preculatedown(P Delta) | Remove(P Delta) | A | |
CS301 | Which Of The Following Is A Non Linear Data Structure? | Linked List | Stack | Queue | Tree | D | |
CS301 | Which Of The Following Is A Property Of Binary Tree? | A Binary Tree Of N External Nodes Has N Internal Node | A Binary Tree Of N Internal Nodes Has N+ 1 External Node | A Binary Tree Of N External Nodes Has N+ 1 Internal Node | A Binary Tree Of N Internal Nodes Has N- 1 External Node | B | |
CS301 | Which Of The Following Is Not A Correct Statement About Table Adt | In A Table The Type Of Information In Columns May Be Different | A Table Consists Of Several Columns Known As Entities | The Row Of A Table Is Called A Record | A Major Use Of Table Is In Databases Where We Build And Use Tables For Keeping Information | B | |
CS301 | Which Of The Following Is Not True Regarding The Maze Generation? | Randomly Remove Walls Until The Entrance And Exit Cells Are In The Same Set | Removing A Wall Is The Same As Doing A Union Operation | Remove A Randomly Chosen Wall If The Cells It Separates Are Already In The Same Set | Do Not Remove A Randomly Chosen Wall If The Cells It Separates Are Already In The Same Set | C | |
CS301 | Which Of The Following Is True About Arrays | We Can Increase The Size Of Arrays After Their Creation | We Can Decrease The Size Of Arrays After Their Creation | We Can Increase But Cant Decrease The Size Of Arrays After Their Creation | We Can Neither Increase Nor Decrease The Array Size After Their Creation | D | |
CS301 | Which Of The Following Method Is Helpful In Creating The Heap At Once? | Insert | Add | Update | Preculatedown | D |