Questions by MiNiPanda - GATE Overflow

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 Feb 27, 2019 in Combinatory | 59 views

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 Jan 18, 2019 in Computer Networks | 190 views

+1 vote

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 Jan 18, 2019 in Databases | 145 views

0 votes

0 answers

4

MadeEasy Full Length Test 2019: Theory of Computation - Identify Class Languages

asked Jan 15, 2019 in Theory of Computation | 217 views

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 Jan 15, 2019 in Digital Logic | 149 views

+4 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 Jan 15, 2019 in Computer Networks | 348 views

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 Jan 15, 2019 in Theory of Computation | 139 views

0 votes

0 answers

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 Jan 2, 2019 in Programming | 235 views

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 Jan 2, 2019 in Programming | 128 views

+1 vote

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 Jan 2, 2019 in Numerical Ability | 238 views

+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 Jan 2, 2019 in Operating System | 144 views

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 Jan 2, 2019 in Digital Logic | 108 views

0 votes

0 answers

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 Jan 2, 2019 in Numerical Ability | 98 views

0 votes

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 Nov 30, 2018 in Theory of Computation | 184 views

+1 vote

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 Oct 2, 2018 in Operating System | 374 views

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 Aug 16, 2018 in Compiler Design | 74 views

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 May 10, 2018 in CO and Architecture | 42 views

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 May 9, 2018 in Databases | 99 views

+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 Feb 2, 2018 in Algorithms | 122 views

+6 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 Jan 26, 2018 in DS | 255 views

+2 votes

1 answer

21

Can a weak entity be dependent on another weak entity in ER-Model?
This is an excerpt which i found on Quora that answered the question. But I still wanted to know few more things. 1. If there is no strong entity in the schema then can there be any relationship b/w 2 ... total participation between two weak entity relationship? It would be better if an explanation is given along with an example.

asked Jan 23, 2018 in Databases | 376 views

+5 votes

0 answers

22

Hashing-MadeEasy
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is true? According to me it was S1 and S3 but given is S3 only.

asked Jan 21, 2018 in Algorithms | 468 views

+1 vote

0 answers

23

MadeEasy Test Series 2018: Programming & DS - Stack
Not able to understand the question. Kindly elaborate along with an explanation. Thank you.

asked Jan 18, 2018 in DS | 156 views

+3 votes

0 answers

24

Semaphore doubt
wait(S); Critical section wait(S); S is a binary semaphore initialised to 1. Suppose there are n processes competing for the CS. Only one can enter into it. Is this the situation of deadlock or starvation? I think it's deadlock because other processes ... one process is getting executed so it's not deadlock as in case of deadlock none of the processes can proceed. Please clarify.

asked Jan 13, 2018 in Operating System | 250 views

+2 votes

1 answer

25

Numerical on AIMD
In TCP, MSS is 8B. If during the 5th RTT the network is congested and timeout occurs, by using AIMD then the threshold value is _________(in Bytes). (assume inital congestion window size is 1 MSS )

asked Jan 9, 2018 in Computer Networks | 209 views

+3 votes

1 answer

26

Gateforum-Pure Aloha Numerical
Groups of user stations(N) share a 56Kbps pure aloha channel. Each station outputs a 1000 bits frame on an average of once every 100sec(stations are buffered). What is the max value of N? Answer is 1030. Please give detailed solution.

asked Jan 8, 2018 in Computer Networks | 1.1k views

+3 votes

0 answers

27

IN Gate 2007 - Matrix
Let A be an nxn real matrix such that A^2=I and y be an n-dimensional vector. Then the linear system of equations AX=Y has A) No solution B) Unique Solution C) More than one but finitely many independent solutions D) infinitely many independent solutions

asked Dec 31, 2017 in Linear Algebra | 333 views

+2 votes

0 answers

28

Relational Model
Let R1, R2, . . ., Rn be a decomposition of schema U. Let u(U) be a relation, and the ri=∏Ri(U) the following holds true? A) u⊆ r1⋈r2⋈r3...⋈rn B) u= r1⋈r2⋈r3...⋈rn C) u⊇ r1⋈r2⋈r3...⋈rn D) None of these Please explain the question and the solution.

asked Nov 21, 2017 in Databases | 131 views

+2 votes

1 answer

29

Turing machine-Gateforum
Which of the following is false? A) L is recursive if and only if it is generated by some TM is canonical order. B) L is recursively enumerable if and only if there exist a TM which generates L. C) L is context sensitive if and only if is generated by some TM is canonical order. D) None of these. Somebody please explain what is the meaning of option A and C.

asked Nov 20, 2017 in Theory of Computation | 74 views

+2 votes

0 answers

30

Gateforum-dynamic programming-longest common subsequence
Consider two strings A="pqqrr" and B="pqprqrp",let x be the length of the longest sub-sequence between A and B and let y be the number of such common sub-sequences between A and B then 2x+4y= ? A) 22 B ... Do i have to count twice for "pqqr" in A? Once for "pqqrr" and another one for "pqqrr".

asked Oct 24, 2017 in Algorithms | 283 views