Data Structure Quiz 10
| Description: To improve Knowledge in the field of Data Structures and its Concepts | |
| Number of Questions: 25 | |
| Created by: Saurabh Mittal | |
| Tags: Data Structures Data Structures using C Stacks Queue Tower of Hanoi Tree General Awareness and Computer Applications Computer Applications (New) Data Structure |
How many fields are there in a node of a doubly linked list?
How many pointers are in the assigned state in a 10 - node doubly linked list?
There are 10 elements in an array. If 4th element is deleted, position of how many elements is changed?
Given array of elements [50 60 30 40 20 15 25]. In how many comparisons, 4th largest item can be found if Bubble sort is applied?
Given an array A[-1:7, 0:6]. The number of rows and columns in this array are
In a linear queue, Front = 7 and Rear = 25. What is the number of elements in the queue?
What is the similarity between the operations on stack and queues, although they are entirely different?
The queue data structure is not applicable in
Given an array A[lb:ub]. The number of elements in this array is given by the formula
How many elements are there in the left half of the partition?
Let n be the integer and L(n) be a function defined as L(n) = 0 if n = 1 L(én/2ù) + 2 if n>1 What is the value of L(19)?
If PRCD(x, y) function gives TRUE operator and x has precedence over y, what is the output of the function PRCD(*, /)?
The function of generating the nth fibonacci number is given below 0 n = 1 Fib(n) = 1 n = 2 Fib(n-1) + Fib(n-2) n>2 What is the value of Fib(10)
What is the value of the postfix expression 854*+63/-?
What is the value of the expression 23522*+62/-?
How many fields are there in a node of a circular doubly linked list?
If we try to represent a degree - 2 polynomial with linked list, how many fields a node will have?
How many pointers are in the assigned state in a 10 - node circular doubly linked list?
Given an infix expression with parenthesis. If we try to convert this postfix in the resultant expression
In the problem of Towers of Hanoi with 4 disks, how many minimum moves are required to transfer all disks from source peg to the destination peg?
If all the elements are in the array, then Quick sort runs in……..time.
If we run quick sort on the set '66 24 59 80 29 35 40 45 65 90', then after first partition, the elements in the right part are
position of which element is fixed?
What is the postfix equivalent of abcd?
If PRCD (x, y) function gives TRUE operator, and x has precedence over y. What is the output of the function PRCD(,)?