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
CS502 The Main Elements To A Divide-And-Conquer Solution Are Divide: The Problem Into A Small Number Of Pieces Conquer: Solve Each Piece By Applying Divide And Conquer To It Recursively Combine: The Pieces Together Into A Global Solution All Of The Above D
CS502 The Mathematical Tools Necessary For The Analysis Of Algorithms. This Will Focus On Asymptotics Summations Recurrences True False Na Na A
CS502 The Merge Sort Algorithm Works By __________ Divide: Split A Down The Middle Into Two Subsequences Each Of Size Roughly N/2 Conquer: Sort Each Subsequence By Calling Merge Sort Recursively On Each Combine: Merge The Two Sorted Subsequences Into A Single Sorted List All Of The Above D
CS502 The Minimum Is Of Rank And The Maximum Is Of Rank . 0 1 0 N 1 N None C
CS502 The Number Of Nodes In A Complete Binary Tree Of Height H Is 2^(H+1) – 1 2 * (H+1) – 1 2 * (H+1) ((H+1) ^ 2) – 1 A
CS502 The Problem With The Brute-Force Algorithm Is That It Uses __________ In Pruning Out Decisions Intelligence No Intelligence Na Na B
CS502 The Rank Of An Element Is Its Final Position If The Set Is Sorted__________ True False Na Na A
CS502 The Reason For Introducing Sieve Technique Algorithm Is That It Illustrates A Very Important Special Case Of Divide-And-Conquer Decrease And Conquer Greedy Nature 2-Dimension Maxima A
CS502 The Recurrence Relation Of Tower Of Hanoi Is Given Below ? 1 If N =1 T N =? -133( ) 2 (T N- +1) 1If N>1 A
CS502 The Recurrence Relation Of Tower Of Hanoi Is Given Below T(N)={1 If N=1 And 2T(N-1) If N >1 In Order To Move A Tower Of 5 Rings From One Peg To Another How Many Ring Moves Are Required? 10 16 31 32 D
CS502 The Relationship Between Number Of Back Edges And Number Of Cycles In Dfs Is Both Are Equal Back Edges Are Half Of Cycles Back Edges Are One Quarter Of Cycles There Is No Relationship Between No. Of Edges And Cycles D
CS502 The Root Is At Position 1 Of The Array True False Na Na A
CS502 The Running Time Of Quick Sort Depends Heavily On The Selection Of No Of Inputs Arrangement Of Elements In Array Size O Elements Pivot Element D
CS502 The Runtime Of Entire Plane-Sweep Algorithm Is O(N Log N) True False Na Na A
CS502 The Sieve Technique Is A Special Case Where The Number Of Sub Problems Is Just 1 5 Few Many A
CS502 The Sieve Technique Is A Special Case Where The Number Of Subproblems Is 3 2 Just 1 0 C
CS502 The Sieve Technique Works In __________ As Follows Phases Numbers Integers Routines A
CS502 The Term “Coloring” Came Form The Original Application Which Was In Architectural Design True False Na Na A
CS502 The Term Coloring Came Form The Original Application Which Was In Map Drawing True False Na Na A
CS502 The Word Algorithm Comes From The Name Of The Muslim Author __________ Ibne-Ul Hasem Abu Ja’Far Mohammad Ibn Musa Al- Khowarizmi Jaber Bin Hayan None B