Questions by Sanket_

1 vote

2 answers

1

E R model
why not b) option

asked in Databases Feb 8, 2017

718 views

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.

asked in Theory of Computation Jan 30, 2017

592 views

0 votes

0 answers

3

sql Query
i am not getting Q3.

asked in Databases Jan 30, 2017

209 views

0 votes

1 answer

4

mux and flipflop

asked in Digital Logic Jan 30, 2017

740 views

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

asked in Graph Theory Jan 28, 2017

705 views

0 votes

0 answers

6

no. of relations

asked in Databases Jan 28, 2017

212 views

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.

asked in Databases Jan 25, 2017

1.1k views

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)

asked in Programming in C Jan 11, 2017

159 views

0 votes

0 answers

9

viable prefix

asked in Compiler Design Jan 8, 2017

477 views

1 vote

1 answer

10

critical section
getting A) given D)

asked in Operating System Jan 5, 2017

583 views

1 vote

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

asked in CO and Architecture Jan 2, 2017

895 views

1 vote

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) ?

asked in Algorithms Jan 2, 2017

600 views

3 votes

2 answers

13

FLIP FLOP
plz make the waveform diagram for Q

asked in Digital Logic Jan 2, 2017

562 views

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

asked in Graph Theory Dec 26, 2016

1.9k views

1 vote

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

asked in Computer Networks Dec 25, 2016

1.7k views

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%

asked in Computer Networks Dec 25, 2016

4.0k views

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)

asked in Algorithms Dec 20, 2016

226 views

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 ?

asked in Programming in C Dec 19, 2016

284 views

1 vote

1 answer

19

ROM-no. of OR Gates

asked in Digital Logic Dec 18, 2016

603 views

0 votes

0 answers

20

pipeline

asked in CO and Architecture Dec 16, 2016

138 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Sanket_

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by Sanket_

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments