1 votes
1
Arrange the following Data-structures in the non-decreasing order of worst case time complexities on the operation $Search$Binary Search Trees, Linked List, Array, Hash T...
5 votes
4
Assume sizeof an integer and a pointer is 4 byte. Output?#include<stdio.h #define R 10 #define C 20 int main() { int *p[R][C]; printf("%d",sizeof(*p)); printf("%d",sizeof...
2 votes
5
Can Somebody Please explain me in detail description how to calculate the number of upper triangular and lower triangular of a square matrix I read somewhere that it turn...
2 votes
7
3 votes
8
can somebody please explain solution to this question?
0 votes
10
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst ca...
1 votes
11
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not ...
1 votes
12
Equation: $x+y=10$ and we are asked to find out the number of a non-negative integral solution of this equation.
3 votes
14
How many total bits are required for a direct-mapped cache with 16 KB of dataand 4-word blocks, assuming a 32-bit address?
0 votes
15
If there is sequential synchronous circuit and it is producing following distinct stages 0->2->1->4Then how many ff is needed to draw it ?
1 votes
16
I think that the given grammar is LL(1) . please explain me if I'm wrong.
0 votes
18
$\text{prtdata}$ is a pointer to a data type. The expression $^*\text{prtdata}++$ is evaluated as (in C++)$^*(\text{prtdata++})$$(^*\text{prtdata})++$$^*(\text{prtdata})+...
0 votes
23
identify how many 2 i/p NOR gate require to realize1.2 input EX-OR GATE2. 2 input EX-NOR GATE
0 votes
26
What is the solution of this?I guess 0 or 1.