Time complexity, BST, AVL, shortest path, ER diagrams, 3NF/BCNF, relational algebra, semaphore, paging, virtual memory, and page replacement. In the Nepal Engineering Council (NEC) licensure examination, exactly 10 questions carrying 1 mark each are set from this section with zero negative marking.
10 Marks
10% of total exam10 MCQs
1 Mark each12 Mins
72 sec / questionNone (0)
Answer all questionsAll study materials, past question papers, and solutions hosted directly for download:
First-In First-Out (FIFO) page replacement suffers from Belady’s anomaly, where increasing page frames can increase page faults.
The worst-case time complexity of QuickSort is O(n²), which occurs when the chosen pivot is always the smallest or largest element.