[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.

Complexity Questions

NA
SHSTTON
272
Solv. Corr.
173
Solv. In. Corr.
445
Attempted
1 M:23 S
Avg. Time

11 / 48

Choose the correct option.

The complexity of Bubble sort algorithm is


AO(n)

BO(log n)

CO(n2)

DO(n log n)

Answer: Option C

Explanation:

O(n) is the best case complexity
where as
O(n2) is worst and average case

Workspace

NA
SHSTTON
106
Solv. Corr.
338
Solv. In. Corr.
444
Attempted
0 M:22 S
Avg. Time

12 / 48

Choose the correct option.

The complexity of the average case of an algorithm is


AMuch more complicated to analyze than that of worst case

BMuch more simpler to analyze than that of worst case

CSometimes more complicated and some other times simpler than that of worst case

DNone or above

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
199
Solv. Corr.
243
Solv. In. Corr.
442
Attempted
0 M:13 S
Avg. Time

13 / 48

Choose the correct option.

The time factor when determining the efficiency of algorithm is measured by


ACounting microseconds

BCounting the number of key operations

CCounting the number of statements

DCounting the kilobytes of algorithm

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
257
Solv. Corr.
159
Solv. In. Corr.
416
Attempted
0 M:0 S
Avg. Time

14 / 48

Choose the correct option.

The space factor when determining the efficiency of algorithm is measured by


ACounting the maximum memory needed by the algorithm

BCounting the minimum memory needed by the algorithm

CCounting the average memory needed by the algorithm

DCounting the maximum disk space needed by the algorithm

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
151
Solv. Corr.
159
Solv. In. Corr.
310
Attempted
0 M:0 S
Avg. Time

15 / 48

Choose the correct option.

What is the search complexity in direct addressing?


AO(n)

BO(logn)

CO(nlogn)

DO(1)

Answer: Option D

Explanation:

Since every key has a unique array position, searching takes a constant time.

Workspace

NA
SHSTTON
120
Solv. Corr.
165
Solv. In. Corr.
285
Attempted
0 M:0 S
Avg. Time

16 / 48

Choose the correct option.

In simple uniform hashing, what is the search complexity?


AO(n)

BO(logn)

CO(nlogn)

DO(1)

Answer: Option D

Explanation:

There are two cases, once when the search is successful and when it is unsuccessful, but in both the cases, the complexity is O(1+alpha) where 1 is to compute the hash function and alpha is the load factor.

Workspace

NA
SHSTTON
125
Solv. Corr.
151
Solv. In. Corr.
276
Attempted
0 M:0 S
Avg. Time

17 / 48

Choose the correct option.

What is the worst case search time of a hashing using separate chaining algorithm?


AO(N log N)

BO(N)

CO(N2)

DO(N3)

Answer: Option B

Explanation:

The worst case search time of separate chaining algorithm using linked lists is mathematically found to be O(N).

Workspace

NA
SHSTTON
143
Solv. Corr.
235
Solv. In. Corr.
378
Attempted
0 M:0 S
Avg. Time

18 / 48

Choose the correct option.

What is the time complexity of insert function in a hash table using a doubly linked list?


AO(1)

BO(n)

CO(log n)

DO(n log n)

Answer: Option A

Explanation:

Time complexity of insert function in a hash table is O(1). Condition is that the number of collisions should be low.

Workspace

NA
SHSTTON
134
Solv. Corr.
126
Solv. In. Corr.
260
Attempted
0 M:0 S
Avg. Time

19 / 48

Choose the correct option.

What is the time complexity of the delete function in the hash table using a binary tree?


AO(1)

BO(n)

CO(log n)

DO(n log n)

Answer: Option A

Explanation:

Time complexity of delete function in a hash table is O(1). Condition is that the hash function should be such that the number of collisions should be low.

Workspace

NA
SHSTTON
194
Solv. Corr.
59
Solv. In. Corr.
253
Attempted
0 M:0 S
Avg. Time

20 / 48

Choose the correct option.

What is the time complexity of insert function in a hash table using list head?


AO(1)

BO(n)

CO(log n)

DO(n log n)

Answer: Option A

Explanation:

Time complexity of insert function in a hash table is O(1). Condition is that the number of collisions should be low.

Workspace

Data Structures Complexity Questions and Answers pdf

At Data Structures topic Complexity page No: 2 you will find list of 10 practice questions, tips/trick and shortcut to solve questions, solved questions, quiz, and download option to download the whole question along with solution as pdf format for offline practice. You can practice all the listed Data Structures Complexity topic questions offline too, by downloading the MCQs practice question of Complexity with detail solution, with formula/Tips & Tricks, with Solved examples and with top-rated users answers, which will give you best answer ascross webs. It is one of the perfect Complexity e-book pdf covering all types of questions in detail. These Data Structures test with answers pdf cover all types of question asked in IIFT, XAT, SNAP, GRE, GMAT, NMAT, CMAT, MAT or for IT companies written exam like Wipro, HCL, Infosys, Accenture, Government exams, IBPS Exams etc. There are multiple formats to download your online free Data Structures Complexity e-book, like fully solved, unsolved questions with Answers sheet. Even you can customize your ebook format by adjusting the given options in the download section to make it your one of the best Data Structures topic-based ebook. It is recommended to bookmark this page Data Structures Complexity for your preparation. Most of the students and fresher candidates finding it hard to clear the Data Structures section in exams. Here Given Complexity practice questions, quiz, fully solved questions, tips & trick and Mock tests, which include question from each topic will help you to excel in Complexity. Each test has all the basics questions to advanced questions with answer and explanation for your clear understanding, you can download the test result as pdf for further reference.

At Data Structures topic Complexity, 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 Complexity, 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 Complexity MCQs practice question, and one after solving all the question of the respective level, you can refer back your Complexity quiz result any time or you can download it as pdf for reference.

Data Structures Complexity Customize Online Mock Test

This is own type of mock test, where At this Data Structures Complexity MCQs mock test section, you will able to attempt only the questions related to Complexity, 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 Complexity, 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 Complexity 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 Complexity questions, by providing the same type of practice questions from practice exercise. The best part of this Complexity, all these mock tests listed here are free and you can take as Many time, as many you want. When you continue to give Complexity 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 Complexity Customize topic on which you will practice more will beneficial for you in future during campus placement.Complexity Mock Tests

Data Structures Complexity Quiz Online Test

The details of the Data Structures Complexity 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 Complexity that you see and keep them in mind while answering questions.

Data Structures Complexity MCQs Practice Questions with Answer

On this Complexity 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 Complexity Question Quickly. It contains all the Data Structures topic Complexity 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 Complexity topic based quiz.

Data Structures Complexity 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 Complexity questions and answers for freshers and competitive exams. Complexity 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 qComplexityData 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 Complexity 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 Complexity examples with a detailed answer and description. You can solve Complexity 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 Complexity. Complexity became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Complexity Examples, Complexity sample questions. You can Evaluate your level of preparation in Complexity by Taking the Q4Interivew Complexity Online Mock Test based on most important questions. All the Complexity 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 Complexity?

In this practice section, you can practice Data Structures Questions based on "Complexity" 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 Complexity questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Complexity) 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 Complexity quiz questions with answers as PDF files and eBooks.

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

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