The property of ______ is static in nature, compile time early binding and user friendly.
What is the minimum and maximum number of link field updations required respectively to insert a new node in the double linked list?
We have a program that reads 200 integers in the range (0,50). If the program prints frequency of the each integer above 30 and less than or equal to 50, then what would be the best way for program to store the frequencies?
Consider a 2D array A[-5….5][10……15], base address is 100 and word length 2B find address of the element A using Row major order:-
Which of the following statements are true?
S1: Inserting n elements into empty binary heap takes O(n) time.
S2: The most efficient algorithm take O(m+n) time for finding number of connected components in undirected graph of n vertex and m edges.
Consider a binary tree with the following more conditions :
* The elements present in left sub-tree of a specific node are smaller than that node and elements present in right sub-tree of a specific node are greater than that node.
* The tree is always balanced i.e. the height of left sub-tree and right sub-tree is approximately same. (maximum differ by 1)
What is the worst case time complexity to run membership test for an element on this tree ?
Number of BSTs possible with 6 keys are
The statement print f (“%d”, 10?0?5:11:12); prints-
Consider the following C code?
Which of the following is true output if dynamic scoping is used?
If the elements 1, 2, 3, 4, 5, 6 are inserted into the queue in that order and if an element can be deleted at any time from the queue, which of the following permutation can be obtained as output of queue?