MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Multiple requests search data simultaneously on a web server, even the fast server fails while searching the data.
A
True
B
False
C
All of the above
D
None of the above
Explanation: 

Detailed explanation-1: -As data grows, search will become slower. One of the three common problems that applications face now-a-days. Processor speed although being very high, falls limited if the data grows to billion records.

Detailed explanation-2: -Searching in data structures refers to finding a given element in the array of ‘n’ elements. There are two categories, viz. Sequential search and interval search in searching. Almost all searching algorithms are based on one of these two categories.

Detailed explanation-3: -3. DEFINITENESS : Each instruction is clear and unambiguous. algorithm terminates after a finite number of steps.

Detailed explanation-4: -Explanation: There are three cases which are usually used to compare various data structure’s execution time in a relative manner : Worst Case, Average Case and Best Case.

There is 1 question to complete.
Previous
Next