GATE CSE Doubts

0 votes

2 answers

madeesy workbook
i have a doubt what if using gb4 and every 3rd packet lost and you have to send 10 packets then total no of transmission?

answered 8 minutes ago in Computer Networks by jayeshasawa001 (94 points) | 10 views

0 votes

1 answer

Finding Subnetmasks
Given a direct broadcast address find, subnet masks. DBA: 200.1.15.255

answered 45 minutes ago in Computer Networks by Ashutosh777 (137 points) | 11 views

0 votes

0 answers

compiler -design(LALR parser)
Of the foll. statements which of them is true? S1:Grammar which are parsed by LALR(1) parser cannot be parsed by LL(1) S2:Grammar which are parsed by LL(1) must be parsed by LR(1) S3:there is only one lookahead symbol in LALR. i know s1 is false and s2 is true but what about s3?

asked 2 hours ago in Compiler Design by abcd9982 (54 points) | 5 views

0 votes

2 answers

Self-Doubt. Algorithms (rather Maths). log(n!) < (log n)! ?

answered 2 hours ago in Algorithms by Arkaprava (191 points) | 21 views

0 votes

1 answer

Self Doubt: compiler Design
Is there any parser that can parse left recursive grammar?

answered 2 hours ago in Compiler Design by abcd9982 (54 points) | 8 views

0 votes

1 answer

GeeksforGeeks CD quiz
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? A. Removing left recursion alone B. Factoring the grammar alone C. Removing left recursion and factoring the grammar D. None of these Option (d) is given as the answer. How? Option c should be correct, no?

answered 2 hours ago in Compiler Design by premu (90 points) | 2 views

0 votes

1 answer

#Gate Forum Book

answered 2 hours ago in Compiler Design by premu (90 points) | 5 views

0 votes

1 answer

#ACE workbook
Minimal FA that accepts all the strings over $\sum$={a,b} where every string contains exactly 2 a’s and 3 b’s is contains?

answered 4 hours ago in Theory of Computation by Ashutosh777 (137 points) | 16 views

0 votes

0 answers

Self doubt in binary search tree
How many distinct binary search trees can be created out of 5 similar keys? and How many binary search trees can be created out of 5 similar keys? and How many binary search trees can be created out of 5 distinct keys?

asked 4 hours ago in DS by vijay kumar 2 (34 points) | 11 views

0 votes

1 answer

#made-easy-test-series
The Base and Bound register approach provides which of the following : I) Memory protection between processes II) Memory sharing between processes III) Expandable heap and stack IV)Protection of the kernel from user processes

answered 4 hours ago in Operating System by Nilabja Sarkar (17 points) | 22 views

0 votes

1 answer

#DBMS 2NF doubt
Consider a Relation R(ABCDEFG) with AB as key and a FD as below – DAE ------→ F Is this Relation R in 2NF?

answered 7 hours ago in Databases by jayeshasawa001 (94 points) | 11 views

0 votes

1 answer

Explain this briefly
2^n 2^n-1 (2^n-1)-1 n^2

answered 8 hours ago in Combinatory by jayeshasawa001 (94 points) | 26 views

0 votes

1 answer

I think the answer made easy gave is incorrect
How can G1 and G2 be isomorphic as in G2 we have a node of degree 2 and in G1 there is no node of degree 2 .

answered 8 hours ago in Graph Theory by jayeshasawa001 (94 points) | 13 views

0 votes

1 answer

What is the type of dependency present in the functional dependency?

answered 8 hours ago in Databases by Nilabja Sarkar (17 points) | 17 views

0 votes

1 answer

Does anyone have videos of Compilers by Alex Aiken?

answered 8 hours ago in Study Resources by Arkaprava (191 points) | 13 views

0 votes

1 answer

Geeks for Geeks Topic Test
Which of the following is not true about comparison-based sorting algorithms. The minimum possible time complexity of a comparison-based sorting algorithm is O(N log N) for a random input array. Any comparison-based sorting algorithm can be made stable by using ... . Heap Sort is not a comparison-based sorting algorithm. Choose the correct option. 1,2. 2,4. 4. 2.

answered 10 hours ago in Algorithms by jayeshasawa001 (94 points) | 19 views

0 votes

1 answer

Made Easy Theory Book - Network Layer
A company is granted the site address 181.56.0.0 (Class B). The company needs 1000 subnets. What is the DBA of the first subnet?

answered 10 hours ago in Computer Networks by jayeshasawa001 (94 points) | 11 views

0 votes

0 answers

MADE EASY TEST SERIES GATE 2020-2021
A trunck of 4000km long operates at 1.5Mbps is used to transmit 32 bytes frame and uses sliding window protocol, if propagation speed is 4μs/km, number of bits required for sequence number?

asked 12 hours ago in Computer Networks by shashankrustagi2021 (12 points) | 10 views

0 votes

1 answer

Algorithms (Time Complexity)
The outer loop is running O(log(n)) times and the inner loop is running O(n) times. The answer is given O(n). Will it be the same case if the time complexity of the inner loop is more than the outer loop? Please give a solution with complete analysis.

answered 19 hours ago in Algorithms by Arkaprava (191 points) | 10 views

0 votes

0 answers

#made -easy-test-series
Which of the following is not a disadvantage of disabling interrupts to serialize access to a critical section? 1)User code cannot utilize this technique for serializing access to critical section 2)Interrupt controllers have a limited number of physical ... critical events to be missed. 4)This technique could not be used to enforce a critical section on a multiprocessor

asked 19 hours ago in Operating System by 404 found (16 points) | 11 views

0 votes

0 answers

#made-easy-test-series
The paged virtual address approach provides which of the following I) Memory protection between processes II) Memory sharing between processes III) Expandable heap and stack IV) Protection of the kernel from user processes

asked 19 hours ago in Operating System by 404 found (16 points) | 5 views

0 votes

0 answers

madeeasy test
consider the function f(w,x,y,z)=∑m(0,4,5,10,14,15)+d(7,13). number of essential prime implicants are?

asked 19 hours ago in Digital Logic by sonam13 (6 points) | 8 views

0 votes

0 answers

IIT Bombay CSE exam 2021
CS 348: Computer Networks Endsem: 19th Nov 2012, 14:00 - 17:00 a) When using CRC, how many bits are in the checksum when using the generator polynomial x^4+x+1 ? b) A channel has a bit-rate of 4Kbps and a propogation delay of 20msec. For what ... . How should the message be encrypted so that it is only understood by B, and B is sure that the message was indeed sent by A?

asked 21 hours ago in Computer Networks by shashankrustagi2021 (12 points) | 11 views

0 votes

1 answer

#Gate Forum Preparation #Compiler design

answered 1 day ago in Compiler Design by jayanth (9 points) | 12 views

0 votes

0 answers

Self Doubt, #OS #Process Management. Maximum number of Processes

asked 1 day ago in Operating System by munishchaturvedi (10 points) | 20 views

0 votes

1 answer

Made Easy Postal study Package
A liist has n-strings where each string is of length n. Using divide and conquer approach, what is the worst case running time(tightest upper bound) to find the first string? NOTE: First string is a string which appears first when all strings are sorted into the lexicographical order. A)O(n^2) B)O(n) C)O(n logn) D)O(n^2 logn)

answered 1 day ago in Algorithms by munishchaturvedi (10 points) | 14 views

0 votes

1 answer

#Self Doubt - How many ip addresses are wasted on subnetting on a network?

answered 1 day ago in Computer Networks by anurag sharma (62 points) | 21 views

0 votes

1 answer

Why congestion control is required in transport layer again, as network layer can take care of it?

answered 1 day ago in Computer Networks by anurag sharma (62 points) | 9 views

0 votes

1 answer

Self Doubt - (Transport Layer)
Can someone explain if the size data transfered between the sender and reciever depends on the maximum segment size decided in the connection or according to the window size of the reciever availble?

answered 1 day ago in Computer Networks by anurag sharma (62 points) | 12 views

0 votes

0 answers

Self Doubt - Gate2018-51
source : https://gateoverflow.in/204126/gate2018-51 In the answer part given by arjun sir he is trying to say that there are $2^{16}$ instruction encodings. What are these? How to think that we have to consider encodings and not the instructions after reading the question?

asked 1 day ago in CO & Architecture by Kushagra गुप्ता (500 points) | 7 views

0 votes

0 answers

Self doubt - Gate1995-1-3
Source : https://gateoverflow.in/2590/gate1995-1-3 In this question the answer given as B. How? Vectored interrupts like RST 7.5, RST 6.5 etc and the ISR for each one of them is stored in the IVT and if I go to the IVT there I will ... present. So is it not the answer should be A. I think B option clearly tells us about non-vectored interrupts. Please someone clarify this.

asked 1 day ago in CO & Architecture by Kushagra गुप्ता (500 points) | 7 views

0 votes

0 answers

Process synchronization Using Semaphores
Consider the following scenario and suggest an appropriate synchronization mechanism using semaphores. Two processes P1 and P2 share a resource in critical section. P1 always enter critical section first regardless of runtime order. P1 enters critical section two times ... P1 is allowed. Sample run -> P1 P1 P2 P1 P1 P2 P1 P1 P2 . . . continues

asked 1 day ago in Operating System by Daman jaggi (6 points) | 7 views

0 votes

1 answer

CSMA CD question
Question Source is Made easy test series Consider a CSMA CD with frame size 20KB and Transmission rate to be 10Kbps, what is the maximum length of the cable (km) if signal speed is 15kmps

answered 1 day ago in Computer Networks by Mellophi (159 points) | 14 views

0 votes

1 answer

please someone clear this doubt i think johnson counter will have 8 states here so 8*(1ms+0.1ms)

answered 1 day ago in Digital Logic by shashankrustagi2021 (12 points) | 29 views

0 votes

1 answer

#compiler design

answered 1 day ago in Compiler Design by s123 (9 points) | 11 views

0 votes

0 answers

Madeeasy Test Series

asked 1 day ago in Digital Logic by Ashish Lakhmani (6 points) | 13 views

0 votes

1 answer

someone please explain option a) here and tell if its true or false

answered 1 day ago in Algorithms by Mellophi (159 points) | 26 views

0 votes

1 answer

GeeksforGeeks CD quiz

answered 1 day ago in Compiler Design by premu (90 points) | 11 views

0 votes

1 answer

Made easy postal study package
Give the result of partitioning the keys. T H I S C O U R S E I S O V E R after the 1st pass of quick sort. Choose the last elements as pivot elements(R). Also for duplicates, adopt the convention that both pointers stop. A)EHIOCOIERRUSSVTS B)EHISCOIERRUSOVTS C)EHIOCOUESRTSSVTR D)EHIOOCIERRUSSVTS (PLEASE SOMEONE SOLVE THIS)

answered 1 day ago in Algorithms by Mellophi (159 points) | 16 views

0 votes

0 answers

Self doubt - GATE2007-IT-44
Question source : https://gateoverflow.in/3479/gate2007-it-44-isro2015-34 This question has a discussion that average seek time : $\frac{N}{3}$ Source PAGE 9 : http://pages.cs.wisc.edu/~remzi/OSFEP/file-disks.pdf Another source : https://en. ... provide some easy explanation with your words that how it ends up $\frac{N}{3}$ as I am getting difficulty to visualize.

asked 1 day ago in Operating System by Kushagra गुप्ता (500 points) | 1 view

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

Recent questions and answers

7,751 questions

1,856 answers

11,222 comments

95,105 users