Unit 5 - Week 4: Sorting and Searching Algorithms

27/07/2020 Programming, Data structures and Algorithms using C - - Unit 5 - Week 4: Sorting and Searching Algorithms

Courses » Programming, Data structures and Algorithms using C

Announcements Course Ask a Question Progress Unit 5 - Week 4: Sorting and Searching Algorithms

Course outline Quiz 4 The due date for submitting this assignment has passed. Due on 2018-03-07, 23:59 IST. Assignment0 As per our records you have not submitted this assignment.

Week 1: Basic 1) Which one of the following can be termed as worst case for linear search? 1 point Programming Constructs Element to be searched is present somewhere in the middle of the array. Element to be searched is present at 0th index of the array. Week 2: Arrays, Element to be searched is present at the last index of the array. Pointers and Strings Element to be searched is present at the last index of the array or Element to be searched is not present in the array. Week 3: Functions, Time complexity No, the answer is incorrect. Score: 0 Week 4: Sorting Accepted Answers: and Searching Element to be searched is present at the last index of the array or Element to be searche Algorithms is not present in the array. Algorithms and Powering 2) Which of the following is correct in context of Binary Search? 1 point Polynomial evaluation and multiplication Input data needs to be sorted in Binary Search. Linear and Binary Search doesn't access the data elements in a sequential order. Binary Search In Binary Search, search is carried out in either half of the given input list. Analysis All of the above. Analysis of minimum and No, the answer is incorrect. maximum in an Score: 0 array Accepted Answers: Sorting I: All of the above. Insertion, Merge 3) In the mergesort algorithm, what is the running time of the merge operation? 1 point Sorting II: Counting, Radix O(log n) Finding i-th O(n) smallest O(n log n) number O(n^2) Programming Assignment 4.1: No, the answer is incorrect. Array Sum Score: 0 Programming Accepted Answers: Assignment 4.2: O(n) Dot Product 4) Which of the following sorting algorithm uses divide and conquer? 1 point https://onlinecourses-archive.nptel.ac.in/noc18_cs25/unit?unit=53&assessment=59 1/3 27/07/2020 Programming, Data structures and Algorithms using C - - Unit 5 - Week 4: Sorting and Searching Algorithms

Programming Merge Sort Assignment 4.3: Insertion Sort Special Number Radix Sort Programming None of the above Assignment 4.4 : Rearranging No, the answer is incorrect. the Baskets Score: 0 Quiz : Quiz 4 Accepted Answers: Quiz 4 Merge Sort Solutions 5) What is the running time of Insertion Sort? 1 point Week 4 Feedback O(n2)

Week 5: O(n log n) Structures, O (n2+ log n) Dynamic Memory O(n2 logn) Allocation and ADTs No, the answer is incorrect. Score: 0 Week 6: Stacks, Queues, Heaps, Accepted Answers: Trees and O(n2) Graphs 6) Which among the following sorting algorithm uses auxiliary storage to sort 1 point Week 7: Greedy input data elements? Algorithms and DynamicProgramming Insertion Sort Counting Sort Week 8 : Hash Tables & Graph Radix Sort Algorithms None of the above

Week 9 : Graph No, the answer is incorrect. Traversal, Score: 0 Articulation Accepted Answers: Points, File I/O,Modular Counting Sort programming 7) the minimum number of comparisons required to find the maximum and 1 point minimum in an array of 100 elements are ____ Help and FAQ 198 Interactive session with 150 students 148 199 No, the answer is incorrect. Score: 0 Accepted Answers: 148

8) Let the numbers 794, 332, 561, 342, 200, 607, and 893 be sorted using radix 1 point sort. What will be the sixth number in the sequence of numbers after sorting the second digit?

893 794 332 561

No, the answer is incorrect. Score: 0 Accepted Answers: 893

https://onlinecourses-archive.nptel.ac.in/noc18_cs25/unit?unit=53&assessment=59 2/3 27/07/2020 Programming, Data structures and Algorithms using C - - Unit 5 - Week 4: Sorting and Searching Algorithms 9) Which of the following is the correct recurrence relation related to the 1 point complexity of Binary Search?

T(n)=T(n/2)+O(n) T(n)=T(n/2)+1 T(n)=2T(n/2)+O(n) T(n)=2T(n/2)+1

No, the answer is incorrect. Score: 0 Accepted Answers: T(n)=T(n/2)+1

10)Which of the following sorting algorithms has a running time of O(nlogn)? 1 point

Merge Sort Insertion Sort Counting Sort None of the above

No, the answer is incorrect. Score: 0 Accepted Answers: Merge Sort

Previous Page End

Funded by

https://onlinecourses-archive.nptel.ac.in/noc18_cs25/unit?unit=53&assessment=59 3/3