GATE CSE Doubts

0 votes

0 answers

Self Doubt: Linearly Independent eigen vectors
Is the number of linearly independent eigen vector same as number of linearly independent eigen values?

asked 1 hour ago in Mathematical Logic by Debapaul (615 points) | 24 views

0 votes

1 answer

Algorithms Recurrence relation : Ace test series

answered 1 hour ago in Algorithms by tp21 (228 points) | 18 views

0 votes

0 answers

Computer organization and architecture : Ace test series

asked 2 hours ago in CO & Architecture by Chirag Shilwant (150 points) | 10 views

0 votes

0 answers

TOC : ACE TEST SERIES

asked 2 hours ago in Theory of Computation by Chirag Shilwant (150 points) | 8 views

0 votes

0 answers

OS : Ace test series

asked 2 hours ago in Operating System by Chirag Shilwant (150 points) | 22 views

0 votes

0 answers

TOC Ace test series

asked 2 hours ago in Theory of Computation by Chirag Shilwant (150 points) | 4 views

0 votes

0 answers

gatebook compiler design lexical analysis
Which of the following is a disadvantage of lexical analysis ? A. You need to spend significant time reading the source program and partitioning it in the form of tokens B. More effort is needed to develop and debug the lexer and its token ... is D, but how C is correct, compiler works at compile time and how there can be an overhead at runtime?

asked 2 hours ago in Compiler Design by neeraj_bhatt (235 points) | 4 views

0 votes

0 answers

Gatebook lexical analysis
If the lexical analyzer finds a lexeme that matches with any existing reserved word, it generates an error. Because lexical analyzer follows _____ A. Longest Match Rule B. Rule priority C. Keyword - Out Rule D. None of this Answer given is B, Can someone please explain how it is B?

asked 2 hours ago in Compiler Design by neeraj_bhatt (235 points) | 6 views

0 votes

0 answers

Self Doubt : TOC
Q. REL(which is REC) $\cup$ REL(which is not REC) =?

asked 2 hours ago in Theory of Computation by Chirag Shilwant (150 points) | 3 views

0 votes

0 answers

Gatebook Compiler Design
Which of the following would be least likely to be stored in the symbol table of a compiler? A. the type of an identifier B. the location where an identifier will be stored C. the number of bytes required for a particular named type D. the type of a complex expression Answer is Option D, but how?

asked 2 hours ago in Compiler Design by neeraj_bhatt (235 points) | 2 views

0 votes

0 answers

Gatebook Compiler Design test series
Consider the following statements related to lexical errors S1 : A character sequence that cannot be scanned into any valid token is a lexical error. S2 : Misspelling of identifiers, keyword, or operators are considered as lexical errors. Which of the above statement ... S1 and S2 D. Neither S1 or S2 I'm getting answer as B, but they have given solution as D.

asked 2 hours ago in Compiler Design by neeraj_bhatt (235 points) | 4 views

0 votes

0 answers

Made Easy test series os multi subject synchronization

asked 2 hours ago in Operating System by Ram Swaroop (155 points) | 1 view

0 votes

0 answers

Self Doubt regarding lexical analysis
How lexical errors can be resolved? Can someone please provide a link.

asked 2 hours ago in Compiler Design by neeraj_bhatt (235 points) | 4 views

0 votes

0 answers

Computer organization : Ace

asked 3 hours ago in CO & Architecture by Chirag Shilwant (150 points) | 6 views

0 votes

1 answer

Made Easy Test (TOC)

answered 4 hours ago in Theory of Computation by SuvasishDutta (157 points) | 14 views

0 votes

0 answers

applied gate mock:dbms
given the SQL quey: SELECT * FROM A WHERE A.T1 NOT IN (SELECT B.T3 FROM B) Number of tuples returned by the above SQL query is:

asked 7 hours ago in Databases by abhinav649 (50 points) | 8 views

0 votes

0 answers

applied gate:mock

asked 7 hours ago in Computer Networks by abhinav649 (50 points) | 5 views

0 votes

0 answers

PREVIOUS YEAR MATH SELF DOUBT
https://gateoverflow.in/41/gate2012-9 WHY (7pi)/4 IS NOT CONSIDERED?

asked 7 hours ago in Calculus by eyeamgj (27 points) | 4 views

0 votes

1 answer

Self doubt graph theory Hamilton graph
graph G which has a cut edge cannot be Hamiltonian ?

answered 8 hours ago in Graph Theory by pranay562 (912 points) | 33 views

0 votes

0 answers

GATE GURU: CSE MATHS
Say in GATE instead of 65 questions there are 61 questions from 11 subjects where 10 subjects contain $6$ questions each and the remaining one contain $1$ question only. In how many ways the paper can be set to satisfy this constraint? Ans should be 11 right? as we need have $11\choose1$ ways

asked 8 hours ago in Mathematical Logic by Debapaul (615 points) | 9 views

0 votes

0 answers

Techtud-Compiler
Recursive descent parsing can use left recursive grammars. Is this statement True or False?

asked 9 hours ago in Compiler Design by srestha (636 points) | 9 views

0 votes

1 answer

applied gate :CN(congestion window)
this sunday immmediately after sam initiates the connection ,alice decides to send him a 60 KB pic using TCP.assuming she sends the pic in 2500 B segments including 50 B header over a 2Mbps link with a propagation delay of 30 ms, ... last ACK ?tcp implements a slow start mechanism with initial congestion window of 1.neglect all other delays amd packet looses.

answered 18 hours ago in Computer Networks by toxicdesire (215 points) | 25 views

0 votes

1 answer

Made easy test series : Pipelining concept
Consider the following 4-stages instruction pipeline where different instructions are spending different amount of time at different stages. Following loop is executed in the pipeline: How many cycles are required for above execution?

answered 21 hours ago in CO & Architecture by neeraj_bhatt (235 points) | 18 views

0 votes

1 answer

GATE MOCK TEST 3 GATE 2019 Q60 Combinatorics
I tried like this: Required probability= ways to put 3balls in box 1 / total ways to put 12 balls in 3 box = number of solutions to x1+x2=9 / number of solutions to x1+x2+x3=12 Will it not worth with star and bar method?

answered 21 hours ago in Combinatory by neeraj_bhatt (235 points) | 13 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q32 DBMS
Is there any trickfor solving such questions quickly. It wasted a lot of time still I couldn’t get it right

asked 22 hours ago in Databases by DukeThunders (408 points) | 12 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q26 Cache
Here they did not ask for to which set 17th block will go to. Then it would have been 17 mod 2 = 1. Here they asked in which cache block it is present. I drew 4 cache lines (2 sets, each having 2 lines) and traced out the block requests and my final ... Line 0: 15 Set 1: Line 1: 17 ( so I called it the 4th line) Not sure what's the correct way to answer this.

asked 22 hours ago in CO & Architecture by DukeThunders (408 points) | 8 views

0 votes

0 answers

Applied course test series- DS
Which of the following statements is/are true? Converting an adjacency matrix representation to an adjacency list representation takes O(V+E) time. In any connected undirected graph with exactly 5 simple cycles (that do not share any edges), there are at most 10 ... between every pair of vertices Options: Only I Only II Both I and II Neither I nor II PS.: Answer is d.

asked 23 hours ago in DS by Shubhranshu Maurya (8 points) | 8 views

0 votes

0 answers

Made Easy CBT-1
1) The Number of Solution set(x,y) for the equation 4x+7y=3, such that -99<=x<=99 and -100<=y<=100, where x,y belongs to Integers. 14 b. 29 c. 15 d. 30

asked 23 hours ago in Combinatory by Dheeraj Varma (7 points) | 11 views

0 votes

0 answers

Applied course test series : Algebraic Structures
Let G be a finite group. S1: We can show that the number of elements in G of order greater than 2 must be even. S2: We can conclude that any group of even order must contain an element of order 2 Which of the above statements are correct?

asked 23 hours ago in Set Theory & Algebra by Shubhranshu Maurya (8 points) | 6 views

0 votes

0 answers

operatingSystem deadlock
how no mutual exclusion is there? and also Deadlock one of the necessary condition is Mutual exlcusion.

asked 23 hours ago in Operating System by kalra05 (27 points) | 6 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q42 Networks
I got 320 bits using the formula efficiency = N / (1+2a) . I took N=63 because in GBN N is the sender window size which is used to calculate efficiency. Still there’s such a huge difference between 320 bits and 81301 bytes. where did I do wrong. pls help. thanks

asked 23 hours ago in Compiler Design by DukeThunders (408 points) | 4 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q48 Compiler
From the placement of the semantic actions it can be said that it is L attributed grammar and not S attributed. If it was S attributed the actions would be placed strictly at the end. So here why are they saying bottom up parsing? ... the actions on first encounter (instead of waiting till the reduction is performed). The answer matched too. I am confused.

asked 23 hours ago in Compiler Design by DukeThunders (408 points) | 5 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 – REPORTS

asked 1 day ago in Theory of Computation by DukeThunders (408 points) | 7 views

0 votes

0 answers

Made easy test series : Process scheduling SRTF
Consider the following set of process: Operating system uses preemptive shortest remaining time first algorithm, average waiting time ________ (ms). (Upto 1 decimal places) [Ties are broken with lowest process ID number] Note: (i) Consider only ... . (iii) I/O of the process can be done parallelly. Can someone provide gantt chart for above question?

asked 1 day ago in Operating System by vishal burnwal (117 points) | 12 views

0 votes

0 answers

Ace test series mock test cn

asked 1 day ago in Computer Networks by Harshq (6 points) | 12 views

0 votes

0 answers

#ProcessScheduling
Does FIFO cause starvation??

asked 1 day ago in Operating System by nandani17 (29 points) | 10 views

0 votes

0 answers

#MadeEasyTOC
Someone plz explain I option Answer given is II and III are cfg. If (a^x)(b^y) | x=y^2 then will it be cfg??

asked 1 day ago in Theory of Computation by nandani17 (29 points) | 8 views

0 votes

1 answer

The maximum value of the minimum degree in connected planar bipartite graph is ____? [closed]

answered 1 day ago in Mathematical Logic by shashin (1.2k points) | 29 views

0 votes

0 answers

applied gate :maths

asked 1 day ago in Mathematical Logic by abhinav649 (50 points) | 28 views

0 votes

0 answers

MADE EASY FULL TEST 7 advance level
the number of even palindromes over the alphabet {p,q,r} upto length n equals 121? what is n? I calculated for 0,2,4,6,8 and individual comes out to be 1,3,9,18,69 and it adds upto 100, so how answer can be 8?(they have given 8 as answer) what is the mistake?

asked 1 day ago in Combinatory by Rajat Maheshwari (10 points) | 17 views

To see more, click for the full list of questions or popular tags.

Recent questions and answers

3,008 questions

1,516 answers

8,991 comments

89,815 users