GATE CSE Doubts

0 votes

0 answers

self doubt: compiler design
S → XY X → YS / a Y → YSYX / aYX / b eliminate left recursion (left recursion is present in last line of grammar, how can i remove it)

asked 1 hour ago in Compiler Design by pppankajsaini (14 points) | 3 views

0 votes

0 answers

SELF DOUBT CN
IS THERE ANY RELATION BETWEEN HIERARCHICAL ROUTING AND PATH VECTOR ROUTING THEY BOTH SEEMS SAME...

asked 2 hours ago in Computer Networks by eyeamgj (45 points) | 2 views

0 votes

2 answers

Normalization
R(ABCD) FD: { AB->C , C->AD} What is the highest normal form?

answered 1 day ago in Databases by Sumaiyas (11 points) | 29 views

0 votes

0 answers

book name: GATE 2020 Computer Science and Information Technology by Trishna Knowledge Systems , chapter:DBMS

asked 1 day ago in Databases by Venkatesh Akhouri (6 points) | 4 views

0 votes

0 answers

GOF, Made Easy
In this question Arjun sir has used operand forwarding from EX in I3 to EX in I4. Instead, can we think of it like split phase between EX in I3 to ID in I4? https://gateoverflow.in/34735/madeeasy-test-series-co-%26-architecture-pipelining

asked 1 day ago in CO & Architecture by pranavsettaluri9 (7 points) | 4 views

0 votes

0 answers

GOF, Made Easy
In this question Arjun sir has used operand forwarding from EX in I3 to EX in I4. Instead, can we think of it like split phase & operand forwarding between EX in I3 to ID in I4 like the gate 2015 question? https://gateoverflow.in/34735/madeeasy-test-series-co-%26-architecture-pipelining gate 2015: https://gateoverflow.in/8218/gate2015-2-44

asked 1 day ago in CO & Architecture by pranavsettaluri9 (7 points) | 4 views

0 votes

0 answers

COAP additional round query
Do we have to register separately to participate for additional rounds on COAP portal or will it get continued after the round 5?

asked 1 day ago in GATE by mickey_shubham (6 points) | 4 views

0 votes

1 answer

Are planar graphs and vertex and edge cover included in GATE 2021 syllabus?

answered 2 days ago in Graph Theory by premu (73 points) | 11 views

0 votes

0 answers

Computer Networks A top down approach by forouzan
a. A non-ASCII message of 1000 bytes is encoded using base64. How many bytes are in the encoded message? How many bytes are redundant? What is the ratio of redundant bytes to the total message? b. A message of 1000 bytes ... two previous cases. How much has the efficiency improved if the message is a combination of ASCII and non-ASCII characters?

asked 2 days ago in Computer Networks by rits78671 (6 points) | 5 views

+1 vote

0 answers

MadeEasyTestSeries

asked 3 days ago in Databases by Jithendra319 (9 points) | 14 views

0 votes

1 answer

Transactions
R1(X),w2(X),R3(X),W1(X),W3(X). Is this schedule is view serializable?

answered 3 days ago in Databases by Mk Utkarsh (511 points) | 18 views

0 votes

0 answers

source: gate overflow, chapter: algorithms, year: 1992

asked 4 days ago in Algorithms by Meghana518 (6 points) | 10 views

0 votes

0 answers

made easy test series :Stacks
S will remain same S will contain only e' S will contain e' followed by previous element of stack in same order S will contain e' followed by previous element of stack in reverse order at 2nd last line S contains only e' then S is ... none of options match the above logic BTW answer given by them is 2 is the question/options incorrect or my reasoning is wrong???

asked 4 days ago in DS by abcd9982 (11 points) | 7 views

0 votes

0 answers

made easy test series : Binary Tree
root → value = SumElements(root → left) root → value = SumElements(root → right) root → value = SumElements(root → left) + SumElements(root → right) SumElements(root → left) + SumElements(root → right) according to me ans shoul be none of ... + SumElements(root → left) + SumElements(root → right) but they have given ans is 3rd option.Am I missing something here??

asked 4 days ago in DS by abcd9982 (11 points) | 10 views

0 votes

0 answers

Madeeasy dbms workbook 2020 , chapter : relation algebra ,tuple relational calculus and sql, question number 15

asked 4 days ago in Databases by swatiChaudhary (6 points) | 21 views

0 votes

2 answers

UGC NET 2019 DECEMBER

answered 5 days ago in IS&Software Engineering by hiteshpujari (9 points) | 32 views

0 votes

0 answers

Madeeasy Programming and Data Structure Notes
In Dynamic Scoping , an extern variable will take value from Global Variable or Local variable , please tell me with respect to following question and also the printf results?

asked 5 days ago in Programming by Prakhar Garg (7 points) | 18 views

0 votes

1 answer

General Aptitude Self doubt
Consider a Circle with 100 points numbered 1,2,3,4, ..,99,100. Now their is a tortoise at point numbered 1 and a hare at point numbered 2 and both can only move in clockwise direction only on numbered points. Tortoise can move one point at time for ... until they meet at some point. Now find the point at which they meet or if they cannot meet at some point tell why??

answered 5 days ago in Numerical Ability by Shaik Masthan (669 points) | 24 views

0 votes

0 answers

Where is the cache tag directory data structure stored ?

asked 5 days ago in CO & Architecture by krish71 (6 points) | 7 views

0 votes

0 answers

Made easy test series
Consider a system using 2-level paging and the virtual address is 38 bits. The most significant 10 bits are used to index the page directory and next 16 bit index the page table. Each entry in both levels is 4 bytes. What is the maximum no. of page tables that a process can have?

asked 5 days ago in Operating System by Pawan_k (6 points) | 14 views

0 votes

1 answer

asked in made easy test series
Kindly explained this in detailed way, like why particular steps will come and reason behind it.

answered 5 days ago in CO & Architecture by srestha (754 points) | 26 views

0 votes

0 answers

ISI2015-MCQ-7
Let X be the set {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Define the set R by R = {(x, y) ∈ X ×X : x and y have the same remainder when divided by 3}. Then the number of elements in R is (A) 40 (B) 36 (C) 34 (D) 33

asked 6 days ago in Set Theory & Algebra by suparna kar (12 points) | 13 views

0 votes

0 answers

#NIELIT Technical Assistant_2016_march
Which of the following is not primitive recursive but computable ? A. Carnot function B.Riemann function C.Bounded function D.Ackermann function

asked 6 days ago in Algorithms by SubVer (6 points) | 4 views

0 votes

0 answers

first and follow -self duobt
S → SA/A A → T/a T → TA/ϵ find first(S), first(A), first(T) find follow(S), follow(A), follow(T)

asked 6 days ago in Compiler Design by pppankajsaini (14 points) | 3 views

0 votes

0 answers

pointers in 2d array
according to me answer is 1(3rd one ) but they have given 2 (2nd and 3rd ) are correct how can II be correct function signature?

asked 6 days ago in Programming by abcd9982 (11 points) | 34 views

0 votes

1 answer

compiler construction
Check if the following grammar is SLR(1), CLR(1). S → L = R | R L → * R | id R → L

answered 6 days ago in Compiler Design by Anirban Chand (41 points) | 7 views

0 votes

0 answers

TCS MockVita 2020 , Lazy Student
There is a test of Algorithms. Teacher provides a question bank consisting of N questions and guarantees all the questions in the test will be from this question bank. Due to lack of time and his laziness, Codu could only practice M questions. There ... problems. Codu can't solve the question he didn't practice. What is the probability that Codu will pass the test?

asked 6 days ago in Probability by pravincesingh (6 points) | 9 views

0 votes

1 answer

Context Free Language
Is this CFL? L = {wcwr | w, c ϵ {0,1}+ and |c| = 2}

answered 6 days ago in Theory of Computation by RavGopal (48 points) | 13 views

0 votes

0 answers

Made Easy Test Series
Consider 2 MBPS I/O device interfaced to 64 bit CPU in a programmed-I/O mode. Data transmission between the CPU and I/O in word-wise. Interrupt overhead is 3 μ/sec. What is the performance gain when the device is operating under interrup-I/O over programmed-I/O mode? A)2 B)2.5 C)1.33 D)2.66

asked 6 days ago in CO & Architecture by arpit_18 (7 points) | 8 views

0 votes

0 answers

Testbook Question
Consider below code , where integer k initialized to $0.$ while(k!=11){ k++; if(k%5==0) continue; fork(); } What is the total number of process created here?? while will be execute 1 to 10 and fork() will not execute for 5 and 10. So, my ans is $2^{8}=256$ but given ans 512. How?

asked 6 days ago in Operating System by srestha (754 points) | 14 views

0 votes

0 answers

Self doubt : Pipelining hazards
We are having a five-stage RISC architecture pipeline where the stages are instruction fetch ->decode->execute->memory access->write back, in which we are executing a single instruction ADD R1,R2,R3. As we can see that this ... a memory access stage then the total number of cycles required to execute this single instruction is 4 cycles or 5 cycles?

asked 6 days ago in CO & Architecture by bittujash (6 points) | 7 views

0 votes

0 answers

What-is-the-required-general-rank-for-getting-CSE-in-IIT-if-I-am-an-OBC-NCL-student

asked Jul 1 in Written Exam by ankeshsingh (7 points) | 5 views

0 votes

0 answers

which College can i get Mine Gate Score is 402 OBC NCL

asked Jul 1 in IISc/IITs by ankeshsingh (7 points) | 4 views

0 votes

0 answers

Self Doubt:Time Complexity
What is time complexity to find median of medians?

asked Jun 30 in Algorithms by srestha (754 points) | 28 views

0 votes

0 answers

Entity Relationship Diagram
Knowledge about mapping cardinalities

asked Jun 30 in Databases by arnabdana123 (6 points) | 9 views

0 votes

0 answers

PROBABILTY AND DISTRIBUTIONS
A elevator manufacturing company believes that 'X' is the amount of that can elevator withstand without any damage with is mean 100 and standard deviation 10. This elevator is used to lift the company staff persons with mean 5 and standard deviation 0.5. How many staff person would have to be in the elevator for the probability of No damage exceeds to 0.85.

asked Jun 30 in Mathematical Logic by Stanfordboi (6 points) | 7 views

0 votes

0 answers

Job Scheduler
As we know Job scheduler works on mainly 2 criteria - To maintain degree of multiprogramming and to maintain proper mixture of CPU bound and I/O bound processes and considering these 2 criteria, it will new process from New/Start to Ready State. So my question is how Job scheduler come to know that the process if CPU bound or I/O bound ???

asked Jun 29 in Operating System by lakshakar (6 points) | 10 views

0 votes

0 answers

Self Doubt infinte series
What will be the generalized form of the sum of square roots of n natural numbers?

asked Jun 28 in Study Resources by Gupta731 (8 points) | 10 views

0 votes

0 answers

Decidability In TOC
Turing Machine accepts a regurlar language. Is it decidable or not ?

asked Jun 28 in Theory of Computation by ajaybhardwaj1999 (6 points) | 16 views

+1 vote

1 answer

pushdown automata #CFL
Is the following language context-free language(CFL) or not? If yes, then is it Deterministic-CFL (DCFL)? L={ $a^i b^j$ where $i\neq 2*j+1$ and $j \geq 1$ and $i\geq 1$ }

answered Jun 28 in Theory of Computation by RavGopal (48 points) | 33 views

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

Recent questions and answers

7,545 questions

1,783 answers

10,867 comments

90,484 users