Started on Tuesday, 11 July 2023, 11:32 PM State Finished Completed on Tuesday, 11 July 2023, 1:60 PM Time taken 17 ming 10 sees Grade 26.00 out of 30.00 (86.67%) ueston 1 Which of the folowing algorithms are used to ind the shortest path from a source nade to al other nodes in a weighted graph? ‘Adjostin Matrix and List, euskal Algorithm rims Algorithm Djiksta's Algorthmy poe Your answer is correct. The correct answers: Dikstra's Algorithm useton2 What ie hash table? Asucture thal maps keys to values Astucture used fer storage A siucture used fo implement stack and q ‘Astucture thal maps values to keys pope Your answer is correct. The correct answers: A structure that maps keys to valuesuseton 3 Which ofthe flowing isthe advantage ofthe array data structure? Elements ofan array cannot be sorted Easier to access the elements in an array Index ofthe first element stats from 1 Elements of mixes datatypes can be stored pope Your answer is correct. The correct answer Is: Easier to access the elements In an aray usctond What is diect addressing? Distinct array position for every possible key Fewer aay postions than keys Fewer keys than aray positions ‘Same array positon forall keys pepe Your answer ie correc. ‘The correct answer ls: Distinct array position for every possible key ueston 5 Which of the folowing is the disadvantage of the array? ‘Stack and Queue data structures can be implamented through an array. Index ofthe first element in an array can be negative Elements can be accessed sequentially. SOB > \Wastage of memory ifthe elements inserted in an array are lesser than the allocated size Your answer ie correc ‘The correct answer ls: Wastage of memory if the elements inserted in an array are lesser than the allocated sizeuseton \Which one of the folowing isthe process of inserting an slementin the stack? push¥ acd cenqueve insert pope Your answer is correc The correct answers: push ueeton 7 When the user ries to delete the. sent from the empty Stack then the condition is said to be a delete NULL empty undertow goer Your answer ie correc. The correct anewor i: underow useton 8 Ifthe size ofthe stack fs 10 and we ty fo add the 111 elementin the stack then the condition is known as__ overtonY undertow Grabage collection segementation faut ener Your answer ie correct. ‘The correct answer's: overtowuseton 9 Which one ofthe folowing isnot the application of the stack data structure Asynchronous data transfor Backtracking Recursion pope String reversal Your answer is correc. The correct answer is: Asynchronous dala transfer ueston 10 \Which data structure is mainly used for implementing the recursive algorithm? Queue Linked List ‘StackY Tree powe ‘Your answer is correct. ‘The correct answers: Stack uncton 11 How can we describe an arayin the best possiole way? ‘The Array shows a hierarchical struct ‘rays are immutable Container that stores the elements of similar ype ‘The Array isnot a data structure pepe ‘Your answer is correct. ‘The correct answers: Container that store sents of similar typesuseton 12 \Which one ofthe folowing node is considered the top of the stack if the stack is implemented using the linked list? A. First node 8. inbetween node ©. lastnode D. First and Last node Your answer is correc. The correct answer iF ueston 13 \What is another name forthe circular queue among the folowing options? ‘square butfor list hhead-tall ist Ring butterY head ist gee Your answer ie correc. The correct anewor i: Ring bufer useton 14 Ast of elements in which enqueue operation takes place ftom one end, and dequeue operation takes place from one end is__ Queue Troe Stack ‘ray Your answer is correc. ‘The correct answer is: Queueuneton 15 Which one of the folowing isnot the type of the Queue? Linesr Queue Double ended Queue Circular Queue Single ended QueueY pom > Your answer's corect. ‘The correct answer's: Single ended Queue vncton 16 Which one of the folowing isthe overiow condition if near queue is implomented using an array with a size MAX_SIZE? pope Your answer is correct. ‘The correct answers: rear=MAX SIZE -1 unston 17 Which one ofthe folowing isthe overiow conxition if circular queUE is implemented using array having size MAX? front MAX rear MAX-1% front=(rear+) mod max po we rear=(reart) mod max. Your answer is incorrect, ‘The correct answer ls: ront=(-earet) mod maxuneton 18 ‘The lime complexiy af enqueue operation in Queue is. A OF B. offonn) ©. O(nog) D. on Your answer is correc. The correct answers: O(1) ueston 19 Which of the folowing that determines the need for the Circular Queue? ‘Access the Queue using priority Follows the FIFO principle Follows the LIFO principle ‘Avoid wastage of memory Pee > Your answer ie correc. ‘The correct answer is: Avoid wastage of memory ueston 20 Which one of the folowing isthe correct way to increment the rear end in a crcular queue? (rear % max) +4 tar = font (rear) % max po @> rear rear Your answer is incorrect. ‘The correct answer's: (rear % max) + 1useton 21 Inthe linked ist implementation of queue, where wil he new slement be inserted? A. Athe mide poston of the linked list 8. tthe had or til poston of he linked lst C. pethe ti poston of the linked list . asthe head positon ofthe linked list Your answer's corect. ‘The correct answer's: A the tal position ofthe inked list vncton 22 How can we intalize an array in C language? int ant2}=(10, 20} int ant2I=(10, 205.4 A 8 c o. intamr(2) = (10, 20), Your answer is correct. ‘The correct answers: int ati2]=(10, 20); vneton 23 Which one ofthe folowing is not the application of the Queue data structure? Load balancing Data is transferred asynchronously Resource shared between various systems Balancing of symbols¥ Your answer is correct. ‘The correct answers: Balancing of symbolsuseton 24 Which data structure isthe best for implementing a pry queue? A Heapy 5 Stack ©. Code Section D. Dala Sections Your answer is correct. ‘The correct answers: H uecton 25 \Which of the folowing soring algorithms can be used to sort a random linked Iist with minimum time complexity? Heap Sort Inerton Sort ‘Qulek Sort Merge Son poe Your answer ie correct. ‘The correct answers: Merge Sort ueston 26 Which one ofthe folowing techniques isnot used in the Binary tree? A. Postorder traversal B. Inordor traversal ©. Preorder traversal D. Randomized traversal¥ Your answer is correc. ‘The correct answer ls: Randomized traversaluscton 27 How can we define a AVL tree? A tree with utmost three children Aree which s a binary search tree but unbalanced tree, Atte which s binary search tree and height balanced tree. ¥ Ate@e with utmost two children Your answer's corect. ‘The correct answers: A fee which 's binary search free and height balanced tree, vneton 28 \Which of he following is a Divide and Conguer algorithm? A. Quick sort Bubble sort C. Insert sort o. Morge sort Your answer is correct. ‘The correct answers: Merge sort vncton 29 \Which of the folowing represents the Postorder Traversal ofa Binary Tree? Left-> Root > Right Left Right > Root Root > Left >Right® Root > Right > Left Your answor Is incorrect ‘The correct answers: Left Right -> Rootveston 30 Ih a graph of n nodes and n edges, how many cycles willbe present? Exactly N Depends on nodes Exactly 1 Depends on the graph * pa er Your answer is incorrect, ‘The correct answer ls: Exactly 1