Register
Filter

Answers by viv696

1 votes
1
Hamming Code
To provide more reliability than a single parity bit can give,an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits. What is the hamming distance of this code?
To provide more reliability than a single parity bit can give,an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second par...
0 votes
3
Context free language
How to we know that the given language is implemented by one stack or two in cfl???
How to we know that the given language is implemented by one stack or two in cfl???
0 votes
4
#virtual gate
Q.How many possible finite automata are ther with two states x and y , where x is always initial state with alphabet a and b, that accept everthing?? plz explain??
Q.How many possible finite automata are ther with two states x and y , where x is always initial state with alphabet a and b, that accept everthing?? plz explain??
0 votes
5
doubt on substring
which of the following has 11 as subtring: a. 001111 b.00110011 c.0011 d.1100 more than one answer is possible
which of the following has 11 as subtring:a. 001111b.00110011c.0011d.1100more than one answer is possible
0 votes
6
turing machine
Which of the above statement is true?
Which of the above statement is true?
0 votes
7
turing machine
How FA with a queue is equal to Turing machine?
How FA with a queue is equal to Turing machine?
1 votes
8
Lattice
How to pick an option from this I feel like both c and d are correct what do you day?
How to pick an option from this I feel like both c and d are correct what do you day?
0 votes
9
Dividing a set of n elements in r groups where groups are of size n1,n2,n3... and n1+n2+n3+ ...(uo to r terms ) = n
(Reference- A first course in probablity by Sheldon Ross [Example 5b and 5c of chapter 1])Q1. Ten children are to be divided into an A team and a B team of 5 each. The A ...
0 votes
14
Process Scheduling
Which one is not a valid reason for process termination ? 1) Time limit exceeded 2) memory unavailable 3) Parent termination 4) Child termination Explain with giving an example of each
Which one is not a valid reason for process termination ?1) Time limit exceeded 2) memory unavailable 3) Parent termination 4) Child termination Explain with giving an ex...
1 votes
15
C pointer doubt
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node ** head, into value); To this mynode *head; add_node (head,10); add_node( struct node* head, into value) Which is the correct way of writing?
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node head, into value);To this mynode *head; add_node (head,10); add_...
1 votes
17
IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2 Difference between D&C and Dynamic Programming ?
1 votes
18
IITD2012
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.
Define B tree and B+ tree. What’s the necessity? How does the search happen? Write the pseudo code and the recurrence relation.
0 votes
19
IITD2011 Interview
#IITD_2011 why dont we divide array in 5 parts for merge sort ?
#IITD_2011 why dont we divide array in 5 parts for merge sort ?
0 votes
20
IITD_2011 interview
#IITD_2011 there is a frog who could climb either 1 stair or 3 stairs in one shot. In how many ways he could reach at 100th stair ?
#IITD_2011there is a frog who could climb either 1 stair or 3 stairs in one shot. In how many ways he could reach at 100th stair ?
18 votes
21
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________.No...
21 votes
23
GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
6 votes
24
GATE CSE 2016 Set 2 | Question: 14
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on Greedy paradigm. Divide-and-conquer paradigm. Dynamic Programming paradigm. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
The Floyd-Warshall algorithm for all-pair shortest paths computation is based onGreedy paradigm.Divide-and-conquer paradigm.Dynamic Programming paradigm.Neither Greedy no...
11 votes
25
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
0 votes
27
division among groups
In order to play basketball,10 childrens at playgorund divide themselves into two teams of 5 each.How many divisions are possible?
In order to play basketball,10 childrens at playgorund divide themselves into two teams of 5 each.How many divisions are possible?
0 votes
30
Probability
Page: