Preparing for Excellence...
We have recently migrated this portal from React JS to Next.js, and the setup is currently under migration. If you are experiencing any technical issues (e.g., while giving mock tests), please use the old portal: https://mathemsolvex.vercel.app/
If you have suggestions or want to help with the process, please contact the developer via LinkedIn: Vivek Kumar or WhatsApp: +91 9354368207. We are working hard to help you out. Best of luck!
— Vivek Kumar
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.
Which of the following is not an application of stack.
Which algorithm have same order of complexity? A. Deletion from Queue B. Worst case search in binary search tree C. Insertion in stack D. Quick sort worst case
Matching:
| $ (A) $ | Minimum Spanning Tree | $ I. $ | Height balanced |
| $ (B) $ | Topological Sort | $ II. $ | Stack |
| $ (C) $ | Recursion | $ III. $ | Kruskal's algorithm |
| $ (D) $ | AVL Tree | $ IV. $ | DFS |
In $ \_\_\_\_\_\_ $ search we begin search at starting node and when we come across dead end then we back track.
Matching
| Column A | Column B | ||
| A. | BFS | I. | Shortest Path |
| B. | Sparse graph | II. | Adjacency list representation |
| C. | Collision Resolution | III. | Open Addressing |
| D. | Linked list | IV. | Self Referential structure |
Which of the following is correct
(A) in directed graph sum of length of all adjancy list is $ |E| $
(B) the adjancy matrix requires $ O(V^2) $ memory
(C) In an undirected graph the sum of length of all adjancy list is $ |E| $
(D) the memory requirement of adjacency list is depending on number of edge in graph
Which of the following data structures in a linear type?
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.