Are you struggling to find 50 MCQ for Sikkim Manipal University, Gangtok? If so, you are in the right place! This article will provide a detailed overview of the available resources and materials to help you prepare for your upcoming exams.
In this article, we will discuss the different options available to obtain 50 MCQs specific to Sikkim Manipal University, Gangtok.
50 MCQ for Sikkim Manipal University, Gangtok
1. Finite set of instructions is called ___
a. Relation
b. Function
c. Algorithm*
d. Flowchart
Ans: c
2. The word algorithm belongs to which author ___
a. English
b. Parisian*
c. British
d. None
Ans: b
3. The expression of an algorithm is called ___
a. Flowchart
b. Algorithm
c. Program*
d. None
Ans: c
4. The field of study is ___
a. Analysis*
b. Design
c. Implementation
d. Testing
Ans. a
5. The algorithm is executed by ___
a. DMA
b, CPU
c. MU
d. None
Ans.
6. Process of executing is ___
a. Process
b. Profile
c. Debugging*
d. Performance
Ans. c
7. Measuring the time of execution ___
a. Profiling*
b. Process
c. Debug
d. None
Ans. a
8. The size (or) number of inputs & outputs ___
a. Size
b. Space*
c. Time
d. None
Ans. b
10. Time complexity is denoted by
a. T (p)*
b. T(q)
c. T (t)
d. T (r)
Ans. a
11. The sum of compile time and execution time is ___
a. P*
b. Q
c. R
d. None
Ans. a
12. The runtime is denoted by
a. t c
b. t r
c. t p*
d. None
Ans. c
13. Execution time also called as ___
a. Compile time
b. Run time*
c. Both
d. None
Ans. b
14. tp(n) =
a. Ca ADD (n) + Cs SUB (n) + Cm MUL (n) +Cd DIV (n) + ……….*
b. Ca ADD? (n) – Cs SUB (n) * Cm MUL (n) Cd DIV (n) + ………..
c. Both d. None
Ans. b
15. The instance character of ADD is denoted by
a. Ca *
b. Cs
c. Cm
d. Cd
Ans. a
16. Comment count as ___ step
a. 1
b. 2
c. 3
d. 0*
Ans. d
17. The statement does not involve any calls, takes ___ steps
a. 0
b. 1*
c. 2
d. Infinite
Ans. b
18. In laps we consider the steps
a. Initialize
b. control part*
c. Increment
d. None
Ans. b
19. How many methods for determine the no. of slips
a. 0
b. 1
c. 2*
d. 3
Ans. c
20. Steps for execution is denoted by ___
a. p/c
b. q/c
c. r/c
d. s/c*
Ans. d
21. Frequency of the for statement ___
a. n
b. n + 1*
c. n + 2
d. n + 3
Ans. b
22. Asymptotic complexity is denoted by ___
a. C
b. Ω
c. θ
d. All*
Ans. d
23. The function 3n + 2 is denoted by ___
a. O (n)*
b. O (n2)
c. O (n3)
d. None
Ans. a
24. The function 3n2 + 3n + 2 is denoted by ___
a. O (n)
b. O (n2)*
c. O (n3)
d. None
Ans. b
25. O (2n) is called ____
a. Linear
b. Quadratic
c. Cubic
d. Exponential*
Ans. d
26. f (n) = O (g(n)) where g( n) is ____
a. Lower bound
b. Upper bound*
c. Both
d. None
Ans. b
27. f (n) = Ω (g(n)) where g(n) is ___
a. Lower bound*
b. Upper bound
c. Both
d. None
Ans. a
28. f (n) = θ (g(n)) where g (n) is ___
a. Lower bound
b. Upper bound
c. Both *
d. None
Ans. c
29. Ordered list is called ___
a. stack
b. Queue
c. Both *
d. None
Ans. c
30. Stacks are sometimes referred to as
a. LIFO*
b. FIFO
c. Both
d. None
Ans. a
31. In stacks, the operation are made ___ end
a. Bottom
b. Top *
c. Both
d. None
Ans. b
32. In stacks, the insertion is called ___
a. PUSH*
b. POP
c. Both
d. None
Ans. a
33. If Top = n-1
a. Empty
b. No elements
c. Full *
d. Only one element
Ans. c
34. If Top = -1
a. Empty
b. No elements
c. Both a& b*
d. None
Ans. c
35. In queues, the insertion possible at
a. Front end
b. Rear*
c. Both
d. None
Ans. b
36. In queue, the deletion is possible at
a. Front end*
b. Rear
c. Both
d. None
Ans. a
37. In queue, the front end is initialized to ___
a. f = 0*
b. f = -1
c. f = n-1
d. None
Ans. a
38. In queue, the rear end is initialized to ____
a. r = 0
b. r = -1*
c. r = n -1
d. r = f
Ans. b
39. A finite set of one or more nodes ____
a. Stack
b. Queue
c. Linked list
d. Tree*
Ans. d
40. The maximum level of any node is ___
a. Length
b. Breadth
c. Height
d. a, c*
Ans. d
41. A function call itself is ___
a. Recursion*
b. Argument
c. Both
d. None
Ans. a
42. Heap is a ___
a. Tree
b. Binary Tree
c. complete binary tree*
d. Both b, c
Ans. c
43. In Heap Tree, the root nodes have always
a. Small value
b. +ve value
c. –ve value
d. Large value*
Ans. d
44. A data structure known as ___
a. Stack
b. Queue
c. Heap
d. Hashing*
Ans. d
45. Hashing is provide ___ searching
a. Slow
b. Fast*
c. Medium
d. None
Ans. b
46. Computational procedures ___
i. Defective
ii. Effective
iii. Infinite
iv. Finite
a. Only i
b. Only ii
c. Both I and ii *
d. All
Ans. c
47. Testing means ____
i. Debugging
ii. Profiling
iii. Performance
iv. Measure
a. Only I
b. Only ii
c. Both I and ii *
d. None
Ans. c
Conclusion:
Sikkim Manipal University, Gangtok is an excellent choice for those looking to pursue higher education. It offers quality courses with access to comprehensive resources and a vibrant learning environment.
Furthermore, the university’s dedicated placement cell helps students secure internships and jobs in top organisations.
Read more:
