NIMCET_Intermediate_Clean_Questions
NIMCET_Intermediate_Clean_Questions
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
Q5. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. Silent
B. None of these
C. Aggressive
D. Fluent
NIMCET Practice Questions - MCQ Format
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 10
B. None of these
C. 15
D. 25
A. 10
B. None of these
C. 15
D. 25
Q14. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
Q15. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
Q16. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 0.35
B. None of these
C. 0.38
D. 0.375
Q18. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
C. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
NIMCET Practice Questions - MCQ Format
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
C. None of these
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
NIMCET Practice Questions - MCQ Format
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
C. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
A. 0.35
B. None of these
C. 0.38
D. 0.375
Q30. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. Silent
B. None of these
C. Aggressive
D. Fluent
Q35. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
A. 10
B. None of these
C. 15
D. 25
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 0.35
B. None of these
C. 0.38
D. 0.375
C. None of these
A. 10
B. None of these
C. 15
D. 25
NIMCET Practice Questions - MCQ Format
C. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
Q43. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 0.35
B. None of these
C. 0.38
D. 0.375
Q45. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 10
B. None of these
C. 15
D. 25
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
NIMCET Practice Questions - MCQ Format
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. 10
B. None of these
C. 15
D. 25
Q55. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. 10
B. None of these
C. 15
D. 25
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
NIMCET Practice Questions - MCQ Format
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. 0.35
B. None of these
C. 0.38
D. 0.375
Q65. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
Q66. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. 10
B. None of these
C. 15
D. 25
NIMCET Practice Questions - MCQ Format
C. None of these
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
Q73. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
C. None of these
Q75. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. Silent
B. None of these
C. Aggressive
D. Fluent
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
C. None of these
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
Q83. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 10
B. None of these
C. 15
D. 25
Q85. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
C. None of these
Q87. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. 0.35
B. None of these
C. 0.38
D. 0.375
NIMCET Practice Questions - MCQ Format
Q91. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
Q93. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
NIMCET Practice Questions - MCQ Format
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. 2x^2 + 3x + C
B. x^2 + 3 + C
C. None of these
D. x^2 + 3x + C
A. Silent
B. None of these
C. Aggressive
D. Fluent
NIMCET Practice Questions - MCQ Format
C. None of these
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
Q103. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
Q104. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 10
B. None of these
C. 15
D. 25
NIMCET Practice Questions - MCQ Format
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. WHERE
B. None of these
C. GROUP BY
D. ORDER BY
C. None of these
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
Q110. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
NIMCET Practice Questions - MCQ Format
A. 10
B. None of these
C. 15
D. 25
Q112. Which OSI layer is responsible for error detection and correction?
A. Network Layer
B. None of these
C. Transport Layer
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. 0.35
B. None of these
C. 0.38
D. 0.375
A. None of these
B. Selection Sort
C. Merge Sort
D. Bubble Sort
NIMCET Practice Questions - MCQ Format
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
Q117. In a binary search tree, what is the average-case time complexity of search?
A. O(n log n)
B. O(n)
C. O(log n)
D. All of these
A. 3x - 5
B. 3x^2 - 5
C. x^2 - 5
D. None of these
A. 10
B. None of these
C. 15
D. 25
C. None of these