Chandigarh University has decided to conduct an entrance cum scholarship test named as Chandigarh University Common Entrance Test (CUCET) for admission to various programs so as to provide an opportunity to bright and inquisitive young minds from across the country to study in most challenging and diverse academic environment.

CUET Sample Papers Aspirants who wish to take the CUET 2023 exam can practise the CUET 2023 sample papers to understand the exam format. Candidates will get a better understanding of the CUET syllabus and exam pattern through the CUET 2023 sample papers. The CUET sample papers contain MCQs based on cases, assertions, reasons, statements, and arguments/conclusions, and they cover various domains.

## CUCET ME-Civil Sample Paper

1. Choose the right option, which is an application of splay trees?

• send values
• networks
• cache Implementation

2. Select the need for splay trees,when we have red-black trees and AVL trees that can perform most of operations in logarithmic times?

• no there is no special usage
• In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available
• redblack and avl are not upto mark
• they are just another type of self balancing binary search trees

3. Choose the right option for splay trees?

• self adjusting binary search trees
• a tree with strings
• a tree with probability distributions

4. Choose out of the following, what is not a disadvantage to the usage of array?

• Fixed size
• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
• Insertion based on position
• Accessing elements at specified positions

5. Mention the time complexity to count the number of elements in the linked list?

• O(1)
• O(n)
• O(logn)
• O(n2)

6. Select, which of these is not an application of linked list?

•  To implement file systems
• For separate chaining in hash-tables
• To implement non-binary trees
• Random Access of elements

• Components are all linked together in some sequential manner.
• There is no beginning and no end.
• Components are arranged hierarchically.
• Forward and backward traversal within the list is permitted.

8. Which of the following case does not exist in Algorithm complexity theory?

• Best case
• Worst case
• Average case
• NULL Case

9. Mention the case,which is covered by Big – O notation ?

• Best case
• Worst case
• Average case
• Amortized worst-case

10. Select, Asymtotic notation takes care for best case ?

• Big-O
• Theta
• Omega
• Big-Theta