Register
Filter

Answers by Prashant.

0 votes
521
Implementing Queue with only one pointer
Which of the following statement is/are correct? 1. If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time. 2. If we use only Rear pointer in queue, then insertion is O(1) and deletion is not possible.
Which of the following statement is/are correct?1. If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time.2. If we use only Rea...
2 votes
523
TOC -Number of Equivalence Classes
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivalence classes here...
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
4 votes
526
MadeEasy Test Series: Algorithms - Time Complexity
Q.19 Consider the following function. What is the worst case running time of the function f for any positive value of n? O(1) O(n) O(n2) O(n3)
Q.19Consider the following function.What is the worst case running time of the function f for any positive value of n?O(1)O(n)O(n2)O(n3)
1 votes
528
huffman coding
we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible? code 1={0,10,11} code 2={0,00,1} code 3={10,00,01}
we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible?code 1={0,10,11}code 2={0,00,1}code 3={10,00,01}
0 votes
529
deadlock
if system is in unsafe state then deadlock may or may not occur but in bankers algorithm if system found in unsafe state how to check further for deadlock. explain with example
if system is in unsafe state then deadlock may or may not occurbut in bankers algorithm if system found in unsafe state how to check further for deadlock. explain with e...
0 votes
531
statistics
Q) Let $x$ be normal variable with mean $8$ and standard deviation $4$ then $p(X\leq5)$ is A). Greater than zero but less than $0.5$ B). Greater than $0.75$ C). Greater than $0.5$ but less than $1$ D). Equal to $0.5$
Q) Let $x$ be normal variable with mean $8$ and standard deviation $4$ then $p(X\leq5)$ is A). Greater than zero but less than $0.5$B). Greater than $0.75$C). Greater tha...
1 votes
532
deadlock
what is meant by satisfy deadlock? free from deadlock OR not free from deadlock
what is meant by satisfy deadlock?free from deadlockORnot free from deadlock
1 votes
538
Number of rows
1 votes
539
C program
how it is compiler error int main() { extern int i; printf("%d ", i); { int i = 10; printf("%d ", i); } } (a) 0 10 (b) Compiler Error (c) 0 0 (d) 10 10 ans b
how it is compiler errorint main(){extern int i;printf("%d ", i);{int i = 10;printf("%d ", i);}}(a) 0 10 (b) Compiler Error(c) 0 0 (d) 10 10ans b
1 votes
540
C program
as i is initialized with 5 in main then how it becomes 0 please explain ? int main() { static int i=5; if(--i) { main(); printf("%d ",i); } } op = 0000
as i is initialized with 5 in main then how it becomes 0 please explain ?int main(){static int i=5;if( i){main();printf("%d ",i);}}op = 0000
1 votes
542
pointer array
What it means ? int (*p)[R][C];
What it means ?int (*p)[R][C];
1 votes
544
Write equivalent first order expression
There are worms inside some ripe mangoes.
There are worms inside some ripe mangoes.
2 votes
545
logic
Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives. a) No one is perfect. b) Not everyone is perfect. c) All your friends are perfect. d) At least one of your friends is perfect.
Translate each of these statements into logical expressionsusing predicates, quantifiers, and logical connectives.a) No one is perfect.b) Not everyone is perfect.c) All y...
4 votes
546
check the question
consider unspanned blocking with 20 byte blocks. A file contains records of sizes 2,5,3,7,4,20 bytes. the percentage of space wasted if blocks are allocated for file is? my answer is 47.5.but they are given 31.66.please explain it.
consider unspanned blocking with 20 byte blocks. A file contains records of sizes 2,5,3,7,4,20 bytes.the percentage of space wasted if blocks are allocated for file is?my...
8 votes
547
GATE CSE 2007 | Question: 22
Let $\text{ Graph}(x)$ be a predicate which denotes that $x$ is a graph. Let $\text{ Connected}(x)$ be a predicate which denotes that $x$ ... $\forall x \, \Bigl ( \text{ Graph}(x) \implies \lnot \text{ Connected}(x) \Bigr )$
Let $\text{ Graph}(x)$ be a predicate which denotes that $x$ is a graph. Let $\text{ Connected}(x)$ be a predicate which denotes that $x$ is connected. Which of the follo...
1 votes
549
Program
Explain the line : t = (p += sizeof(int))[-1]; in following program : #include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); }
Explain the line :t = (p += sizeof(int))[-1];in following program :#include <stdio.h void f(char ); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(...
4 votes
550
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...
Page: