Register
Filter

Answers by Habibkhan

1 votes
81
GATEFORUM
for(i=0;i<=n;i++){ for(j=0;j<=i2;j++){ for(k=0;k<=$\frac{n}{2}$;k++){ x=y+z; }}} How many times the x=y+z statement will execute?
for(i=0;i<=n;i++){ for(j=0;j<=i2;j++){ for(k=0;k<=$\frac{n}{2}$;k++){ x=y+z;}}}How many times the x=y+z statement will execute?
13 votes
82
Booth's Encoding
What is the Booth’s coding in 8-bits for an integer (-86)?
What is the Booth’s coding in 8-bits for an integer (-86)?
6 votes
85
compiler design
CAN ANYONE PLEASE EXPLAIN WHAT IS SSA I AM NOT UNDERSTANDING THAT CONCEPT ANYWHERE!!!! NOT EVEN THERE IN ULLMAN
CAN ANYONE PLEASE EXPLAIN WHAT IS SSA I AM NOT UNDERSTANDING THAT CONCEPT ANYWHERE!!!! NOT EVEN THERE IN ULLMAN
3 votes
86
theory of computation
7 votes
87
bitwise shift
#include <stdio.h> int main() { printf("%d", 1 << 2 + 3 << 4); return 0; } some one verify answer am getting 256 , given one 512 :(
#include <stdio.h int main() { printf("%d", 1 << 2 + 3 << 4); return 0; }some one verify answer am getting 256 , given one 512 :(
11 votes
89
Pipelining Speedup
Consider a non-pipelined processor design which has a cycle time of 15ns and average CPI of 1.6. The maximum speedup pipelined processor can get by pipelining it into 5 stages and each stage takes 3ns is______________? 5 6 10 7
Consider a non-pipelined processor design which has a cycle time of 15ns and average CPI of 1.6. The maximum speedup pipelined processor can get by pipelining it into 5 s...
3 votes
92
GATE2001-2.15 GATE1994-1.6
How many undirected graphs are possible with n vertices if graphs are not necessarily connected if they are necessarily connected
How many undirected graphs are possible with n verticesif graphs are not necessarily connectedif they are necessarily connected
5 votes
95
Addressing
branch address sign displacement -32. Can anybody explain this line with example? Do it mean target address can be 32 bit before branch address?
branch address sign displacement -32.Can anybody explain this line with example? Do it mean target address can be 32 bit before branch address?
5 votes
98
number of solutions
Number of non negative integer solutions such that $x + y + z = 17$ where $x>1,\ y>2,\ z>3$
Number of non negative integer solutions such that $x + y + z = 17$ where $x>1,\ y>2,\ z>3$
2 votes
101
reversal
Let L = { 0n 1n | n>=1 } U {0n 1 2n | n>=1} Then reverse of L is A) regular B)DCFL C)CFL but not DCFL D)none
Let L = { 0n 1n | n>=1 } U {0n 1 2n | n>=1}Then reverse of L isA) regularB)DCFLC)CFL but not DCFLD)none
2 votes
102
regular language
L1 = { W X WR | W , X $\varepsilon$ (0+1)* } L 2= { W X WR | W $\varepsilon$ (0+1)* } which is regular
L1 = { W X WR | W , X $\varepsilon$ (0+1)* }L 2= { W X WR | W $\varepsilon$ (0+1)* }which is regular
1 votes
103
Rice Theorem
L(M)=RL(Recursive Language) ... M is a TM... Question/Doubt:- L(m) is decidable or not (Explain by the concept of Rice Theorem)???
L(M)=RL(Recursive Language) ...M is a TM...Question/Doubt:-L(m) is decidable or not (Explain by the concept of Rice Theorem)???
5 votes
105
#SQL #TestBook
Plzz explain
Plzz explain
2 votes
108
abelian
Every matrix is abelian under multiplication operation where all elements are real numbers true or false
Every matrix is abelian under multiplication operation where all elements are real numberstrue or false
1 votes
109
Set theory
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = Φ ________.
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = Φ ________.
3 votes
110
relation doubt
Number of relation S over set (0,1,2,3) such that (x,y) E S --> x =y
Number of relation S over set (0,1,2,3) such that (x,y) E S x =y
Page: