Avatto > UGC NET COMPUTER SCIENCE > PRACTICE QUESTIONS > Data Structures and Algorithms > Sorting and Searching

Data Structures and Algorithms MCQ - Sorting and Searching

11 A search begins the search with the element that is located in the middle of the array

12 To sort many large object or structures, it would be most efficient to

Dynamic structure (Memory Allocated at run-time).
We can have more than one data type.
Re-arrange of linked list is easy (Insertion-Deletion).
It doesn’t waste memory.

So, the answer is 'B'

13 A matrix "a" is called lower triangular if and only if for all j > ai j = 0. If such a matrix is to be sorted in a one-dimensional array, A then ai j could be mapped to which of the following index of A ?

14 Average successful search time for sequential search on 'n' items is

If search key matches the very first item, with one comparison we can terminate. If it is second, two comparisons, etc. Average =[ n (n + 1) ] / 2

15 The average search time of hashing, with linear probing, will be less if the load factor

The load factor is the ratio of the number of records that are currently present and the total number of records that can be present. If the load factor is less, free space will be more. This means the probability of collision is less. So, the search time will be less.

Your Progress

0%

Start Practising!

You've answered 0 of 44 questions in this topic.

Practice Spotlight

Build momentum in Sorting and Searching

Start with a short question set, review every explanation, and revisit difficult questions before moving ahead.

Day 4 / 10

Global Spotlight

Build Your First Streak

Complete one short Sorting and Searching session today, then return tomorrow. Consistency matters more than a long first session.

Day 7 / 10

Question Spotlight

Question:

The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

A. (n + 1)/2
B. log2n
C. n(n + 1)/2
D. n2

Correct answer: A

Click to view the complete question details

Day 4 / 10 Open this question

Community Insight

Based on 44 saved attempts

Most Attempted TopicTrees
Most Challenging TopicAdvanced Algorithm
Average Accuracy84%

Featured Question

(Based on recent community answers)

Q. #168490% Incorrect

For a linear search in an array of n elements the time complexity for the…

Try This Question →

This Week's Challenge

Complete 20 questions and set the community benchmark!

0 / 20 Start Challenge →

Why Practice with Avatto?

High Quality MCQsExam-focused questions with accurate answers

Detailed ExplanationsStep-by-step explanations to enhance learning

Latest Exam PatternBased on updated syllabus and pattern

Performance AnalyticsTrack performance and improve weak areas

100% Free PracticePractice unlimited questions for free

Forgot your password?

I agree with the Terms.