Recent questions

0 votes

0 answers

1

Transport layer
What does this line means? UDP is no-frills extension of "best effort" IP

asked 1 hour ago in Computer Networks by nephron (287 points) | 1 view

0 votes

0 answers

2

#self doubt
Is counting semaphore can be implemented using only Binary semaphore and ordinary machine instruction.?

asked 4 hours ago in Operating System by Shubham Aggarwal Junior (601 points) | 8 views

0 votes

0 answers

3

Randomized Quicksort
True or False : In randomized quicksort , eack key is involved in the same number of comparisons.

asked 5 hours ago in Algorithms by Vaishnavi01 (85 points) | 10 views

0 votes

0 answers

4

Quick Sort Analysis
Consider the Quicksort algorithm.Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements.Let T(n) be the number of comparisons required to sort n elements.Then: A. T(n)<=2T(n/5)+n B. T(n)<=T(n/5)+T(4n/5)+n C. T(n)<=2T(4n/5)+n D. T(n)<=2T(n/2)+n

asked 5 hours ago in Algorithms by Vaishnavi01 (85 points) | 24 views

0 votes

0 answers

5

test series question

asked 6 hours ago in Programming by Richa Bandlas 1 (7 points) | 23 views

0 votes

0 answers

6

Self doubt
Is disks are in gate syllabus? Is the disk, sector seek time questions are coming?

asked 6 hours ago in Operating System by mitesh kumar (43 points) | 3 views

+1 vote

0 answers

7

digital
PLS EXPLAIN how will gray code work over here?

asked 7 hours ago in Digital Logic by Gate Fever (267 points) | 13 views

0 votes

0 answers

8

digitL
PLS EXPLAIN!!

asked 7 hours ago in Digital Logic by Gate Fever (267 points) | 9 views

0 votes

0 answers

9

digital
THE ABOVE CIRCUIT IS A MODULUS ______________ COUNTER ????

asked 7 hours ago in Digital Logic by Gate Fever (267 points) | 13 views

0 votes

0 answers

10

Doubt
The result of cross product of two DFAs is intersection of two languages or union of the two languages?

asked 7 hours ago in Theory of Computation by aditi19 Junior (689 points) | 13 views

0 votes

0 answers

11

DIGITAL
PLS EXPLAIN HOW IS IT WORKING?

asked 7 hours ago in Digital Logic by Gate Fever (267 points) | 13 views

0 votes

0 answers

12

number of tokens
Question: Find the number of tokens in the following C code using lexical analyzer of the compiler.

asked 8 hours ago in Compiler Design by syncronizing (443 points) | 8 views

0 votes

0 answers

13

sample question
If TCP round trip time is currently 20 ms and ACK comes in after 30 ms then what is the timeout period for next transmission . Use α=0.9 and β=2 I know that α is smoothening factor. what is meant by β?

asked 8 hours ago in Computer Networks by vk_9_1_9 (33 points) | 8 views

0 votes

0 answers

14

Digital: Compartor
How can the following circuit be equal to a comparaor?

asked 8 hours ago in Digital Logic by chauhansunil20th (205 points) | 7 views

0 votes

0 answers

15

SELF DOUBT
https://gateoverflow.in/188623/threads-conceptual I CAN ONLY TELL OPTION 3FALSE. I AM NOT ABLE TO GET OPTION 1 AND 2 . WHAT THEY MEAN???

asked 9 hours ago in Operating System by Deepanshu Active (1.8k points) | 7 views

0 votes

0 answers

16

GATE-2019 form filling
Is there anyone who is not able to fill the GATE 2019 form from past 2 or 3 days....???

asked 9 hours ago in GATE Application by Anmol Verma Active (1.4k points) | 9 views

0 votes

0 answers

17

digital ckts
What minimum size ROM is required to implement an unsigned 4 bit binary adder

asked 9 hours ago in Digital Logic by nethra (35 points) | 2 views

0 votes

1 answer

18

computer networks
A problem with __________ is that capacity is wasted because the medium will generally remain idle following the end of a transmission, even if there are one or more stations waiting to transmit. (A) 1-persistent CSMA (B) slotted ALOHA (C) p-persistent CSMA (D) nonpersistent CSMA

asked 9 hours ago in Computer Networks by Smishra95 (275 points) | 6 views

0 votes

0 answers

19

digital circuits
how many 4 input LUTs would be required in an FPGA to implement the function Y=AB+C'

asked 9 hours ago in Digital Logic by nethra (35 points) | 5 views

0 votes

0 answers

20

Workbook - DBMS (Made Easy)
A relation (from the relational database model) consist of a set of tuples, which implies that a) relational model supports multi-valued attributes whose values can be represented in sets. b) for any two tuples, the value associated with all ... with one or more of their attributes must differ. d) all tuples in a particular relation may have different attributes.

asked 10 hours ago in Databases by Sumit Singh Chauhan Active (1.3k points) | 9 views

0 votes

0 answers

21

Graph Theory

asked 11 hours ago in Graph Theory by Anuj1995 (277 points) | 17 views

0 votes

0 answers

22

Graph Theory

asked 11 hours ago in Graph Theory by Anuj1995 (277 points) | 28 views

+1 vote

0 answers

23

Graph Theory

asked 11 hours ago in Graph Theory by Anuj1995 (277 points) | 17 views

0 votes

0 answers

24

Self doubt
In CSMA CD: 1) Before starting transmission of frame station sense COMPLETE carrier or only its connection point ? example : if D is transmitting frame to E WIll A sense carrier as idle or busy 2) Lets take At time t = 5 Station A wants to send ... to send frame to E . WIll it be possible simultaneously ? Does detecting channel idle by two stations ALWAYS imply collision will happen ?

asked 11 hours ago in Computer Networks by jatin khachane 1 Junior (521 points) | 6 views

0 votes

0 answers

25

Graph Theory
What is line graph?

asked 11 hours ago in Graph Theory by Anuj1995 (277 points) | 20 views

0 votes

1 answer

26

time-complexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.

asked 11 hours ago in Algorithms by balaganesh (89 points) | 14 views

0 votes

0 answers

27

Binary-semaphones
The number of binary semaphores required to implement readers-writers code in busy waiting mode is ------------- answer given as 1. why 1 and why not 2?

asked 12 hours ago in Operating System by balaganesh (89 points) | 10 views

0 votes

1 answer

28

test series
Consider the following orders of transactions: T2:R(x); T3:W(x); T3:commit; T1:W(x); T1:commit; T2:R(y); T2:W(z); T2:commit; T4:R(x); T4:R(y); T4:commit. If S is serializable, then how many conflict serial orderings of S is possible? (A)10 (B)11 (C)8 (D)13

asked 12 hours ago in Databases by BOB (49 points) | 34 views

0 votes

0 answers

29

Find the no. of tokens
Find no of tokens in below program. #include<stdio.h> main() { int I; int *pi = &I; //parent pointer scanf("%d",pi); printf("%d\n", I+5); }

asked 14 hours ago in Compiler Design by sagar27 (11 points) | 31 views

0 votes

1 answer

30

GB-DSA-Test 3-Question 17
The line graph L(G) of a graph G(V, E) is a graph whose vertices are in 1-1 correspondence with the edges of G. Two vertices of L(G) being adjacent iff the corresponding edges of G are adjacent. Consider following graphs: Consider following statements: (i) L(A) is isomorphic to B. ... (iii) only (B) (ii) and (iii) only (C) (ii) and (iv) only (D) (ii), (iii) and (iv) only

asked 14 hours ago in Graph Theory by Sandy Sharma Junior (903 points) | 25 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

Recent questions

Recent Posts

Recent Blog Comments