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 Sanket_
1
votes
2
answers
1
E R model
why not b) option
why not b) option
747
views
asked
Feb 8, 2017
Databases
er-diagram
+
–
0
votes
0
answers
2
language of pda
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
i think it should be d) because it is not satisfying same no. of a's and b's constraint on some input like aa,bb.
607
views
asked
Jan 30, 2017
0
votes
0
answers
3
sql Query
i am not getting Q3.
i am not getting Q3.
212
views
asked
Jan 30, 2017
0
votes
1
answer
4
mux and flipflop
753
views
asked
Jan 30, 2017
2
votes
0
answers
5
euler and ham cycle
Which of the following statements is true? Every complete graph contain Hamiltonian cycle Every complete graph contain Euler cycle Both (a) and (b) None of the above It should be none of the above because when no. of vertices are 2 it doesnt follow these conditions
Which of the following statements is true?Every complete graph contain Hamiltonian cycleEvery complete graph contain Euler cycleBoth (a) and (b)None of the aboveIt should...
717
views
asked
Jan 28, 2017
0
votes
0
answers
6
no. of relations
220
views
asked
Jan 28, 2017
0
votes
1
answer
7
left outer join
Find the equivalent Tuple Relational Calculus query for the following: R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relational Algebra.
Find the equivalent Tuple Relational Calculus query for the following:R ⟕ S , where R(A, B) and S(A, C) are the relations and ⟕ is the left outer join symbol in Relat...
1.1k
views
asked
Jan 25, 2017
0
votes
0
answers
8
parse tree
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative while operator ‘+’ to left associative. What is the parse tree for expression (5 + 2 – 7 + 3 – 4)
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative whi...
166
views
asked
Jan 11, 2017
0
votes
0
answers
9
viable prefix
483
views
asked
Jan 8, 2017
1
votes
1
answer
10
critical section
getting A) given D)
getting A) given D)
610
views
asked
Jan 5, 2017
1
votes
1
answer
11
Operand forwarding
given-13 my answer-12 plz verify. I0 IF ID OF PO WO I1 IF ID OF PO PO WO I2 IF ID OF PO WO I3 IF ID OF PO PO PO PO WO 1 2 3 4 5 6 7 8 9 10 11 12
given-13my answer-12plz verify.I0IFIDOFPOWO I1 IFIDOFPOPOWO I2 IFID OFPOWO I3 IFID OFPOPOPOPOWO 123456789101112
917
views
asked
Jan 2, 2017
1
votes
0
answers
12
preorder complexity
time complexity to construct bst from preorder? a) O(n) b)O(nlogn) c)O(n^2) d)O(1) given O(nlogn) my doubt:- there are two approaches one that gives O(nlogn) (by finding the inorder traversal) and the other that gives O(n) :- set a ... >data..max .. INT_MAX}. reference:-http://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/ so shouldn't it be O(n) ?
time complexity to construct bst from preorder?a) O(n) b)O(nlogn) c)O(n^2) d)O(1)given O(nlogn)my doubt:- there are two approaches one that gives O(nlogn) (by finding the...
607
views
asked
Jan 2, 2017
3
votes
2
answers
13
FLIP FLOP
plz make the waveform diagram for Q
plz make the waveform diagram for Q
573
views
asked
Jan 2, 2017
2
votes
1
answer
14
connectivity
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected? a)m – n + 2 b)$_{2}^{m}\textrm{C}-n+2$ c)n – 2 d)None of the above
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of e...
1.9k
views
asked
Dec 26, 2016
1
votes
1
answer
15
CSMA/CD
A 1 KM long CSMA/CD with a propagation delay 5 microsec has 10 mbps bandwidth.Repeaters are not allowed in the system.Data bits of 224 ,header bits of 32 bits are in packet.One slot time is reserved for the sender to start its transmission and another slot time ... total data=224 total time =2*slottime +2*Tp+Tt is this approach correct ? in the solution they are only considering 1 slot time
A 1 KM long CSMA/CD with a propagation delay 5 microsec has 10 mbps bandwidth.Repeaters are not allowed in the system.Data bits of 224 ,header bits of 32 bits are in pack...
1.8k
views
asked
Dec 25, 2016
3
votes
2
answers
16
Ethernet
What is the maximum theoretical percent utilization in a 802.3 LAN (that uses 10 base 5 cable) with 128 stations connected to five 500 meter segments. The data rate is 10 Mbps. Assume the frame size is 256 bytes and standard slot time is 51.2 μsec. (A) 70% (B) 90% (C) 80% (D) 60%
What is the maximum theoretical percent utilization in a 802.3 LAN (that uses 10 base 5 cable) with 128 stations connected to five 500 meter segments. The data rate is 10...
4.1k
views
asked
Dec 25, 2016
Computer Networks
ethernet
lan-technologies
+
–
0
votes
0
answers
17
complexity
Which of the following is correct? a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n)) c)Both (a) and (b) d)None of the above ans given is b) but there is nothing given about functions so it is possible that there is some function like-. f(n)=n and g(n)=n^(2*sinn) then we cannot say anything i think it should be d)
Which of the following is correct?a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))c)Both (a) and (b)d)None of the aboveans give...
243
views
asked
Dec 20, 2016
0
votes
0
answers
18
Confusion- hashing
What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) . there are two derivations given one leads to 1/(1-α) and the other leads to 1/2(1+1/(1-α)^2) plz explain the distinction ?
What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) .there are two derivatio...
296
views
asked
Dec 19, 2016
1
votes
1
answer
19
ROM-no. of OR Gates
607
views
asked
Dec 18, 2016
0
votes
0
answers
20
pipeline
143
views
asked
Dec 16, 2016
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register