Recent questions - GATE CSE Doubts

0 votes

0 answers

Doubt on PYQ in Computer Networks
https://gateoverflow.in/3732/gate2004-it-88 Here we are asked to give – “maximum possible value of the current transmit window”. Why are we answering the current transmit window after the reception of two acks? The max size of current transmit window is 12000B(=receiver window size) right?

asked 2 hours ago in Computer Networks by nvs16 (9 points) | 3 views

0 votes

0 answers

I have a LL(1) problem
S -> Abc|aAcb A -> b|c|ε I think the first one is LL(1) S -> aAS|b A -> a|bSA But the problem is second one. There's no conflict problem, but I think it doesn't satisfy right-recursion. I'm not sure about those problems.

asked 8 hours ago in Compiler Design by hjj0525 (5 points) | 5 views

0 votes

0 answers

Gatebook test series
Why option B is not correct here ? B’coz he can be a politician as he thinks about politics.

asked 1 day ago in Mathematical Logic by Raj_81 (5 points) | 23 views

0 votes

0 answers

TOC self doubt
L={ a^m b^n | m,n>=0} We know above language is regular as it doesn’t need any comparisons…. But Here L={ϵ, a,b,abb,aab,aabbb………...} If we take aabbb and if we apply Pumping Lemma by taken u=a, v=ab and w=bb let i=1 then we get aababbb which will not be in given language then how come it is regular? Where am i going wrong?

asked 1 day ago in Theory of Computation by Pathki Shivamsh (9 points) | 10 views

0 votes

0 answers

Self DOubt on CSMA/CD
https://gateoverflow.in/1397/gate2005-74 Why in this question is the collision noise not enough to detect the collision? Why is the sender waiting for the jamming signal to reach it? If the collision happened at midway it wouldn't wait for the jamming signal. Why are we considering jamming signal transmission time?

asked 1 day ago in Computer Networks by nvs16 (9 points) | 8 views

0 votes

0 answers

computer Architecture
standard book for the computer architecture? especially clearing the concept for the memory organization ??

asked 1 day ago in CO & Architecture by Raghv183 (5 points) | 2 views

0 votes

0 answers

Igate review test
Consider the following C program: main () { in /*this program has error */x; float /*no error */y; print f ("its very simple"); } Identify the error produced by the above code: (A) Lexical (B) Syntax (C) Both(A) & (B) (D ... in is not defined identifier. But, I am confused as no return type to main() can also generate a syntax error. Which should be considered first?

asked 1 day ago in Compiler Design by abhi97.dutta (5 points) | 10 views

0 votes

0 answers

IGNOU EXAM QUERIES
We use heuristics to reduce the number of plans considered and thereby to reduce the cost of query evaluation. Heuristic rule(s) for transforming relational algebra queries include. (1) Perform selection operations as early as possible (2) Perform projections early (3) Avoid cartesian products (4) All of the above

asked 1 day ago in GATE by GD Rana (5 points) | 3 views

0 votes

1 answer

Made Easy Practice Set
Match list-1 and List-2: List 1: compilation, interpretation, macro definition, loading List 2: runtime specification, exception, object specification, abbreviation Can any help me to get a correct match, I am unable to understand a single match ... specification? Please help clarifying the meaning of every single term used in list 1 and list 2 and correct answer also.

asked 2 days ago in Compiler Design by Mohitac (5 points) | 9 views

0 votes

1 answer

Made easy workbook
Consider the rule of C programming language, "every variable must be declared before its use". In which of the following phase of compiler will an error violating this rule be detected? Code Generation Lexical analysis Semantic analysis Syntax analysis

asked 2 days ago in Compiler Design by Mohitac (5 points) | 10 views

0 votes

0 answers

ALGO doubt : Made easy test series
https://gateoverflow.in/167339/madeeasy-subject-test-programming-%26-ds-heap The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are

asked 2 days ago in Algorithms by S.R. (433 points) | 6 views

0 votes

1 answer

made easy postal
The correct order of buffer sizes in stop and wait, GBN and SR is: (STOP and Wait) < GBN < (selective repeat) why??

asked 2 days ago in Computer Networks by Rashimdixit (5 points) | 7 views

0 votes

0 answers

#TOC Whether give languages are DCFL or just CFL?
Please explain for all these 4 languages about which of them are DCFL and which are just CFL only? Thank you.

asked 2 days ago in Theory of Computation by iarnav (67 points) | 5 views

0 votes

2 answers

Applied test series
Minimum number of States in a DFA , that accepts all strings of 0s and 1s ,whose integer equivalent are not divisible by 2 OR 3

asked 2 days ago in Theory of Computation by Ashutosh777 (23 points) | 34 views

0 votes

0 answers

Identify Min no.of 2 input NAND gate require to represent the following?

asked 2 days ago in Digital Logic by rsharma9229 (5 points) | 18 views

0 votes

0 answers

Made Easy Test Series
Why Option B is not right. As no multivalued attributes are allowed in tables?

asked 2 days ago in Databases by Karan01 (5 points) | 20 views

0 votes

0 answers

TOC self doubt
How to prove L={a ^n^2:n≥0} is not context free using Pumping Lemma?

asked 3 days ago in Theory of Computation by Pathki Shivamsh (9 points) | 10 views

0 votes

1 answer

Applied Scholarship Test
A)1/16 B)1/15 C)1/4 D)NONE

asked 3 days ago in Combinatory by Ashutosh777 (23 points) | 17 views

0 votes

1 answer

Applied scholarship test
The number of straight lines that can be drawn through 90 points.Given that 10 of them lie on a straight line.

asked 3 days ago in Combinatory by Ashutosh777 (23 points) | 29 views

0 votes

0 answers

FOURTH SEMESTER B.TECH DEGREE EXAMINATION, December 2018, APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

asked 4 days ago in Databases by njb (5 points) | 9 views

0 votes

0 answers

Made easy workbook os memory management
Consider a computer system with logicala addresss space and physicaladdress space of 216 Bytes. Page size is 512 Bytes. Page table entry size is 2 bytes. If page table entry contain besides frame some other information like one bit for ... many bits are still availble in the page table entry to store aging information of the page? Memory is byte addressable

asked 4 days ago in Operating System by Scion_of_fire (47 points) | 5 views

0 votes

0 answers

#madeeasy-test-series #COA
Consider a 5 stage pipeline with IF, ID, EX, MEM and WB latencies 8, 6, 10, 6 and 4 respectively (in ns). If EX stage is made 100% faster, the percentage it will improve the performance CPU is __________%.

asked 4 days ago in CO & Architecture by 404 found (11 points) | 12 views

0 votes

1 answer

#applied test series
On any given Sunday, Sam initiates a connection with his girlfriend Alice in order to plan out what movie they're going to watch on Tuesdays with Morrie. This Sunday, immediately after Sam initiates the connection, Alice decides to send him a 60 KB ... congestion window of 1. Neglect queuing and processing delays at both the sender and receiver, and assume there are no losses.

asked 4 days ago in Computer Networks by vps123 (5 points) | 41 views

0 votes

0 answers

TOC Self Doubt
L1= a^n b^n| n>=0 L2=ww^r | w ϵ (a+b)* what will be the prefix(L1),Suffix(L1) and prefix(L2),Suffix(L2) ??? Please Explain in detail

asked 5 days ago in Theory of Computation by Pathki Shivamsh (9 points) | 17 views

0 votes

0 answers

nielit-2018-dec-cs-it-sceintist-b
Identify the correct nodes and edges in the given intermediate code: (1) i=1 (2) t1=5*I (3) t2=4*t1 (4) t3=t2 (5) a[t3]=0 (6) i=i+1; (7) if i<15 goto(2)

asked 5 days ago in Compiler Design by mohan123 (17 points) | 6 views

0 votes

0 answers

# MadeEasy test

asked 5 days ago in Theory of Computation by raviranjan21 (5 points) | 20 views

0 votes

1 answer

how to calculate throughput of ethernet
consider csma/cd topology where propogation delay is 1 sec , transmission delay is 5 sec what is the throughput?

asked 6 days ago in Computer Networks by abhi_3_0_12 (5 points) | 17 views

0 votes

0 answers

Cormen Page 44 , Para 2
Statement : It is not contradictory, however, to say that the worst-case running time of insertion sort is Ω(n^2 ), since there exists an input that causes the algorithm to take Ω(n^2 ) time . What does this statement mean as they are talking about worst case but are using Big Omega notation?

asked 6 days ago in Algorithms by Ankit Raina 7 (5 points) | 19 views

0 votes

0 answers

Following C code why it is correct to use graph->array[i].head and graph->array[i]->head gives error?

asked 6 days ago in Programming by shashank023 (5 points) | 9 views

0 votes

0 answers

Minimum size of multiplexer
Suppose only one multiplexer and two inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed?

asked 6 days ago in Digital Logic by tx3ha (5 points) | 21 views

0 votes

0 answers

PREVIOUS YEAR ALGORITHM DOUBT
https://gateoverflow.in/549/gate1992-01-ix E1 E2 E3 .En are sorted edges step1;pick E1 put it in MST ..O(1) step 2: then check for cycle detection ..O(n+m) using dfs,O(n+m) using union finding,O(logn) using some improved version ... repeat step 1 and 2 similary n*[O(1)+logn] when using (log n) for cycle detection =O(nlog n) is this the corrrect approach ?

asked 6 days ago in Algorithms by eyeamgj (21 points) | 11 views

0 votes

2 answers

Ace academy test series

asked 6 days ago in Theory of Computation by sanjaysharmarose (5 points) | 28 views

0 votes

0 answers

Minimum NAND/NOR Gates
Minimum NAND/NOR Gates - Realization for ExOR, ExNor, Adder, Subtractor if the complement of input is also given.

asked Sep 24 in Digital Logic by tx3ha (5 points) | 31 views

0 votes

0 answers

Self Doubt (PYQ)
https://gateoverflow.in/2716/gate1996-1-12 In this question it is said that linked list is more efficient that array for basic operations. If I consider the operations Insert, Delete (pointer given), Find the time complexities are as follows – Insert – LL → O(1), Array → O(n) Delete – LL → O(n), Array → O(1) Find – LL → O(n), Array → O(n). How is linked list more efficient.

asked Sep 24 in DS by Mellophi (325 points) | 21 views

0 votes

0 answers

GO-gate-pyq-ques
In this gate pyq ques i am trying it with an example and matching option C but i m not getting the 180 shift. where am i going wrong??? is there something wrong with the example.??? https://gateoverflow.in/887/gate2006-8

asked Sep 24 in Digital Logic by Ashutosh777 (23 points) | 10 views

0 votes

0 answers

UGC NET CS 2015 Jun - II
Which of the following algorithms sort n integers, having the range 0 to (n2 - 1), in ascending order in O(n) time ? A Selection sort B Bubble sort C Radix sort D Insertion sort

asked Sep 24 in Algorithms by Musa (5 points) | 9 views

0 votes

0 answers

GO-gate-pyq-ques
https://gateoverflow.in/8215/gate2015-2-42 in this ques total 4bytes means 32 bits has to be added into the 016E but we are adding just 4 bits and ans is 0172. 0000 0001 0110 1110 0000 0000 0010 0000 0000 0001 1000 1110 it should be 018E i know i am going wrong somewhere but please someone clear this

asked Sep 23 in CO & Architecture by Ashutosh777 (23 points) | 10 views

0 votes

0 answers

Should I take a drop in employment to attempt GATE CSE?

asked Sep 23 in Others by siddharths067 (11 points) | 22 views

0 votes

0 answers

PREVIOUS YEAR GATE ALGORITHM
https://gateoverflow.in/457/gate2008-45 IN THIS QUESTION AFTER APPLYING THE Dijkstra's algorithm ..how we can conclude that cost is computed is correct or not ? do we need manual cross check for grahs having negative edges?

asked Sep 23 in Algorithms by eyeamgj (21 points) | 11 views

0 votes

1 answer

Self Doubt (PYQ)
https://gateoverflow.in/549/gate1992-01-ix In this question the time complexity is given as O((n+m)$\alpha$(n)). In Horowitz it is said that on average it is O(1) for find, then shouldn’t it be O(n+m).

asked Sep 22 in Algorithms by Mellophi (325 points) | 9 views

Page:

1
2
3
4
...
207
next »

Recent questions

8,260 questions

2,618 answers

12,874 comments

95,312 users