Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
  • CUET PG MCA
    Previous Year Questions

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Data Structures PYQ

Consider implementation of database. Among the following options, choose the most appropriate data structure for this





Go to Discussion

Solution

Each node is having a successor node in ________________:





Go to Discussion

Solution

Consider a completely skewed (left / right) binary search tree with n elements. What is the worst case time complexity of searching an element in this tree?





Go to Discussion

Solution

If we want to find last node of a singly linked list then the correct coding is





Go to Discussion

Solution

Arrange the following in the increasing order of their asympotic complexities:
(A) Insertion sort (best case)  
(B) Bubble sort (worst case) 
(C) Binary Search (worst case)
(D) Merge sort (worst case)





Go to Discussion

Solution

The following integers are needed to be stored in ascending order using bubble sort.
5, 8, 22, 18, 1
Following are the results of various passes during the sorting process.





Go to Discussion

Solution

What are the ways to implement a priority Queue?
(A) Arrays 
(B) Fibonacci tree 
(C) Heap Data Structure 
(D) Linked list

Choose the correct answer from the options given below:





Go to Discussion

Solution

Ways to Implement a Priority Queue

The correct answer is:

(A) Arrays, (C) Heap Data Structure, and (D) Linked List

Explanation:

  • Arrays:
    • Unsorted Array: Insertion is O(1), Deletion is O(n).
    • Sorted Array: Insertion is O(n), Deletion is O(1).
  • Heap Data Structure:
    • Binary heaps are commonly used for efficient implementation.
    • Insertion and Deletion take O(log n) time.
  • Linked List:
    • Can be implemented as sorted or unsorted.
    • Efficiency depends on the choice of implementation.

Why not Fibonacci Tree?

Fibonacci trees are not used directly for priority queues. However, Fibonacci heaps (a separate data structure) can implement priority queues efficiently.

Match List – I with List – II
 List - I (Algorithms) List - II (Complexity)
 (A) Bellman - Ford algorithm (with adjacencylist representation)  (I) O(|V|2)
(B) Dijkstra Algorithm   (II) O((V+E) logV)
(C) Prim’s Algorithm  (III) O(mn)
(D) Topological sorting (with adjacency list representation)  (IV) O(m+n)
Choose the correct answer from the options given below:





Go to Discussion

Solution

Which of the following is not an applicaiton of Stack?





Go to Discussion

Solution

Consider the following tree. This is a / a _________________





Go to Discussion

Solution


CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.