Savitribai Public University Software Engineering MCQ | SPPU Software Engineering MCQ | Software Engineering

Software Engineering  MCQ

1. A mathematical Model with a collection of operation defined on that model is called.

1. data Structure 
2. Abstract Data Type
3. Primitive Data type
4. Algorithm

Answer : 2) Abstract Data type

 

2. In an ADT

1. Data are declared 
2. Operations are defined
3. Data and Operations are encapsulated
4.  All of the Above

Answer : 4)  All of the Above

 

3. A data structure is an aggregation of

1. Atomic Data                               
2. Composite Data
3. Atomic and Composite Data are encapsulated          
4. None

Answer : 3) Atomic and Composite Data are encapsulated.

 

4. ………….. is/are the linear data structures.

1.  Array                             
2. Linked list
3. String             
4. All of the above

Answer: 4) All of the Above

 

5. ……….. is a non-linear Data Structures.

1. Linked list  
2. Stack
3. Graph            
4. Queue

Answer: 3) Graph

 

6. Time complexity of a program refer to:

1. Complexity involved with the input time of a program
2. complexity involved in space mission and control
3. Amount of time a program needs to run for completion
4. None of the above

Answer : 3) Amount of time a program needs to run form completion.

 

7. Space complexity of an algorithm is the maximum amount of ………… required by it during execution.

1. Memory Space             
2. Operations
3. Time                               
4. None of the above

Answer : 1) Memory space

 

8. An algorithm that indicates the amount of temporary storage required for running the algorithm i.e., the amount of memory needed by the algorithm to run to completion is termed as

1.  Big Oh O(f)                
2. Big Omega(f)
3. Space complexity    
4. Time complexity

Answer : 3) Space complexity.

 

9. To verify whether a function grows faster or slower than the other function, we have some asymptotic or mathematical notations, which is/are……….

1. Big Omega(f)   
2. Big Oh(f)
3. Both (a) and (b)
4. None of these

Answer : 3) Both (a) and (b)

 

10. A function in which f(n) is Ω(g(n)), if there exist positive values k and c such that f(n)>=c*g(n), for all n>=k. This notation defines a lower bound for a function f(n).

1. Big oh O(f)                
2. Big Omega Ω(f)
3. Both(a) and (b)      
4. None of the above

Answer : 2) Big Omega Ω(f)

 

11. An algorithm that requires ………… operations to complete its task on n data elements is said to have a linear runtime.

1. 2n+1            
2. 3n³+3n+2
3. n3+9                
4. 10

Answer: 1) 2n+1

 

12. The complexity of adding two matrices of order m*n is

1. m+n               
2. mn
3. m²n²              
4. log(m+n)

Answer: 2) mn

 

13. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

1. X will always be a better choice for small inputs
2. X will always be a better choice for large inputs
3. y will always be a better choice for small inputs
4. x will always be a better choice for all inputs

Answer: 2) X will always a better choice for large inputs.

 

14. Which of the following data structure store the homogeneous data elements?

1. Array   
2. Records
3. Pointers     
4. None of the above

Answer: 1) Array

 

15. Arrays are best data structures……….

1. for relatively permanent Collections of data
2. The size of the structure and the data in the structure are constantly changing.
3. for both of above situation
4. None of the above situation.

Answer :  1) for relatively permanent collections of data

 

16. The memory address of the first element of an array is called…..

1. floor address 
2. foundation address
3. first address        
4. base address

Answer : 4) base address

 

17. The memory address of the fifth element of an array can be calculated by the formula…….

1. Loc(Array[5] = Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array.
2. Loc(Array[5]) = Loc(Array[5])+(5-lower bound), where w is the numbers words per memory cell for the array
3. Loc(Array[5]) = Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array.
4. None of the above.

Answer : 1) Loc(Array[5] = Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array.

 

18. Which of the following expression access the (I,j)th of  a m x n matrix stored in column major form?

1. n x (i-1) + j                 
2. m x (j-1)+1
3. m x (n-j) + j                 
4. n x (m-i) + j

Answer : 2) m x (j-1)+1

 

19. The smallest element of an array’s index is called its….

1. Lower bound             
2. Upper bound
3. Range                          
4. Extraction

Answer: 1) Lower bound.

 

20. Which of the following is also called as partition exchange sort?

1. Bubble            
2. Insertion
3. merge        
4. Quick

Answer: 4) Quick

 

21. What is an internal/in-place sorting algorithm?

1. Algorithm that user tape or disk during the sort.
2. Algorithm that user main memory during the sort.
3. Algorithm that involves swapping
4. Algorithm that are considered in place.

Answer : 2) Algorithm that user main memory during the sort

 

22. What is an external/out-place sorting algorithm?

1. Algorithm that user taps or disk during the sort.
2. Algorithm that users main memory during the sort.
3. Algorithm that involves swapping.
4. Algorithm that are considered in place.

Answer : 1) Algorithm that user taps or disk during the sort.

 

23. A sorting technique is called stable if it…………

1. Takes O(n log n) times
2. Maintains the relative order of occurrence of non-distinct elements
3. User divide-and-conquer paradigm
4. Takes O(n) space.

Answer : 2) Maintains the relative order of occurrences of non-distinct elements.

 

24. Which of the following is not stable sort?

1. Bubble Sort        
2. Insertion sort
3. Merge Sort         
4. Quick Sort

Answer :4) Quick Sort.

 

25. Which of the following is not an internal sorting algorithm?

1. Bubble sort    
2. Insertion sort.
3. Merge sort               
4. Quick sort.

Answer : 3) Merge sort.

26. The complexity of Bubble sort algorithm is ….

1. O(n)
2. b) O(log n)
3. c)  O(n2)                               
4. d) O(n log n)

Answer : 2) O(log n)

 

27. If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

1. Insertion sort     
2. Quick sort
3. Merge sort   
4. None of the above

Answer : 1) Insertion sort.

 

28. In a circularly linked list organization, insertion of a record involves the modification of

1. 0 pointer   
2. 1 pointer
3. 2 pointer                   
4. 3 pointers

Answer : 3) 2 pointer

 

29. The concatenation of two lists is to be performed in o (1) time. Which of the following  implementation of a list should be used?

1. singly linked list 
2. Doubly linked list
3. Circular doubly linked list   
4. Array implementation of list

Answer : 3) Circular doubly linked list.

 

30. Which of the following operations is performed more efficiently by doubly linked list then by linear liked list?

1. Deleting nodes whose location is given
2.  searching an unsorted list for a given item.
3. Inserting a node after the node with a given item.
4. Traversing the list to process each node.

Answer : 1) Deleting nodes whose location is given

 

31. Consider the linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

1. O(1) 
2. O(log2n)
3. O(n)               
4. O(n log2n)

Answer : 1) O(1)

 

32. …………. Is an ordered collection of data in which each element contains the location of the next element known as?

1. Array        
2. Record
3. linked list  
4. node

Answer : 3) linked list

 

33. What does an empty linked list consist?

1. a variable   
2. two nodes
3. data and a link      
4. a null head pointer

Answer : 4) a null head pointer

 

34. In the last node of the circular linked list the link field contains?

1. Null         
2. Pointer to next node
3. Pointer to first node
4. Pointer to data item

Answer : 3) Pointer to first node.

 

35. In a Circular linked list:

1. Components are all liked together in some sequential manner.
2. There is no beginning and no end.
3. components are arranged hierarchically.
4. Forward and backward traversal within the list it permitted.

Answer : 2) There is no beginning and no end.

 

36. What is the time complexity to count the number of elements in the liked list

1. O(1)                             
2. O(n)
3. O(log n)                           
4. O(n2)

Answer : 2) O(n)

 

37. A stack is ………

1. Linear data structure          
2. Non-liner data structure
3. Built-in data structure       
4. none of this

Answer : 1) Linear data structure.

 

38. A stack is linear data structure in which data is stored and retrieved in a…….

1. Last out first in (LOFI)    
2. Last in First out(LIFO)
3. First in First out  (FIFO)          
4. Last Out Last in (LOLI)

Answer : 2) Last in First out(LIFO)

 

39. Elements are added at which position of the stack?

1. Bottom                   
2. Middle
3. Top                
4. None of these

Answer : 3) Top

 

40. In a stack, if a user tries to remove an element form empty stack it is called….

1. underflow       
2. Empty collection
3. overflow                  
4. Garbage collection

Answer : 1) Underflow.