Analysis of Algorithms and Computational Complexity Questions and Answers
Understanding the Analysis of Algorithms and Computational Complexity questions with answers is crucial for students preparing for GATE, TCS, Infosys, and Wipro placement exams. This topic focuses on evaluating the efficiency of algorithms based on time and space complexity, which forms the foundation of advanced computer programming and system design. By solving programming questions and answers related to algorithm analysis, you can strengthen your logical thinking, optimize code performance, and make informed design decisions. In this section, we cover detailed MCQs and explanations to help you master Big O notation, asymptotic analysis, and algorithmic trade-offs. Perfect for both academic and placement preparation, this guide ensures clarity with well-explained examples.
Questions on algorithmic analysis for computer science aspirants can be complemented by data structure algorithms and software engineering MCQ
Analysis of Algorithms and Computational Complexity
191. A linear collection of data element the linear node is given by mean of pointer is called
- linked list
- node list
- primitive list
- none of these
192. "P" is a pointer to the structure. A member "mem" of that structure is referenced by
- * P. mem
- (*P). mem
- * (P. mem)
- none of these
193. Adjacency matrix for a diagraph is
- unit matrix
- symmetric
- symmetric matrix
- none of these
194. Which of the following is most appropriate ?
- int * matrix;.....; free (void)matrix;
- int * matrix;......; free (matrix);
- int * matrix;.....;if(matrix!=null) free (void*) matrix
- none of these
195. If the address of A [1, 1] and A [2, 1] are 1000 and 1010 respectively and each element occupies 2 types, then the array has been stored in
- row major
- column major
- compiler dependent
- none of these
196. Which of the following data structure may give overflow error, even though the current number of element in it is less than its size?
- simple queue
- circular queue
- stack
- none of these
197. An adjacency matrix representation of graph cannot contain information of
- nodes
- edges
- direction of edge
- parallel edges
198. In the quick sort method, a desirable choice for the partitioning elements will be
- first element of the list
- last element of the list
- median of the list
- none of these
199. Which of the following types of expressions does not require precedence rule for evaluated ?
- Full parenthesized infix expression
- Prefix expression
- Partially parenthesized infix expression
- More than one of these