Recent questions without answers

Recent questions without answers

0 votes

0 answers

1

How is the MTech in Computer Technology program in IIT Delhi?
How is the MTech in Computer Technology program in IIT Delhi compared to MTech CSE in other old IITs/top NITs, in terms of placement opportunities and research opportunities?

Pabitra Sahoo asked in IISc/IITs 7 hours ago

by Pabitra Sahoo

5 views

0 votes

0 answers

2

Why class A network addresses has a restraint of "not taking initial and final network address" , while other classes won't

Infinity_love asked in Computer Networks 13 hours ago

by Infinity_love

16 views

0 votes

0 answers

3

Databases
Someone Please Solve it

GateOverflow04 asked in Databases 13 hours ago

by GateOverflow04

11 views

0 votes

0 answers

4

ISA architrecture
Write a stack-based program that computes the following function : 5+(3x7) – 8, assuming that the stack starts out empty

shima abdullah asked in CO and Architecture 1 day ago

by shima abdullah

26 views

0 votes

0 answers

5

I am not able to understand how the value of 'i' is 3 after the execution of the program, it must be 2.

Hrithik Vashishtha asked in Programming 1 day ago

by Hrithik Vashishtha

47 views

0 votes

0 answers

6

BigEndian C compiler
Hi, can anyone please suggest me an online site where I can run code in C and test how the code will act under bid endian environment?

yuyutsu asked in Programming 2 days ago

16 views

0 votes

0 answers

7

For which of the following does there exist a tree satisfying the specified constraints? (a) A binary tree with 65 leaves and height 6. (b) A binary tree with 33 leaves and height 5.

qweas8671 asked in DS 3 days ago

57 views

0 votes

0 answers

8

Question on Pipelining
In a pipeline the maximum ideal speed-up is 5. Let the percentage of unconditional branches in a set of typical program be 5% and that of conditional branches be 10%. If 70% of the conditional branches are taken, calculate % loss of speed-up due to branch instructions. It is very difficult to understand this question and solve it. Please help.

Swarnava Bose asked in CO and Architecture 3 days ago

by Swarnava Bose

25 views

0 votes

0 answers

9

concurrency control
question about concurrency control methods

jayadev asked in Databases 3 days ago

25 views

0 votes

0 answers

10

what is the running time of the following iterative algorithm? b) It is possible to talk about the best, average and worst running times for this algorithm. Why?

usdid asked in Algorithms 3 days ago

by usdid

30 views

0 votes

0 answers

11

B) Construct DFA for the following regular expressions and assure the minimum number of states in the constructed DFA. (i) ab*a*(a/b) (ii) 1(1+0)* + 10(0 + 1) *

ankitak70853211234 asked in Compiler Design 3 days ago

by ankitak70853211234

27 views

0 votes

0 answers

12

in a stack ISA, the postfix expression z = X Y x W U x +
In a stack ISA, the postfix expression z = X Y x W U x +

shima abdullah asked in CO and Architecture 3 days ago

by shima abdullah

23 views

0 votes

0 answers

13

please tell me whether the Branch & Bound concept and NP Hard & NP Complete concepts are there for gate or not in algorithms?

Vijay_Ram asked in Algorithms 3 days ago

19 views

0 votes

0 answers

14

How to submit a test i don't find any key for submission of test
In test tab there is no any submissions test option.

Anjali Sahu asked in Others 6 days ago

21 views

0 votes

0 answers

15

Automatic Repeat Request
Consider an ARQ algorithm running over a 20-km point-to-point fiber link. (a) Compute the propagation delay for this link, assuming that the speed of light is 2 × 10^8 m/s in the fiber. (b) Suggest a suitable timeout value for the ARQ algorithm to use. (c) Why might it still be possible for the ARQ algorithm to time out and retransmit a frame, given this timeout value?

seba aburayyan asked in Computer Networks Jun 29

by seba aburayyan

28 views

0 votes

0 answers

16

HCU PHD 2018 JUNE
Suppose there are three relations as given below: (x) R(a,b)= (0,1),(4,5),(8,9). (y) S(b,c )=(1,2),(5,2),(5,6),(5,10),(13,10). (z) T( c,d)=(2,3),(6,7)(10,11),(10,3) the number of tuples in (R * S) * T, where * is the full natural outer join, is: (a) 5 (b) 8 (c) 13 (d) 60

mohit jain asked in Databases Jun 25

27 views

0 votes

0 answers

17

KVS Part B 2018
______ operation preserves those tuples that would be lost in____ (a) Natural join, Outer join (b) Outer join, Natural join (c) Left Outer Join, Right Outer Join (d) Left Outer Join, Natural Join

mohit jain asked in Databases Jun 25

18 views

0 votes

0 answers

18

TNPSC 2017
the materialization approach of query evaluation includes (from root to leaf) : (a) π, ∞, σ (b) π, σ, ∞ (c) σ, π, ∞ (d) σ, ∞, π

mohit jain asked in Databases Jun 25

9 views

0 votes

0 answers

19

CIL 2020
the ____ defines a set of operations on relations, paralleling the usual algebraic operations such as addition, subtraction or multiplication, which operates on numbers. (a) Relational Calculas (b) Referential Integrity (c) Relational Algebra (d) Relations

mohit jain asked in Databases Jun 25

14 views

0 votes

0 answers

20

CIL
relations and fields can be renamed in relational algebra using the renaming operator (a) ρ (b) σ (c) ∅ (d) ⟕

mohit jain asked in Databases Jun 25

10 views

0 votes

0 answers

21

CIL Part B
Consider the following relation schema R and S along with their tuple sets. R(A, B) = { <a1, b1 >, <a2, b1>, <a3, b1>, <a4, b1>, <a1, b2>, <a3, b2>, <a2, b3>, <a3, b3>, <a4, b3>, <a1, b4>, <a2, b4>, <a3, b4> } S(A) = ... operation? A. T(B) = {b1, b2, b4} B. T(B) = {b1, b3, b4} C. T(B) = {b1, b4) D. T(B) = {b1, b3}

mohit jain asked in Databases Jun 25

13 views

0 votes

0 answers

22

CIL, UPPCL AE CS 2019
Consider the relation schemas R(A, B, C, D) and S(D, E, F). What will be the degree of the resultant schema R * S, where star (*) symbol represents the natural join operation? (A) 3 (B) 4 (C) 6 (D) 5

mohit jain asked in Databases Jun 25

15 views

0 votes

0 answers

23

appsc-2012-DL CA
The number of tuples in the result of a left outer join operation will always be (A) greater than the number of tuples in the result of the corresponding join operation. (B) at least equal to the number of tuples in the result of the ... of the corresponding join operation. (D) greater than the number of tuples in the result of the corresponding right outer join operation.

mohit jain asked in Databases Jun 25

16 views

0 votes

0 answers

24

Suggestion Requires
I don't know weather the time left for GATE 2023 preparation is enough or not but I have started my preparation and I'm fully committed to my preparation but I confused weather the plan I made is good or not. So I need help with that...following is the plan I made...can anyone please help and guide me!? Caption

Mr.Sudo asked in GATE Jun 23

103 views

0 votes

0 answers

25

implement binary to excess-3 code converter for 4-bits by preparing the truth table and using karnaugh maps for simplification.

jaybourny asked in Digital Logic Jun 23

41 views

0 votes

0 answers

26

In the 'Intersted variable' method for synchronization is there a possiblity of deadlock or spinlock?

JAINchiNMay asked in Operating System Jun 23

34 views

0 votes

0 answers

27

Stallings Computer Organization Problem
Consider two microprocessors having 8- and 16-bit-wide external data buses, respectively. The two processors are identical otherwise and their bus cycles take just as long a. Suppose all instructions and operands are two bytes long. By what factor ... and hence would be able to send 2 one byte instructions/data in one bus cycle. Can anyone solve this. Thanks

AngshukN asked in CO and Architecture Jun 22

36 views

0 votes

0 answers

28

Hi. My gate score is 403 with sc category. I have not gotten any offers on coap so far. What are the chances I may land admission in IITs?

Sumiii asked in IIITs Jun 17

by Sumiii

61 views

0 votes

0 answers

29

What is the empty 4 bytes below the "valid" variable?
int main(int argc, char *argv[]) { int valid = 0; char str1[8] = "start"; char str2[8]; gets(str2); if (strncmp(str1, str2, 8) == 0) valid = 1; printf("buffer1: str1(%s), str2(%s), valid(%d)\n", str1, str2, valid); }

Tejeshwara asked in Programming Jun 12

123 views

0 votes

0 answers

30

Practice Question | Unacademy
Consider the following statements (I) The two main function of data link layer are data link control and media access control (II) DLL guarantees reliable delivery of packets, hence no acknowledgements required. [A] Only I is true [B] Only II is true [C] Both are true [D] None Please explain your choice.

anupamsworld asked in Computer Networks Jun 12

by anupamsworld

72 views

Page:

1
2
3
4
5
6
...
523
next »

Follow @gateoverflow

Recent questions without answers

Search GATE Overflow for GATE CSE