Processor and memory

Complexity and capacity

Time and space

Data and space

**A variable P is called pointer if****Merge sort uses ?****If the values of a variable in one module is indirectly changed by another module, this situation is…****The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…****The complexity of linear search algorithm is****Arrays are best data structures****Linked lists are best suited****Which of the following is non-liner data structure?****Stack is also called as****To represent hierarchical relationship between elements, Which data structure is suitable?****When new data are to be inserted into a data structure, but there is no available space; this situation…****Which one of the following permutations can be obtained the output using stack assuming that the input…****The number of possible ordered trees with three nodes A,B,C is?****Which of the following statement is true ?****Which of the following data structure is non linear type?****The elements of an array are stored successively in memory cells because****Two main measures for the efficiency of an algorithm are****The difference between linear array and a record is****……………. Is a pile in which items are added at one end and removed from…****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****The memory address of the first element of an array is called****When determining the efficiency of algorithm the time factor is measured by****Which of the following name does not relate to stacks?****The complexity of Bubble sort algorithm is****When determining the efficiency of algorithm, the space factor is measured by****In linear search algorithm the Worst case occurs when****The memory address of fifth element of an array can be calculated by the formula****Which of the following statement is false?****_____ is not the component of data structure.****The complexity of Binary search algorithm is**