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
Questions by smsubham
1
votes
0
answers
21
Number System Interconversion
Can all the values in decimal be finitely represented in binary, hexadecimal and octal system and vice versa? I know 0.2 cannot be converted to the binary form which has a finite representation. Any other such number which cannot be converted from one of the number systems to other?
Can all the values in decimal be finitely represented in binary, hexadecimal and octal system and vice versa?I know 0.2 cannot be converted to the binary form which has a...
747
views
asked
Apr 4, 2018
Digital Logic
number-representation
digital-logic
+
–
0
votes
1
answer
22
Attribute Grammar
Can someone explain these terms clearly these terms with examples? Attribute Grammar Synthesized attributes Inherited attributes L and S Attributes
Can someone explain these terms clearly these terms with examples?Attribute GrammarSynthesized attributesInherited attributesL and S Attributes
769
views
asked
Apr 4, 2018
Compiler Design
compiler-design
grammar
+
–
0
votes
0
answers
23
compiler
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
If we increase the number of lookahead in LL, LR, SLR,LALR, CLR grammar will its expressive power increase and what is the reason for that?
518
views
asked
Apr 4, 2018
Compiler Design
compiler-design
parsing
ll-parser
+
–
1
votes
1
answer
24
LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...
1.0k
views
asked
Apr 4, 2018
Compiler Design
compiler-design
ll-parser
parsing
lr-parser
grammar
+
–
0
votes
0
answers
25
Recurrence
When T(n) = a T(n/b) + f(n) If on solving we get g(n) as upper bound solution for the recurrence. Is f(n) = O( g(n) ) always correct?
When T(n) = a T(n/b) + f(n)If on solving we get g(n) as upper bound solution for the recurrence.Is f(n) = O( g(n) ) always correct?
297
views
asked
Apr 3, 2018
Algorithms
recurrence-relation
time-complexity
algorithms
asymptotic-notation
+
–
2
votes
1
answer
26
Programming in C
How many asterisks (*) in terms of k will be printed by the following C function, when called as count(m) where m = 3k? Justify your answer. Assume that 4 bytes are used to store an integer in C and k is such that 3k can be stored in 4 bytes. void count(int n) { printf("*"); if(n>1) { count(n/3); count(n/3); count(n/3); } }
How many asterisks (*) in terms of k will be printed by the following Cfunction, when called as count(m) where m = 3k? Justify your answer.Assume that 4 bytes are used to...
484
views
asked
Feb 13, 2018
Programming in C
programming-in-c
isi-pcb-2015-sample
+
–
4
votes
2
answers
27
MADE EASY TEST SERIES
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the control of channel using binary exponential algorithm. The probability that both ... fifth round of the algorithm (assuming every time both X and Y will collide in back-off race till 4th round) is ________.
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the co...
1.0k
views
asked
Jan 25, 2018
Computer Networks
csma-cd
ethernet
computer-networks
+
–
2
votes
0
answers
28
Ace Test series: Algorithms - Graph Algorithms
469
views
asked
Jan 6, 2018
Algorithms
ace-test-series
minimum-spanning-tree
graph-algorithms
algorithms
+
–
2
votes
0
answers
29
Ace Test series: Algorithms - Graph Algorithms
285
views
asked
Jan 6, 2018
Algorithms
ace-test-series
algorithms
graph-algorithms
+
–
2
votes
1
answer
30
Ace Test series: Algorithms - Sorting
1.0k
views
asked
Jan 6, 2018
Algorithms
ace-test-series
algorithms
sorting
+
–
2
votes
1
answer
31
Ace Test series: Algorithms - Recurrence
534
views
asked
Jan 6, 2018
Algorithms
ace-test-series
time-complexity
master-theorem
recurrence-relation
algorithms
+
–
3
votes
0
answers
32
Ace Test series: Algorithms - Spanning Tree
Am getting 7. The answer given is 10. A - B , A - D , D - E , E - C are the edges i have included.
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.
550
views
asked
Jan 6, 2018
Algorithms
ace-test-series
graph-algorithms
algorithms
spanning-tree
minimum-spanning-tree
+
–
2
votes
0
answers
33
Minimum Spanning Tree
Which of the following are correct for Minimum Spanning Tree from graph G with unique weights, with the weight function w: E→R (more than one possible) If we divide all weights by some non zero value MST will be unchanged (answer for both positive ... ) If we add or subtract all weights by some number MST will remain unchanged. (answer for both positive and negative values)
Which of the following are correct for Minimum Spanning Tree from graph G with unique weights, with the weight function w: E→R (more than one possible)If we divide all ...
678
views
asked
Dec 25, 2017
Algorithms
algorithms
minimum-spanning-tree
graph-algorithms
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
