Dark Mode

Answers by amarVashishth

46 votes

61

GATE IT 2004 | Question: 31
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments: $P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$ $Q: [(¬p ∧q) ∧ [q → (p → r)]] → ¬r$ $R: [[(q ∧ r) → p] ∧ (¬q \vee p)] → r$ $S: [p ∧ (p → r) ∧ (q \vee ¬ r)] → q$ Which of the above arguments are valid? $P$ and $Q$ only $P$ and $R$ only $P$ and $S$ only $P, Q, R$ and $S$

answered in Mathematical Logic Nov 28, 2015

11.7k views

37 votes

62

GATE CSE 2015 Set 2 | Question: 3
Consider the following two statements. $S_1$: If a candidate is known to be corrupt, then he will not be elected $S_2$: If a candidate is kind, he will be elected Which one of the following statements follows from $S_1$ and $S_2$ as per sound inference ... If a person is kind, he is not known to be corrupt If a person is not kind, he is not known to be corrupt

answered in Mathematical Logic Nov 28, 2015

8.8k views

2 votes

63

answered in Calculus Nov 28, 2015

324 views

2 votes

64

Data structure for controlling thrashing
Given answer: A Please explain.

answered in Operating System Nov 28, 2015

924 views

6 votes

65

Question on process state transition
Answer to the above question is (C). I am unable to understand that how can a process in ready state can get blocked. Please give an explanation.

answered in Operating System Nov 28, 2015

3.2k views

1 vote

66

recurrence relation
Find recurrence relation for ternary string of length n that do not contain two consecutive zeros or two consecutive 1s? Find recurrence relation for ternary string that contain either two consecutive or two consecutive 1s? Find recurrence relation ... recurrence relation for ternary strings of length n that contain two consecutive symbols same? Also write initial conditions.

answered in Combinatory Nov 27, 2015

6.3k views

0 votes

67

Find complexity of T(n)=64T(n/8)-n^2lgn
Which is right method to apply for this substitute or recursion... Can we convert it in master theorem format

answered in Algorithms Nov 27, 2015

13.4k views

1 vote

68

How many possible outcomes are there when 5 similar dices are rolled ?
In this question If I consider first total no of outcomes as 6^5 , then I divided it be 6C5 *5! since there are 5 similar dices so the outcome (1 2 3 4 5 ) will be similar to (5 4 3 2 1) . Now what's wrong with this approach ?

answered in Combinatory Nov 27, 2015

1.8k views

1 vote

69

effect on increasing no stages in pipeline....
In a CPU, what is the benefit of having many pipeline stages? Why speedup reduces with increase in number of pipeline stages? Why increased pipeline depth does not always mean increased throughput? why long pipeline lead to lower CPI? what will be the effect on friquency when of of stages increased.

answered in CO and Architecture Nov 27, 2015

2.8k views

5 votes

70

Difference between page replacement policies
What is the difference between first-in-first-out and last-in-first-out page replacement policies. Please provide some illustrative examples as well.

answered in Operating System Nov 27, 2015

467 views

7 votes

71

Asymptotic notations
The increasing order of following functions in terms of asymptotic complexity is: $\large \\ f_1(n)= n^{0.999999} \log n \qquad // \log n \text{ is not power of } n\\ f_2(n)=10000000*n \\ f_3(n)=10000000^n\\ f_4(n)=n^2$ (a) f1(n); f4(n); f2(n); f3(n) (b) f1(n); f2(n); f3(n); f4(n) (c) f2(n); f1(n); f4(n); f3(n) (d) f1(n); f2(n); f4(n); f3(n)

answered in Algorithms Nov 24, 2015

7.6k views

0 votes

72

Which GATE score is considered in case of multiple attempts?
I gave GATE this year (2015). If I give GATE again next year and get less marks than this year, then which score would be used? Also, is there any option in Gate DTE application while admissions for entering the year of Gate score that we want to apply for?

answered in GATE Application Nov 23, 2015

1.6k views

9 votes

73

What is/was your strategy for GATE Preparation?
Frequently it has been found that people ask each other or at least try to read about/ hear from others about how are they preparing for GATE. This question is a place where you should share answers to : What is your formula for ... , What is the critical point of advice. you prefer to give Any other relevant info. that you can come up with

answered in Study Resources Nov 23, 2015

7.1k views

1 vote

74

dfa
No of states in minimal dfa of binary strings starting with 100 and length is congruent to 1 mod 12

answered in Theory of Computation Nov 23, 2015

840 views

1 vote

75

Number of DFA ?
Let $q_0$ and $q_1$ be two states, with $q_0$ always being the initial state. Let the alphabet be $\{a, b\}$. Then, the possible number of DFA's with only these two states $q_0$ and $q_1$ is? 32 64 80 120

answered in Theory of Computation Nov 22, 2015

989 views

19 votes

76

GATE CSE 2015 Set 1 | Question: 44
Compute the value of: $ \large \int \limits_{\frac{1}{\pi}}^{\frac{2}{\pi}}\frac{\cos(1/x)}{x^{2}}dx$

answered in Calculus Nov 22, 2015

7.6k views

11 votes

77

GATE CSE 2015 Set 1 | Question: 53
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time ... . Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.

answered in Computer Networks Nov 22, 2015

26.3k views

1 vote

78

MadeEasy Test Series: Computer Networks - Flow Control Methods
Please help me to solve problem 8.

answered in Computer Networks Nov 21, 2015

1.8k views

1 vote

79

show L is re but not rec
let L be language consisting of pair of tm codes and an integer (M1,M2,k) such that L(M1) intersect L(M2)contains atleast k strings show L is RE but not recursive

answered in Theory of Computation Nov 20, 2015

765 views

76 votes

80

GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.

answered in Operating System Nov 19, 2015

23.7k views

39 votes

81

GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.

answered in Operating System Nov 19, 2015

37.9k views

0 votes

82

toc
how to approach $L=\{a^mb^nc^pd^q\ |\ m+n=p+q \}$ give grammar for it???

answered in Theory of Computation Nov 19, 2015

627 views

17 votes

83

GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.

answered in Databases Nov 18, 2015

18.8k views

14 votes

84

GATE CSE 2004 | Question: 87
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ is regular context-free but not regular context-sensitive but not context free type-0 but not context sensitive

answered in Theory of Computation Nov 18, 2015

7.0k views

51 votes

85

GATE CSE 2015 Set 1 | Question: 49
Let a$_{n}$ represent the number of bit strings of length n containing two consecutive $1$s. What is the recurrence relation for $a_{n}$? $a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$

answered in Algorithms Nov 18, 2015

10.3k views

40 votes

86

GATE CSE 2004 | Question: 77
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is $2$ $3$ $4$ $5$

answered in Graph Theory Nov 18, 2015

12.6k views

7 votes

87

The running time of an algorithm is given by T(n) = T(n-1) + T(n-2) - T(n-3) , if n>3

answered in Algorithms Nov 18, 2015

17.9k views

4 votes

88

Finding Time complexity
Given answer: B Please explain

answered in Algorithms Nov 18, 2015

2.1k views

0 votes

89

What is the Regular Expression for
The regular expression for the language recognized by the following Finite State Automaton is? $0^* \mid 0^* 1^+$ $0^* \mid 11^*$ $0^* \mid 0^* 1^+ \mid 0^* 1^+ (0+1)^*$ None of these.

answered in Theory of Computation Nov 17, 2015

1.6k views

Page:

« prev
1
2
3
4
5
6
7
8
next »