[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

# Searching & Sorting Questions

NA
SHSTTON
253
Solv. Corr.
242
Solv. In. Corr.
495
Attempted
0 M:21 S
Avg. Time

1 / 69

A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is

AQuick Sort

BHeap Sort

CMerge Sort

DInsert Sort

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
471
Solv. Corr.
225
Solv. In. Corr.
696
Attempted
0 M:14 S
Avg. Time

2 / 69

Which is true for binary search ?

BTraversal scheme

CGreedy algorithm

Dnone of these

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
315
Solv. Corr.
312
Solv. In. Corr.
627
Attempted
0 M:21 S
Avg. Time

3 / 69

What data structures you should use for dictionary searching and it should be capable of doing spell check also?

ATree

BArray

CQueue

DHashing

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
198
Solv. Corr.
589
Solv. In. Corr.
787
Attempted
0 M:27 S
Avg. Time

4 / 69

Selection sort and quicksort both fall into the same category of sorting algorithms. What is this category?

AO(n log n) sorts

BDivide-and-conquer sorts

CInterchange sorts

Explanation:

Selection sort is not O(n log n) and not a Divide-conquer sort too and Average time of quicksort is not quadratic.

Workspace

NA
SHSTTON
990
Solv. Corr.
479
Solv. In. Corr.
1469
Attempted
0 M:14 S
Avg. Time

5 / 69

Choose the correct option.

Which of the following algorithmic paradigm is used in the merge sort?

BBackTracking

CGreedy method

DDivide and Conquer

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
655
Solv. Corr.
546
Solv. In. Corr.
1201
Attempted
0 M:15 S
Avg. Time

6 / 69

Choose the correct option.

What is the worst case performance of Selection sort algorithm?

AO(log n)

BO(n* n)

CO(n)

DO(n log n)

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
289
Solv. Corr.
660
Solv. In. Corr.
949
Attempted
0 M:20 S
Avg. Time

7 / 69

Choose the correct option.

Let P be a quick sort program to sort numbers in ascending order using the first element as the pivot. Let t1 and t2 be the number of comparisons made by P for the input [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

At1 = 5

Bt1 < t2

Ct1 > t2

Dt1 = t2

Explanation:

When first element or last element is chosen as pivot, Quick Sort's worst case occurs for the sorted arrays.

In every step of quick sort, numbers are divided as per the following recurrence.

T(n) = T(n-1) + O(n)

Workspace

NA
SHSTTON
435
Solv. Corr.
431
Solv. In. Corr.
866
Attempted
1 M:15 S
Avg. Time

8 / 69

Which one of the following statements about the function Process Array is CORRECT?
Consider the C function given below. Assume the array listA contains (n>0) elements, sorted in ascending order.

int Process array (int * list A, int x, int n)
{
int i, j, k;
i =0;j=n-1;
do {
k = (i+j)/2;
if (x<=list A[k])
j=k-1;
if (list A[k] <=x)
i =k+1;
} while (i <=j);
if (list A[k] == x)
return (k);
else
return -1;
}

AIt will run into an infinite loop when x is not in listA

BIt is an implementation of binary search.

CIt will always find the maximum element in listA.

DIt will return -1 even when x is present in listA.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
330
Solv. Corr.
477
Solv. In. Corr.
807
Attempted
0 M:0 S
Avg. Time

9 / 69

Choose the correct option.

What sorting algos have their best and worst case times equal ?

Aheap and selection sort

Binsersition sort & merge sort

Cmerge sort and heap sort

DNone of these

Explanation:

O(nlogn) for mergesort and heap sort

Workspace

NA
SHSTTON
554
Solv. Corr.
161
Solv. In. Corr.
715
Attempted
0 M:3 S
Avg. Time

10 / 69

Choose the correct option.

What data structures you should use for dictionary searching and it should be capable of doing spell check also ?

Aarray

BHashing

DTree

Explanation:

Here is no explanation for this answer

Workspace

## Data Structures Searching & Sorting Questions and Answers pdf

At Data Structures topic Searching & Sorting, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Searching & Sorting, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Searching & Sorting MCQs practice question, and one after solving all the question of the respective level, you can refer back your Searching & Sorting quiz result any time or you can download it as pdf for reference.

## Data Structures Searching & Sorting Customize Online Mock Test

This is own type of mock test, where At this Data Structures Searching & Sorting MCQs mock test section, you will able to attempt only the questions related to Searching & Sorting, in that question will be a different level, important, and all the questions will be part of some of the mock tests across Q4interview FREE Mock test. You need to choose the topic as Searching & Sorting, and click on Double click to generate your customize mock test. While attempting the mock test you need to choose any of the one options out of given option. It is recommended to go through the direction given along with each question, as these questions will be randomly and so that same direction will not be applicable across the entire test. Once you submit your mock test, the result will be generated for Searching & Sorting Customize mock test, where your performance point points will be highlighted. Q4interview analysis every single point which helps you to improve your topic understanding and help you to know your type of mistakes and way to improve Searching & Sorting questions, by providing the same type of practice questions from practice exercise. The best part of this Searching & Sorting, all these mock tests listed here are free and you can take as Many time, as many you want. When you continue to give Searching & Sorting Customize Online Mock Test here regularly, then you will understand how much you have developed your accuracy on a topic, after that you will be able to decide how much attention you need to focus on. Your continued practice will increase your confidence, speed and thinking ability intensely, the Searching & Sorting Customize topic on which you will practice more will beneficial for you in future during campus placement.

## Data Structures Searching & Sorting Quiz Online Test

The details of the Data Structures Searching & Sorting quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures Searching & Sorting that you see and keep them in mind while answering questions.

## Data Structures Searching & Sorting MCQs Practice Questions with Answer

On this Searching & Sorting section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Searching & Sorting Question Quickly. It contains all the Data Structures topic Searching & Sorting questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Searching & Sorting topic based quiz.

## Data Structures Searching & Sorting solved examples question

Clarity of concepts is a must if you want to master the skill of solving Data Structures problems. This page contains sample Data Structures Searching & Sorting questions and answers for freshers and competitive exams. Searching & Sorting Questions with the detailed description, the explanation will help you to master the topic. Here solved examples with detailed answer description, explanations are given and it would be easy to understand. How to solve qSearching & SortingData Structures? Here are some examples solved with the Common Rules/tricks/tips of Data Structures. Enhance your chance to score maximum marks in Data Structures sections through. Error Spotting Grammar Questions Online Test for Free. Fully solved Sentence Formation MCQs questions with detailed answer description. Data Structures is an important topic for any exams but most aspirants find it difficult. You need to learn various tricks tips, rules, etc to solve quickly. At this page, you will find frequently asked Searching & Sorting questions or problems with solutions, shortcuts, formulas for all-important competitive exams like IT companies exams, interviews. It is always a best practice to go through the example and understand the types of question and way to solve it, so let's do some examples to calculate efficiency, read through all the given here solved examples. You can post your solution, tips, trick and shortcut if you have any in respect to questions.

You can get here fully solved Searching & Sorting examples with a detailed answer and description. You can solve Searching & Sorting problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Searching & Sorting. Searching & Sorting became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Searching & Sorting Examples, Searching & Sorting sample questions. You can Evaluate your level of preparation in Searching & Sorting by Taking the Q4Interivew Searching & Sorting Online Mock Test based on most important questions. All the Searching & Sorting practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

## Why Data Structures Searching & Sorting?

In this practice section, you can practice Data Structures Questions based on "Searching & Sorting" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

## Where can I get Data Structures Searching & Sorting questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Searching & Sorting) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Searching & Sorting quiz questions with answers as PDF files and eBooks.

## Where can I get Data Structures Searching & Sorting Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Searching & Sorting questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.