AMU MCA Data Structures Previous Year Questions (PYQs) – Page 3 of 3
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 28 questions
You want to check whether a given set of items is sorted or not. Which sorting method will be most efficient if it is already sorted?
1
2
3
4
Solution
Insertion sort runs in O(n) for already sorted data.
What is the meaning of ‘Underflow’ in the context of data structure?
1
2
3
4
Solution
Underflow occurs when deletion is attempted on an empty data structure.
The average time complexity of quick sort algorithm is:
1
2
3
4
Solution
In average case, quick sort divides the array efficiently, giving $O(n \log n)$ time.
The data structure needed to convert infix notations to postfix notations is:
1
2
3
4
Solution
Stack is used to temporarily hold operators during infix to postfix conversion.
Which sorting method is best if number of swapping is only measure of efficiency?
1
2
3
4
Solution
Selection sort performs minimum swaps (n−1 swaps).
Maximum number of comparisons needed to sort 7 items using radix sort (each item 4-digit decimal):
1
2
3
4
Solution
Radix sort does not compare elements like comparison sort.
Comparisons are not primary operation.
Approx operations = digits × items
= 4 × 7 = 28
A graph in which all nodes are of equal degree is called
1
2
3
4
Solution
If every vertex has the same degree, it is called a regular graph.
To sort many large objects or structures, it is most efficient to place
1
2
3
4
Solution
Sorting pointers avoids copying large objects.
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
AMU MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
