# Wells Fargo Searching and Sorting Problems with Solutions Quiz-1

Question 1

Time: 00:00:00
In breadth-first search, which of the following options is true?

Beginning from a node, first all its adjacent nodes are traversed.

Beginning from a node, first all its adjacent nodes are traversed.

Beginning from a node, each adjacent node is fully explored before traversing the next adjacent node

Beginning from a node, each adjacent node is fully explored before traversing the next adjacent node

Beginning from a node, nodes are traversed in cyclical order

Beginning from a node, nodes are traversed in cyclical order

None of these

None of these

Once you attempt the question then PrepInsta explanation will be displayed.

Question 2

Time: 00:00:00
Consider the given list of sorting algorithms-
1) Selection Sort
3) Shell Sort
4) Heap Sort
Which of the above-mentioned algorithms uses the selection method for bringing out the sorting?

Selection Sort

Selection Sort

Shell Sort

Shell Sort

Heap Sort

Heap Sort

Once you attempt the question then PrepInsta explanation will be displayed.

Question 3

Time: 00:00:00
Srujan writes a sorting algorithm, The algorithm takes different amount of time to sort two different lists of equal size. What Is the possible difference between the two lists?

All numbers in one list are more than 100. while in the other are less than 100

All numbers in one list are more than 100. while in the other are less than 100

The ordering of numbers with respect to the magnitude in the two list has different properties.

The ordering of numbers with respect to the magnitude in the two list has different properties.

One list has all negative the numbers, while the other has all positive numbers

One list has all negative the numbers, while the other has all positive numbers

One list contains 0 as an element, while the other does not

One list contains 0 as an element, while the other does not

Once you attempt the question then PrepInsta explanation will be displayed.

Question 4

Time: 00:00:00
Akshit has a large list of fixed length numbers He needs to sort this list using an efficient technique .Which of the following techniques can he use?

Selection Sort

Selection Sort

Shell Sort

Shell Sort

Quick Sort

Quick Sort

Once you attempt the question then PrepInsta explanation will be displayed.

Question 5

Time: 00:00:00
Srishti writes a program to find an element in the array A[5] with the following elements in order: 8 30 40 45 70. She runs the program to find a number X. X is found in the first iteration of the binary search. What is the value of X?

40

40

8

8

70

70

30

30

Once you attempt the question then PrepInsta explanation will be displayed.

Question 6

Time: 00:00:00
Which sorting method is slowest

Quick sort

Quick sort

Heap sort

Heap sort

Shell sort

Shell sort

Bubble sort

Bubble sort

Once you attempt the question then PrepInsta explanation will be displayed.

Question 7

Time: 00:00:00
Which of the following options give the maximum number of comparisons that can take place in a Binary Search algorithm?

n

n

(n+1)/2

(n+1)/2

log(n) + 1

log(n) + 1

2*log(n)

2*log(n)

Once you attempt the question then PrepInsta explanation will be displayed.

Question 8

Time: 00:00:00
How is bubble sort algorithm different from modified bubble sort algorithm?

Former uses more spaces then the latter

Former uses more spaces then the latter

Former is comparatively easier to implement in terms of codes

Former is comparatively easier to implement in terms of codes

Former does not stop comparing once the array is sorted unlike the latter

Former does not stop comparing once the array is sorted unlike the latter

There is no difference between two

There is no difference between two

Once you attempt the question then PrepInsta explanation will be displayed.

Question 9

Time: 00:00:00
A sorting algorithm traverses through a list, comparing adjacent elements andswitching them under certain conditions. What is this sorting algorithm called?

insertion sort

insertion sort

heap sort

heap sort

quick sort

quick sort

bubble sort

bubble sort

Once you attempt the question then PrepInsta explanation will be displayed.

Question 10

Time: 00:00:00
The time complexity of linear search algorithm over an array of n elements is

Op 2:

Op 3:

Op 4:

O (log2 n)

O (log2 n)

O (n)

O (n)

O (n log2 n )

O (n log2 n )

O (n2)

O (n2)

Once you attempt the question then PrepInsta explanation will be displayed.

["0","40","60","80","100"]
["Need more practice! \r\n \r\n","Keep trying! \r\n \r\n","Not bad! \r\n \r\n","Good work! \r\n \r\n","Perfect! \r\n \r\n"]

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Get over 200+ Courses under One Subscription

Don’t settle Learn from the Best with PrepInsta Prime Subscription

Learn from Top 1%

## One Subscription, For Everything

The new cool way of learning and upskilling -

Limitless Learning

One Subscription access everything

Job Assurance