NEW
Font size
WorksheetsData Structures Priliminary
Total questions: 30
Worksheet time: 30mins
If the insertion and deletion happens from both the ends then the queue is called a______Queue
a) Deque
b) Header
c) Queue
d) Circular Queue
Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
a-iii, b-ii, c-i
a-i, b-ii, c-iii
a-iii, b-i, c-ii
a-i, b-iii, c-ii
Efficiency of an algorithm is measured by
Time and Capacity complexity
Time and Space complexity
Speed and Space complexity
Speed and Capacity complexity
If for an algorithm time complexity is given by O(1) then complexityof it is:
A. constant
B. polynomial
C. exponential
D. none of the mentioned
int nums[ ] =
{2, 3, 5, 8, 9, 11};
How would you access the fourth element in nums
nums[8]
nums[3]
nums(4)
nums(3)
Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, get the total number of element present in stack is
1
2
3
4
____________data structures are those whose sizes and structures associated memory locations are fixed at compile time.
linear
homogeneous
static
dynamic
In a stack, if a user tries to remove an element from empty stack it is called _________
Underflow
Stack is Empty
Overflow
None of the above
Pushing an element into stack already having five elements and stack size of 5, then stack becomes
Overflow
Crash
Underflow
None of the above
What will be the postfix form of the above expression -
(A+B)∗(C∗D-E)∗F/G
None of these
A B + C D ∗ E − F G ∗ / ∗
A B + C D E ∗ − F G / ∗ ∗
A B + C D ∗ E − F G / ∗ ∗
Linked lists are not suitable to for the implementation of?
Insertion sort
Radix sort
Polynomial manipulation
Binary search
Linked list is considered as an example of ___________ type of memory allocation.
Dynamic
Static
Compile time
None of the mentioned
How do you initialize an array in C?
int arr[3] = (1,2,3);
int arr(3) = {1,2,3};
int arr[3] = {1,2,3};
int arr(3) = (1,2,3);
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)
f3, f2, f4, f1
f3, f2, f1, f4
f2, f3, f1, f4
f2, f3, f4, f1
The time complexity of the following C function is (assume n > 0)
int recursive (int n) {
if(n == 1)
return (1);
else
return (recursive (n-1) + recursive (n-1));
}
O(n)
O(n log n)
O(n^2)
O(2^n)
What advantage does a linked list have over an array?
Size of the list doesn't need to be mentioned at the beginning of the program
You can add or remove elements from the middle of the list.
The linked list doesn't have a size limit
All of these are true.
How to delete node B?
head->next=TempPtr; free(TemPtr);
free(TemPtr); head->next=TempPtr->next;
head->next=TempPtr->next;free(TemPtr)r;
free(head); head->next= TempPtr->next
How many null pointers exists in a circular linked list?
0
1
2
3
Which node’s data will be printed when
“temp =temp->next” is executed 3 times and the initial value of temp is temp=head
Null
9
27
46
What is the other name for a postfix expression?
a) Normal polish Notation
b) Reverse polish Notation
c) Warsaw notation
d) Infix notation
The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is
284
213
142
71
numbers[i] = 2 * i + 1;
// Which index of the array holds the value of 5?
In Linked list implementation, a node carries information regarding _______.
Data
Link
Data and Link
Node
Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s
xyz*+pq*r+s*+
xyz*+pq*r+s+*
xyz+*pq*r+s*+
none
Mathematical-model with a collection of operations defined on that model is called
Data Structure
Abstract Data Type
Primitive Data Type
Algorithm
Which header file is required to use Dynamic Memory Allocation functions
stdio
stdlib
conio
stdutil
calloc() function takes :
One parameter
Two parameters
Two parameters but one is optional
Zero parameters
Consider the following definition in c programming language.Which of the following c code is used to create new node?
struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;
ptr = (NODE*)malloc(sizeof(NODE));
ptr = (NODE*)malloc(NODE);
ptr = (NODE*)malloc(sizeof(NODE*));
ptr = (NODE)malloc(sizeof(NODE));
What is a portion of memory from which space is automatically allocated or de-allocated as required?
Static data structure
Dynamic data structure
Heap
Encapsulation
What is a variation of a FIFO structure where some data may leave out a sequence where it has a higher priority than other data items?
Linear queue
Circular queue
Priority queue
Heap
