# Questions by MiNiPanda

1
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?
2
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 ______________
3
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 violation. Eg: Let $E_1$ be: <p1,q1> ... $p \rightarrow q$ 2-NF violation. So by default which case is to be considered when normalization form is not mentioned?? 1-NF?
4
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.
5
2’s complement representation of the number $(-89)_{10}$ is 7 5 4 3 I don’t understand their solution. Please help.
6
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 phase. The value of the window size (in MSS) at the ... end of $12^{th}$ transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?
7
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. ∑* They said that X is 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.
8
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 which hashing should be considered? ... the formula given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing, I am getting around 1.61
9
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 the number of times the print statement (both Hi and Bye included) is executed ... 2 = 1+P(-2)+2=3+P(-2) But nothing is mentioned about P value when n<0. How to solve for P(-2) and other negative values?
10
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 here? The batteries are chosen without replacement ...
1 vote
11
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..? :/
12
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?
13
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, then the sum of areas of ... CDE is ________ $cm^2$ . Now here I don't understand why they have taken BCD and ACE on the same line! Isn't this possible?
14
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 net. Why isn't the criteria like ... a loop in DFA 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.
1 vote
15
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.
16
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 process is giving 2. What is ... According to the rules it shouldn't be in a separate block right? Doubt 4: Is this statement True or False. Please give reason to support.
17
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 90% of the ... : in-status, check-status, branch and read/write in memory, each requiring one machine cycle. Please explain the solution with details.