10. The data structure required for Breadth First Traversal on a graph is? a) Array b) Stack c) Tree d) Queue View Answer 11. The prefix form of A-B/ (C * D ^ E) is? a) -A/B*C^DE b) -A/BC*^DE c) -ABCD*^DE ...
of using an array, examples of data structures, components of a data structure, priority queue, time complicity of quicksort, applications of the stack, linear type of data structure, indexed structures, nodes in a linked list and linear array and a binary search tree in a data structure. ...
Answer: 2 For the implementation of maps in C++ language, Red Black Tree type of data structure is used Q 10 Among the following, what all could be done on Linkedlist? For the binary trees to be implemented For the stacks and queues to be implemented Dynamic Array All of the above ...
The time complexity of finding the maximum number in an unsorted array of n elements is O(n). This is because you need to check each element of the array to ensure you have found the maximum value. In the worst-case scenario, every element must be compared, leading to a linear time ...
21. Characters are grouped into tokens in which of the following phase of the compiler design? a) Code generator b) Lexical analyzer c) Parser d) Code optimization View Answer 22. Why Generation of intermediate code based on an abstract machine model is useful in compilers?
It is possible to pass a structure variable to a function either by value or by address. - Published on 19 Oct 15 a.True b.False AnswerExplanation 3) C programming : Suppose that x is a one dimensional array, then choose the correct answer regarding array. ...
a) Jagged Array b) Rectangular Array c) Cuboidal Array d) Multidimensional Array View Answer 26. Which of the following return-type cannot be used for a function in C? a) char * b) struct c) void d) none of the mentioned View Answer ...