GATE Overflow for GATE CSE
Login Register
@
  • Dark Mode
  • Profile
  • Edit my Profile
  • Messages
  • My favorites
  • Register
  • Activity
  • Q&A
  • Questions
  • Unanswered
  • Tags
  • Subjects
  • Users
  • Ask
  • Previous Years
  • Blogs
  • New Blog
  • Exams
Dark Mode
Filter
  • User MiNiPanda
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Questions by MiNiPanda

0 votes
0 answers
1
Pg 345 Question 23, 6th Edition KH Rosen
How many strings of three decimal digits do not contain the same digit three times? have exactly two digits that are 4s? I know question is easy but the answer is not matching with the one given over here Please someone verify.. Does the word “string” mean that we can take 0 as the first digit as well?
asked in Combinatory Feb 27, 2019
237 views
  • kenneth-rosen
  • discrete-mathematics
0 votes
0 answers
2
Made Easy Gate Mock-2 Question 56
In the given network system, station A needs to send a payload of 1600 B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is ______________
asked in Computer Networks Jan 18, 2019
605 views
  • made-easy-test-series
3 votes
0 answers
3
MadeEasy Full Length Test 2019: Databases - Er Diagram
Consider the following ER diagram: How many number of relations are required for the above ER diagram? 2 3 5 1 Solution: My doubt is: Since $E_2$ isn't involved in total participation with $E_1$ so on merging we might get 2NF ... 2-NF violation. So by default which case is to be considered when normalization form is not mentioned?? 1-NF?
asked in Databases Jan 18, 2019
534 views
  • databases
  • er-diagram
  • made-easy-test-series
2 votes
0 answers
4
MadeEasy Full Length Test 2019: Theory of Computation - Identify Class Languages
Consider the following language over ∑={0,1} $L_{1} = \left \{ a^{\left \lfloor \frac{m}{n} \right \rfloor}| m,n \geq 1; n<m \right \}$ $L_{2} = \left \{ a^{m^{n}}| m,n \geq 1; n<m \right \}$ Which of them are regular? Both L1 and L2 Only L2 Only L1 None Ans. A. Both Please explain.
asked in Theory of Computation Jan 15, 2019
669 views
  • identify-class-language
  • theory-of-computation
  • made-easy-test-series
0 votes
0 answers
5
MadeEasy Full Length Test 2018: Digital Logic - Number Representations
2’s complement representation of the number $(-89)_{10}$ is 7 5 4 3 I don’t understand their solution. Please help.
asked in Digital Logic Jan 15, 2019
448 views
  • digital-logic
  • number-representation
  • made-easy-test-series
5 votes
0 answers
6
MadeEasy Test Series 2019: Computer Networks - Congestion Control
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ transmission timeout occurs and enters in the congestion detection ... transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?
asked in Computer Networks Jan 15, 2019
1.4k views
  • computer-networks
  • congestion-control
  • made-easy-test-series
0 votes
0 answers
7
MadeEasy Test Series 2019: Theory of computation - Grammer
Let L be the language of all strings on [0,1] ending with 1. Let X be the language generated by the grammar G. $S \rightarrow 0S/1A/ \epsilon $ $A \rightarrow 1S/0A$ Then $L \cup X= $ ∅ ∑* L X Ans given : B. ... a language which contains all strings that do not end with 1. But is it so? Can't we generate 11 from the grammar? Please verify.
asked in Theory of Computation Jan 15, 2019
584 views
  • theory-of-computation
  • grammar
  • made-easy-test-series
1 vote
1 answer
8
MadeEasy Test Series: Programming & DS - Hashing
Consider the hashing table with m' slots and n' keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in successful search is _____(Up to 2 decimals) Ans. 1.647 Here by default ... given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing, I am getting around 1.61
asked in Programming Jan 2, 2019
654 views
  • made-easy-test-series
  • data-structures
  • hashing
0 votes
0 answers
9
MadeEasy Full Length Test: Programming & DS - Programming in C
Consider the following function foo() void foo(int n) { if(n<=0) printf("Bye"); else { printf("Hi"); foo(n-3); printf("Hi"); foo(n-1); } } Let P(n) represent the recurrence relation indicating ... P(-2) But nothing is mentioned about P value when n<0. How to solve for P(-2) and other negative values?
asked in Programming Jan 2, 2019
387 views
  • made-easy-test-series
  • programming-in-c
2 votes
1 answer
10
MadeEasy Full Length Test 2019: General Aptitude - Probability
A packet of 20 batteries is known to include 4 batteries that are defective. If 8 batteries are randomly chosen and tested, the probability that finding among them not more than 1 defective is Ans: 0.5033 Solution provided: How can we apply Binomial distribution ...
asked in Quantitative Aptitude Jan 2, 2019
1.1k views
  • general-aptitude
  • quantitative-aptitude
  • probability
  • made-easy-test-series
1 vote
0 answers
11
MadeEasy Test Series: Operating System - Process Synchronization
Consider the following 2 functions P and Q which share 2 common variables A and B: P() Q() { { A=A+5; A=B+6; B=A-3; B=A-2; } } If P and Q execute concurrently, the initial value of A=2 and B=3 then the sum of all different values that B can take ____ (do not count B=3) Why have they taken intermediate values of B like 4..? :/
asked in Operating System Jan 2, 2019
587 views
  • made-easy-test-series
  • operating-system
  • process-synchronization
0 votes
0 answers
12
Made Easy Basic FT-2 Question 11
In a 4-bit binary ripple counter, for every input clock pulse All the flip flops get clocked simultaneously Only one flip flop get clocked at a time Two flip flops get clocked at a time All the above statements are false Ans. D Why not B? The i/p clock is given to the LSB flip flop isn’t it?
asked in Digital Logic Jan 2, 2019
3.9k views
  • made-easy-test-series
  • digital-logic
0 votes
1 answer
13
MadeEasy Test Series: General Aptitude - Geometry
Triangles ABC and CDE have a common vertex C with the side AB of triangle ABC being parallel to side DE of triangle CDE. If the length of side AB=4 cm and length of side DE=10 cm and perpendicular distance between sides AB and DE is 9.8 cm ... $cm^2$ . Now here I don't understand why they have taken BCD and ACE on the same line! Isn't this possible?
asked in Quantitative Aptitude Jan 2, 2019
773 views
  • made-easy-test-series
  • general-aptitude
  • geometry
1 vote
0 answers
14
Condition for regular language to be infinite
Given M = (Q,Σ,δ,q0,F) a DFA with n states. Prove: The language L(M) is infinite iff it contains a string with length t, where n ≤ t < 2n. Please provide a prove. I am not getting it from the resources available on the ... we can accept infinite no. of strings isn't it? Then why doesn't this condition suffice? Please point out where I am going wrong.
asked in Theory of Computation Nov 30, 2018
2.4k views
  • theory-of-computation
  • finite-automata
  • regular-language
2 votes
2 answers
15
Test Series : Checking Bounded Waiting
How does option B ensure Bounded Waiting? Process A can keep on entering the CS while process B tries to enter the CS but keeps on spinning over Wait(P). I mean if there is no context switch from A to B then A can keep on visiting the CS as many times as possible(no bound on the no. of times it enters) making B to wait.
asked in Operating System Oct 2, 2018
2.0k views
  • operating-system
  • bounded-waiting
  • process-synchronization
0 votes
0 answers
16
Test Series - Compiler Design Doubts
Doubt 1 : The answer is 3. When it is asked to find min. no. of temporary variables then we get 3. But here temporary is not mentioned still we have to assume that temporary is implicit? Doubt 2: The answer given is 4. But my ... the rules it shouldn't be in a separate block right? Doubt 4: Is this statement True or False. Please give reason to support.
asked in Compiler Design Aug 16, 2018
280 views
  • compiler-design
0 votes
0 answers
17
ISI 2016 C2 B
The CPU of a system having an execution rate of 1 million instructions per second needs 4 machine cycles on an average for executing an instruction. On an average, 50% of the cycles use memory bus. For execution of the programs, the system utilizes ... in-status, check-status, branch and read/write in memory, each requiring one machine cycle. Please explain the solution with details.
asked in CO and Architecture May 10, 2018
175 views
  • userisi2016
  • usermod
0 votes
1 answer
18
ISI-2017 C3 (a)
Let R(A,B,C) be a relation with primary key (A) and S(A,D,E) a relation with primary key (A,D). Each of the relations has n tuples. If the number of tuples in R natural join S is m, then determine the number of tuples in R natural left outer join S.
asked in Databases May 9, 2018
443 views
  • userisi2017
  • usermod
  • databases
1 vote
1 answer
19
Finding max value of X in MST
I have this doubt that if the maximum value of x is to be found so that it is included in MST, then will it be 3 or 4? Because if it is 3 then there is no doubt that it would be included in the MST but if it is 4 then also it may get ... one should I consider? If the opposite was asked i.e. the minimum value of x so that it never gets included in MST then it is 5.
asked in Algorithms Feb 2, 2018
497 views
  • algorithms
  • minimum-spanning-tree
9 votes
0 answers
20
MadeEasy Test Series 2018: Programming & DS - Stack
Given finite alphabet S = {A, B, C} and stack S of size 100. There are only three stack operations we can perform as mentioned below. Stack is initially empty and we do not perform pop ( ) on empty stack. Assume that only emit ( ) can print output ... to get A B C A C B A as output are ______. I am getting 15 but it is given 14. Please help.
asked in DS Jan 26, 2018
1.1k views
  • data-structures
  • stack
  • made-easy-test-series
Page:
  • 1
  • 2
  • 3
  • next »

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
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 Posts

  • GO Classes NIELIT Test Series For 2023
  • Interview Experience : MTech Research(Machine Learning) at IIT Mandi
  • DRDO Scientist -B
  • ISRO Scientist-B 2023
  • BARC RECRUITMENT 2023

Subjects

  • All categories
  • General Aptitude (2.8k)
  • Engineering Mathematics (9.7k)
  • Digital Logic (3.4k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.7k)
  • Non GATE (1.4k)
  • Others (2.4k)
  • Admissions (667)
  • Exam Queries (1.0k)
  • Tier 1 Placement Questions (17)
  • Job Queries (77)
  • Projects (9)
  • Unknown Category (867)

Recent Blog Comments

  • Left with 10days, nothing heard back from them,...
  • I have updated the blog. Thanks for mentioning it.
  • Mtech(RA) CSE IIT Bombay Project 14 ?
  • Thanks man @ijnuhb because of u i cleared...
  • Yes : 720 General
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • GATER
  • Contact Us
Developed by Chun