0 votes
1
1 votes
3
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
0 votes
4
Suppose you have a singly Linked List of n nodes and you want to insert a node in the middle of the Linked List, At least how many pointers do you need to handle to perfo...
0 votes
5
How to use substitution method
0 votes
7
Can anyone help explain the concept of enums through this question,please?
0 votes
8
#include <stdio.h>int main(){ int a=20; int *ptr=&a; int x=a; printf ("%p\n",&*ptr); printf ("%p\n",&a); return 0;}Why both printf() line printing the s...
1 votes
10
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
0 votes
11
How to calculate the sizeof(arr2)?
1 votes
12
0 votes
13
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
0 votes
14
0 votes
15
Please explain with some example that How Right to Left associativity takes place in case of Ternary operators?
0 votes
16
What will be the complexity of merging two circular single linked list? You can consider the sizes of the linked lists are n1 and n2, respectively.
0 votes
17
Is there any shortcut method to find the optimal solution of 0/1 knapsack problem?
0 votes
18
I know the answer but need a good explanation for this question. Can anyone help. Thanks!