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 Shubhanshu
4
votes
0
answers
61
Algebra
If $13x + 17y = 643$, where $x$ and $y$ are the natural numbers, what is the value of two times the product of $x$ and $y$? Is there any good solution other than brute force??
If $13x + 17y = 643$, where $x$ and $y$ are the natural numbers, what is the value of two times the product of $x$ and $y$?Is there any good solution other than brute for...
3.5k
views
asked
Nov 1, 2017
Quantitative Aptitude
quantitative-aptitude
+
–
2
votes
1
answer
62
DFA for Right Quotient of Regular Languages
For drawing the DFA for right quotient I have referred following link:- Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html But unable to get the dfa for the following language Its answer is c, and got that too using manual checking. but facing difficulty in drawing DFA for it.
For drawing the DFA for right quotient I have referred following link:-Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.htmlBut unable to get the dfa for the...
1.7k
views
asked
Oct 31, 2017
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
6
votes
2
answers
63
complement of the Finite Automata
For below question assume you have input set = {a,b} Q1. Complement of the NFA accepting language L is equivalent to complement of the that language L. {True/False} Q2. What will be the complement of NFA accepting only epsilon?
For below question assume you have input set = {a,b}Q1. Complement of the NFA accepting language L is equivalent to complement of the that language L. {True/False}Q2. Wha...
3.7k
views
asked
Oct 31, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
1
answer
64
Propagation Delay of Not Gates
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec, then the time period of generated square wave is - I think it should be 22ns but it is given 20ns Suppose at time 0 the output at last FF ( right most FF) is 0 Then at time 12 ... will change from 1 to 0 at 22nsec. So, the output changes 0 -> 1 -> 0 in 22nsec. Where I am doing wrong.
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec, then the time period of generated square wave is –I think it should be 22ns but it is give...
4.7k
views
asked
Oct 29, 2017
Digital Logic
digital-logic
test-series
+
–
0
votes
1
answer
65
DFS: Practice Exercise
Q1. Consider the following DFS algorithm for cycle detection in a graph. DFS(G) for each vertex u Belongs G.V u.color = WHITE U.pi = NIL time = 0 for each vertex u Belongs G.V if u.color == WHITE DFS-VISIT(G , u) DFS-VISIT(G, u) time = ... DFS tree if we draw an edge from one leaf node to another leaf node then that edge is called cross edge. Is this statement is true ??
Q1. Consider the following DFS algorithm for cycle detection in a graph.DFS(G) for each vertex u Belongs G.V u.color = WHITE U.pi = NIL time = 0 for each vertex u Belongs...
581
views
asked
Oct 28, 2017
Algorithms
algorithms
graph-algorithms
depth-first-search
+
–
0
votes
0
answers
66
Dynamic Programming: Collect maximum no of coin in grid
Why answer is not D)??
Why answer is not D)??
923
views
asked
Oct 27, 2017
2
votes
0
answers
67
Synchronization: A collection of Implications
1. Every 2 process solution satisfy Bounded waiting. I think yes 2. Every 3 or more process solution satisfy Bounded waiting. I think no. Determine Which of the following Implications Holds- 1. Deadlock -> ! Bounded Wait 2. Deadlock --> ! ... 8. ! Starvation --> ! Deadlock 9. ! Starvation --> Bounded Wait 10. BW --> ! Starvation.
1. Every 2 process solution satisfy Bounded waiting. I think yes2. Every 3 or more process solution satisfy Bounded waiting. I think no.Determine Which of the following I...
234
views
asked
Oct 23, 2017
1
votes
1
answer
68
Transactions Serializable schedule and Unserializable Schedule
Some where I have read, that WR, RW, WW problem occurs only in un-serializable schedule, and Irrecoverable problem, cascade less rollback problem and lost update problems occur in serializable schedule. Is the above statement true or false?
Some where I have read, that WR, RW, WW problem occurs only in un-serializable schedule, and Irrecoverable problem, cascade less rollback problem and lost update problems...
422
views
asked
Oct 22, 2017
Databases
databases
transaction-and-concurrency
concurrency
+
–
3
votes
1
answer
69
Value at and Address of Operator in C
#include <iostream> using namespace std; int main() { int i = 10; int *p; p = &i; printf("%u\n%u\n%u", *&p, &*p, &i); } All will give same answer. Suppose Adress of i = 100, and since p is pointing to i, it will have value at p = 100, and suppose address of p = 200. How, to evaluate it?
#include <iostream using namespace std; int main() { int i = 10; int *p; p = &i; printf("%u\n%u\n%u", *&p, &*p, &i); }All will give same answer.Suppose Adress of i = 100,...
702
views
asked
Oct 20, 2017
3
votes
0
answers
70
DFS: certain nodes not pushed to the stack.
Which of the following are true:- 1. DFS continues to visited first unvisited successor of each node as long as possible. 2. Certain nodes are pushed into the stack. 3. DFS first visits all the immediate successors of a node before moving to their ... nodes are pushed into the stack. 3. False -- this happens in BFS not in DFS. 4. True -- Iterative DFS.
Which of the following are true:-1. DFS continues to visited first unvisited successor of each node as long as possible.2. Certain nodes are pushed into the stack.3. DFS ...
738
views
asked
Oct 20, 2017
Algorithms
algorithms
depth-first-search
graph-algorithms
data-structures
+
–
2
votes
0
answers
71
DFS: number of nodes not pushed into the stack.
I have seen these following question:- Number of Vertices pushed more than once. https://gateoverflow.in/5296/number-of-vs-that-are-pushed-more-than-once-in-a-dfs https://gateoverflow.in/98484/dfs-using-stack Vertices not pushed ... and every vertex pushed exactly once into the stack http://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/.
I have seen these following question:-Number of Vertices pushed more than once.https://gateoverflow.in/5296/number-of-vs-that-are-pushed-more-than-once-in-a-dfshttps://ga...
2.0k
views
asked
Oct 18, 2017
DS
data-structures
stack
depth-first-search
+
–
0
votes
0
answers
72
Data Structure: Find 7th smallest element in Min heap
In a binary min heap with n elements, the 7th smallest element can be found in _____ ? Answer given is O(logn) and solution:- Delete the 1st smallest element O(logn) Delete the 2nd smallest element O(logn) .... ... this solution the data arrangement of the heap will be changed after performing these operation. any better solution than this???
In a binary min heap with n elements, the 7th smallest element can be found in _____ ?Answer given is O(logn) and solution:-Delete the 1st smallest element O(logn)Delete ...
1.5k
views
asked
Oct 18, 2017
Programming in C
binary-heap
time-complexity
algorithms
+
–
4
votes
0
answers
73
Precedence and Associativity of Logical AND and OR
Consider the following Program:- #include <stdio.h> int main() { short a = 1, b = 1, c = 1, d; d = ((a++ || b++ && c++) || 1); printf("a= %d, b = %d, c= %d, d= %d", a,b,c,d) ... 1; Even though the precedence of AND is greater than that of OR, which means && should be executed before ||, but it is not happening. Why??
Consider the following Program:-#include <stdio.h int main() { short a = 1, b = 1, c = 1, d; d = ((a++ || b++ && c++) || 1); printf("a= %d, b = %d, c= %d, d= %d", a,b,c,d...
799
views
asked
Oct 15, 2017
Programming in C
programming-in-c
+
–
3
votes
1
answer
74
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
asked
Oct 12, 2017
Set Theory & Algebra
set-theory&algebra
directed-graph
relations
+
–
3
votes
1
answer
75
Rossen: Permutation and Combination
What is the probability of these events when we randomly select a permutation of {1, 2, . . . , n} where n ≥ 4? a) n precedes 1 and n −1 precedes 2. b) n precedes 1 and n precedes 2.
What is the probability of these events when we randomly select a permutation of {1, 2, . . . , n} where n ≥ 4?a) n precedes 1 and n −1 precedes 2.b) n precedes 1 and...
1.6k
views
asked
Oct 12, 2017
Probability
engineering-mathematics
combinatory
+
–
1
votes
0
answers
76
Preposition Logic: Verify the solution
Which of the following propositional statements is TRUE ? A) ∀x ∀z ∃y [ P(x,y) ]---> ∃y ∀x ∀z [ P(x,y) ] B) ∃y ∀x ∀z [ P(x,y) ]---> ∀x ∀z ∃y [ P(x,y) ] I think in this A) False B) True Explanation:- Domain :- ... part is True. By the rule of implication, False -> True = True Finally conclude that: A) False B) True. Let me know where it is going wrong.
Which of the following propositional statements is TRUE ?A) ∀x ∀z ∃y [ P(x,y) ] - ∃y ∀x ∀z [ P(x,y) ]B) ∃y ∀x ∀z [ P(x,y) ] - ∀x ∀z ∃y [ P(x,y) ]I...
446
views
asked
Oct 6, 2017
Mathematical Logic
discrete-mathematics
propositional-logic
+
–
5
votes
3
answers
77
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
asked
Oct 4, 2017
Computer Networks
computer-networks
sliding-window
go-back-n
+
–
1
votes
1
answer
78
Border Gateway Protocol
Why BGP is an application layer Protocol? Ref :- https://en.wikipedia.org/wiki/Border_Gateway_Protocol
Why BGP is an application layer Protocol?Ref :- https://en.wikipedia.org/wiki/Border_Gateway_Protocol
1.5k
views
asked
Oct 3, 2017
Computer Networks
computer-networks
network-layering
application-layer-protocols
+
–
1
votes
2
answers
79
State True or False: Classes of Grammar and respective automata
Consider the following statements:- I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine. II) Type-1 grammar generate exactly all languages that can be recognized by a linear bounded automata. ... a both are type 3 grammar but both represent same regular expression as a+ what is wrong in this??
Consider the following statements:-I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine.II) Type-1 grammar generate exactly all ...
2.1k
views
asked
Oct 2, 2017
Theory of Computation
theory-of-computation
regular-expression
regular
finite-automata
+
–
1
votes
2
answers
80
Count the no of various Gates required in Carry Generator and look ahead adder
Count the 2 Input And, OR and EX-OR gates required in Carry Generator and Look ahead adder. Note :- In the question it is asking about 2 input, not multiple input, for Multiple input AND gates in n bit carry generator we require (n(n+1))/2 and OR Gates n.
Count the 2 Input And, OR and EX-OR gates required in Carry Generator and Look ahead adder.Note :- In the question it is asking about 2 input, not multiple input,for Mult...
1.2k
views
asked
Sep 30, 2017
Digital Logic
digital-logic
carry-generator
look-ahead-adder
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register