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.
Arrange the following steps of K-map simplification in correct order.
(A) Write minimized SOP / POS expression
(B) Plot truth table outputs ( $ 0 $ 's and $ 1 $ 's) on K-map
(C) Identify prime implicants and essential prime implicants
(D) Draw groups (loops) of adjacent $ 1 $ 's or $ 0 $ 's that are powers of $ 2 $ .
Which of the following is not an application of stack.
Cooperating process required an interprocess communication mechanism. This work on which of the following fundamental model. (A) Shared Memory (B) Cascading termination (C) Message passing (D) Cooperating
Length or number of data element of Array can be obtained from index set by which of the following formulae.
Which of the following are combinational circuit? A. Half adder B. SR flip flop C. Full adder D. D flip flop
Complement of $ \overline{A + B} $
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 |
Arrange the following steps of retrieving data from memory unit.
(A) Memory Address Register send address to memory chip
(B) The address is placed on address bus
(C) The control unit sends signal
(D) Data is retrieved and place into the Memory Data Register
Assertion: Binary search tree property allow to print all keys in binary search tree in sorted order by simple recursive algorithm called inorder tree walk.
Reason: The inorder tree walk algorithm print the key root of subtree between printing value in its left subtree and printing those in its right subtree.
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.