Register
Filter

Answers by Prashant.

1 votes
201
FUNCTION
35 votes
203
GATE CSE 1987 | Question: 1-II
The total number of Boolean functions which can be realised with four variables is: $4$ $17$ $256$ $65, 536$
The total number of Boolean functions which can be realised with four variables is:$4$$17$$256$$65, 536$
5 votes
204
cpu scheduling
explanation please...??? and what is the difference between convoy effect and starvation?
explanation please...???and what is the difference between convoy effect and starvation?
2 votes
205
cpu scheduling
come up with a full understanding explanation......
come up with a full understanding explanation......
1 votes
206
cpu scheduling
0 votes
208
GateBook TOC Grand Test 1 Q 16
4 votes
209
TOC Grand Test 1 Question 1
3 votes
210
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes?
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes? 2⌈n⁄2⌉ 2(⌊ n/2⌋ ) 2⌈n⁄2⌉ -1 2(�...
3 votes
213
Min Heap
he minimum number of swaps required to build a min heap tree is _____________. Assume that array of n elements is provided 0 n/2 n n+1
he minimum number of swaps required to build a min heap tree is _____________. Assume that array of n elements is provided 0 n/2 n n+1
4 votes
214
AVL tree
Following keys are inserted into a binary search tree and AVL tree in given order, keys : 45 30 8 36 60 51 The following nodes are added into corresponding BST and AVL tree then what is the difference in height of BST and AVL tree ? Keys : 4 16 25 are added afterwards in the corresponding trees
Following keys are inserted into a binary search tree and AVL tree in given order,keys : 45 30 8 36 60 51The following nodes are added into corresponding BST and AVL tree...
4 votes
215
AVL Tree
Following keys are inserted into a binary search tree and AVL tree in given order, keys : 45 30 8 36 60 51 What is the difference in the height of the binary search tree and AVL tree ?
Following keys are inserted into a binary search tree and AVL tree in given order,keys : 45 30 8 36 60 51What is the difference in the height of the binary search tree an...
3 votes
216
DMA is
DMA is a)Processor by itself b) Feature of the computer c)Part of processor d)A dedicated h/w device
DMA is a)Processor by itself b) Feature of the computer c)Part of processor d)A dedicated h/w device
2 votes
219
Address of a 2 - dimensional Array
1 votes
220
Design an AVL tree ?
4 votes
221
Macro
Consider the following C program # include<stdio.h> # define fun(i, j) i * j # define gun(q) q * q int main( ) { int i = 4; int j = 3; printf(“%d”, fun(fun(i + 2, j), gun(j + 2))); return 0; } The output of the program is _______
Consider the following C program# include<stdio.h # define fun(i, j) i * j # define gun(q) q * q int main( ) { int i = 4; int j = 3; printf(“%d”, fun(fun(i + 2, j), g...
0 votes
223
worst case lower bound
What is the meaning of upper bound and worst case lower bound here?
What is the meaning of upper bound and worst case lower bound here?
1 votes
225
Connectors
2 votes
226
SQL query
when we calculated avg fun in sql then we exclude the null value or not in count (sum/count) somewhere it consider null vlaue also in count soomwher not?? wht is actual procedure
when we calculated avg fun in sql then we exclude the null value or not in count (sum/count)somewhere it consider null vlaue also in count soomwher not??wht is actual pro...
Page: