Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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?
1.1k
views
answered
Oct 16, 2017
Programming in C
programming-in-c
time-complexity
for
loop
asymptotic-notation
normal
+
–
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.2k
views
answered
Oct 16, 2017
Digital Logic
digital-logic
number-representation
booths-algorithm
+
–
4
votes
83
Algo doubt
iterated logarithmic function is defined as $\log^*n = \begin{cases} 0 &\text{if }\quad n\leq 0 \\1 +\log^*(\log n) &\text{if } \quad n >1\end{cases}$ Which of the following is true? $\log^*n = O(\log(\log n ))$ $(\log^*n)!= O(\log n)$ $\log^* n = \Theta(\log n)$ $(\log^*n)^n= O((\log n)!)$
iterated logarithmic function is defined as$\log^*n = \begin{cases} 0 &\text{if }\quad n\leq 0 \\1 +\log^*(\log n) &\text{if } \quad n >1\end{cases}$Which of the followi...
798
views
answered
Oct 15, 2017
Algorithms
algorithms
asymptotic-notation
logarithmic-function
multiple-selects
+
–
2
votes
84
Performance c
Consider the system have L1 data cache with 50 percent of hit rate and take 2 cycles when hit in L1 cache, L2 cache with 70% of hit rate and take 15 cycles when hit in L2 cache and main memory with 100% of the hit rate and 200 cycles when hit in main memory to access ... by 15% then the improvement in L1 miss time is ____________(upto 2 decimals) 1. 2.14 2. 2.78 3. 1.48 4. 1.14
Consider the system have L1 data cache with 50 percent of hit rate and take 2 cycles when hit in L1 cache, L2 cache with 70% of hit rate and take 15 cycles when hit in L2...
1.1k
views
answered
Oct 15, 2017
CO and Architecture
co-and-architecture
cache-memory
hit-ratio
bad-question
+
–
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
370
views
answered
Oct 14, 2017
Compiler Design
intermediate-code
+
–
3
votes
86
theory of computation
279
views
answered
Oct 14, 2017
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 :(
542
views
answered
Oct 14, 2017
6
votes
88
TOC Test Series
Consider the languages (I) L1= {w#x , where w,x ∈ (0+1)* and # is a special character and w is a prefix of x } . (II) L2={w#x , where w,x ∈ (0+1)* and # is a special character and wR, is a prefix of x}. (III) L3={w#x , where w,x ∈ (0+1)* and # is a ... (II) and (III) is DCFL (I) and (IV) is recursive but not CFL. (I) is recursive , (II) is DCFL , (III) and (IV) are CFL but not DCFL
Consider the languages(I) L1= {w#x , where w,x ∈ (0+1)* and # is a special character and w is a prefix of x } .(II) L2={w#x , where w,x ∈ (0+1)* and # is a special ch...
927
views
answered
Oct 14, 2017
Theory of Computation
theory-of-computation
dcfl
recursive-and-recursively-enumerable-languages
+
–
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...
1.4k
views
answered
Oct 12, 2017
CO and Architecture
pipelining
co-and-architecture
speedup
+
–
1
votes
90
Rossen: How to perform Composition on Directed Graph.
Given the directed graphs representing two relations, how can the directed graph of the union, intersection, symmetric difference, difference, and composition of these relations be found? As, we can easily find, union, ... :- https://math.stackexchange.com/questions/239897/draw-the-composition-of-directed-graphs But not explained clearly.
Given the directed graphs representing two relations, how can the directed graph of the union, intersection, symmetric difference, difference, and composition of these re...
1.3k
views
answered
Oct 12, 2017
Set Theory & Algebra
set-theory&algebra
directed-graph
relations
+
–
2
votes
91
Regular Language
Consider the following languages: $L_{1}= \big\{0^{n+m} \ 1^{k+l}\ | \ m=l, m,n,k,l \geq 1 \big\} $ $ L_{2}= \big\{0^{n} \big(1^ {2}\big)^{m}\ | \ m,n\geq 0 \big\} $ Which of the following is true? $L_{1}$ is regular but not $L_{2}$ $L_{2}$ is regular but not $L_{1}$ $L_{1}$ and $L_{2}$ are not-regular $L_{1}$ and $L_{2}$ are regular Is L1 regular ?
Consider the following languages: $L_{1}= \big\{0^{n+m} \ 1^{k+l}\ | \ m=l, m,n,k,l \geq 1 \big\} $$ L_{2}= \big\{0^{n} \big(1^ {2}\big)^{m}\ | \ m,n\geq 0 \big\} $Whic...
365
views
answered
Oct 12, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
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
1.4k
views
answered
Oct 12, 2017
Graph Theory
graph-theory
combinatory
+
–
2
votes
93
co_williams
The Intel 8088 consists of a bus interface unit (BIU) and an execution unit (EU), which form a 2-stage pipeline. The BIU fetches instructions into a 4-byte instruction queue.The BIU also participates in address calculations, fetches operands, and writes ... the 8088? Ignore the effect of branch instructions. Repeat the calculation assuming that the EU takes twice as long as the BIU.
The Intel 8088 consists of a bus interface unit (BIU) and an execution unit (EU), which form a 2-stage pipeline. The BIU fetches instructions into a 4-byte instruction qu...
1.8k
views
answered
Oct 12, 2017
CO and Architecture
processor-structure
+
–
3
votes
94
co_williams
If the last operation performed on a computer with an $8$-bit word was an addition in which the two operands were $00000010$ and $00000011$, what would be the value of the following flags? Carry Zero Overflow Sign Even Parity Half-Carry b. Repeat for the addition of -$1$ (twos complement) and +$1$ can anyone please explain in b part overflow bit will be $1$ or $0$.
If the last operation performed on a computer with an $8$-bit word was an addition in which the two operands were $00000010$ and $00000011$, what would be the value of th...
1.8k
views
answered
Oct 12, 2017
CO and Architecture
cpu-structure-and-function
+
–
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?
631
views
answered
Oct 12, 2017
CO and Architecture
co-and-architecture
addressing-modes
+
–
5
votes
96
Process Synchronization
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?
3.3k
views
answered
Oct 11, 2017
Operating System
process-synchronization
deadlock-prevention-avoidance-detection
operating-system
+
–
5
votes
97
I-cache and D-cache
Given that L1 instruction and L1 data cache are connected to CPU directly, (doubt: does it mean they're independent?) Each instruction fetch means a reference to the instruction cache and 35% of all instructions reference data memory. The ... 35% of all instructions reference data memory, so should we consider 65% of all instructions reference instruction memory or not ?
Given that L1 instruction and L1 data cache are connected to CPU directly,(doubt: does it mean they're independent?)Each instruction fetch means a reference to the instru...
2.1k
views
answered
Oct 11, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
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.5k
views
answered
Oct 9, 2017
Mathematical Logic
discrete-mathematics
combinatory
+
–
4
votes
99
Tanenbaum
A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slotted in units of 40 msec. a. (a) What is the chance of success on the first attempt? b. (b) What is the probability of exactly k collisions and then a success? c. (c) What is the expected number of transmission attempts needed?
A large population of ALOHA users manages to generate 50 requests/sec, includingboth originals and retransmissions. Time is slotted in units of 40 msec.a. (a) What is the...
11.3k
views
answered
Oct 9, 2017
Computer Networks
pure-aloha
computer-networks
+
–
4
votes
100
Tanenbaum -A 1-km-long, 10-Mbps CSMA/CD LAN
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/μsec. Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The ... frame. What is the effective data rate, excluding overhead, assuming that there are no collisions? ans=3.8 mbps please explain??
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of200 m/μsec. Repeaters are not allowed in this system. Data frames are 256 bits long,including 32 b...
12.0k
views
answered
Oct 9, 2017
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
1.2k
views
answered
Oct 8, 2017
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
707
views
answered
Oct 8, 2017
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)???
644
views
answered
Oct 6, 2017
Theory of Computation
rice
theorem
+
–
11
votes
104
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number? A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128 Answer given is A Please explain :) Thanks.
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128Answer given is APlease ...
13.6k
views
answered
Oct 6, 2017
Computer Networks
computer-networks
go-back-n
sliding-window
+
–
5
votes
105
#SQL #TestBook
Plzz explain
Plzz explain
401
views
answered
Oct 6, 2017
Databases
databases
sql
+
–
1
votes
106
PROBABILITY
A box containing 4 red balls and 6 black balls . Three balls are selected randomly from the box one after the another, without replacement . The probality that the selected set has one red ball and two black balls is . I am getting this (4/10)*(6/9)*(5/8) is it correct And is order have any significance here.?
A box containing 4 red balls and 6 black balls . Three balls are selected randomly from the box one after the another, without replacement . The probality that the select...
667
views
answered
Oct 6, 2017
Probability
probability
+
–
4
votes
107
Packet Loss in GBN
Q1 >> Station A wants to send 10 packets to station B using Go Back N ARQ, where N = 4. Moreover consider every 4 th packet lost while transmission (ACK's from B never get lost). Calculate the number of transmissions that A has to make ... from B never get lost). Calculate the number of transmissions that A has to make in GBN respectively to ensure safe delivery to B.
Q1 > Station A wants to send 10 packets to station B using Go Back N ARQ, where N = 4. Moreover consider every 4 th packet lost while transmission (ACK's from B never get...
3.3k
views
answered
Oct 5, 2017
Computer Networks
computer-networks
sliding-window
go-back-n
+
–
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
403
views
answered
Oct 5, 2017
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 = Φ ________.
886
views
answered
Oct 4, 2017
Set Theory & Algebra
discrete-mathematics
+
–
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
283
views
answered
Oct 3, 2017
Page:
« prev
1
2
3
4
5
6
7
8
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register