Preparing for Excellence...
Master your MCA entrance preparation with over 17 years of solved PYQs from NIMCET, CUET PG, and top universities. Get detailed step-by-step solutions and expert insights—all 100% free.
Don't just practice questions—simulate the real exam. Browse our interactive Full Year-wise Question Papers to build your speed and accuracy.
Browse Full Papers →Jump directly into topic-wise PYQs with exam details — marks, time, and negative marking.
Prim’s algorithm is a/an
Quicksort is a
Which of the following standard algorithms is not a greedy algorithm?
Arrange the following in the increasing order of their asymptotic complexities.
(A) Insertion sort (best case) (B) Bubble sort (worst case)
(C) Binary search (worst case) (D) Merge sort (worst case)
Arrange the following time complexities in increasing order.
(A) Bubble sort (worst case)
(B) Deleting head node in singly linked list
(C) Binary search
(D) Worst case of merge sort
Choose the correct answer from the options given below:
Yes. We continuously update question tags and solutions to reflect the latest pattern and syllabus.
All listed questions include detailed step-by-step solutions, and many also include short video explanations.
Use the filters for exam and subject, and the search box for topics, keywords, or formula names.
No, Mathem Solvex Offers you everything for free, you do not need to pay anything for question bank You will get NIMCET and CUET PYQ and all the information for free.