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

Data Structures and Algorithms MCQ - Sorting and Searching

31 L:et m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

Let m>n. Let m/n yield a quotient x and remainder y. So, m= n*x+y and y<m div 3 is the quotient when m is divided by 3. So, that many times p is added, before we terminate recursion by satisfying the end condition Q (m,n) = 0 if m<n. Hence the result.

32 Sorting is useful for

33 Choose the correct statements

34 A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

35 The way a card game player arranges his cards as he picks them up one by one, is an example of

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.