Register
Filter

Answers by Hradesh patel

1 votes
33
Geeks - Doubt
What is time complexity of fun()? int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } (A) O(n^2) (B) O(nLogn) (C) O(n) (D) O(nLognLogn)
What is time complexity of fun()?int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count;}(A) O(n^...
2 votes
34
addressing modes in coa.
A computer supports one address and two address instructions. All the Addresses are the memory addresses. Memory size is 1Mbyte. How many one address instructions are possible if it has 240 two addresses instructions? (Assume binary instructions code has 48 bits)
A computer supports one address and two address instructions. All the Addresses are the memory addresses. Memory size is 1Mbyte. How many one address instructions are pos...
0 votes
35
Recoverable cascading lost update and strict
2 votes
36
UGC NET CSE | July 2018 | Part 2 | Question: 21
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\Theta (\lg \: m)$ $\Theta (m)$ $\Theta (m\lg m)$ $\Theta (\lg\lg m)$
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is$\Theta (\lg \: m)$$\Theta (m)$$\Theta (m\lg m)$$\Theta (\lg\lg m)$
2 votes
37
Time Complexity
What will be TC here? Ans given $O(n^{2})$ , while I am getting $O(n)$
What will be TC here?Ans given $O(n^{2})$ , while I am getting $O(n)$
0 votes
39
Regular languages
Kindly give the reason behind 2 and 3?
Kindly give the reason behind 2 and 3?
1 votes
40
Computer networking
The number of following network standards do not use CSMA / CD protocol ___________ . I. Ethernet II. Wifi III. Bluetooth IV. Wife max
The number of following network standards do not use CSMA / CD protocol ___________ .I. Ethernet II. WifiIII. Bluetooth IV. Wife m...
0 votes
41
MADE EASY TEST SERIES
Consider L1 be a language in which number of b’s is thrice the number of a’s. L2 be a language in which every ‘a’ is being followed by exact 3 b’s. Which of the following is correct ?
Consider L1 be a language in which number of b’s is thrice the number of a’s. L2 be a language in which every ‘a’ is being followed by exact 3 b’s. Which of the...
2 votes
42
MADE EASY TEST SERIES
Consider the following ER diagram The minimum number of relations tables required for above ER diagram are __________ .
Consider the following ER diagramThe minimum number of relations tables required for above ER diagram are __________ .
4 votes
43
MADE EASY TEST SERIES
Consider a micro programmed control unit which support 360 instructions. Each instruction takes 10 micro operations, 14 flags are supported and 60 control signal vertical microprogrammed control is used then the size of 4 control words is ______ bytes
Consider a micro programmed control unit which support 360 instructions. Each instruction takes 10 micro operations, 14 flags are supported and 60 control signal vertical...
0 votes
46
Ethernet
Determine the maximum length of cable (in km) for transmitting data at a rate of 5 mbps in a Ethernet LAN frames of size 1000 Bytes and propagation speed is 3 × 108 m/sec. Your Answer: 240 Correct Answer: 48 Status: incorrect
Determine the maximum length of cable (in km) for transmitting data at a rate of 5 mbps in a Ethernet LAN frames of size 1000 Bytes and propagation speed is 3 × 108 m/se...
2 votes
47
Testbook
0 votes
49
Test series questions
1 votes
51
Branch Prediction
5 votes
52
DAG
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is: (A) $a+a+(a+a+a)$ (B) $a+a+(a+a+a+(a+a+a+a))$ (C) $a+a+(a+a+a+(a+a+a))$ (D) None
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is:(A) $a+a+(a+a+a)$(B) $a+a+(a+a+a+(a+a+a+a))$...
1 votes
53
Latency in memory access
3 votes
54
MadeEasy Subject Test: Computer Networks - Icmp
When a strict routing has been specified by the source but can’t be followed by the intermediate routers, such events will be reported by ICMP???
When a strict routing has been specified by the source but can’t be followed by the intermediate routers, such events will be reported by ICMP???
1 votes
56
Test by Bikram | Databases | Test 1 | Question: 29
A functional dependency of the form x → y is trivial if y ⊆ x y ⊂ x x ⊆ y x ⊂ y
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
1 votes
57
Test by Bikram | Databases | Test 1 | Question: 30
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________. $m+n$ and $0$ $m+n$ and $|m-n|$ $mn$ and $0$ $mn$ and $m+n$
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
1 votes
58
Find out the set of F.D for which R (ABCD) is in 2NF but not in 3NF
Find out the set of F.D for which R (ABCD) is in 2NF but not in 3NF
Find out the set of F.D for which R (ABCD) is in 2NF but not in 3NF
–1 votes
59
ME FLT-2
NEED=REQUEST-ALLOCATION. am i right?
NEED=REQUEST-ALLOCATION. am i right?
Page: