Recent activity by Manis / GATE Overflow for GATE CSE

0 answers

1

Test series
If possible , plz explain with state diagram..

If possible , plz explain with state diagram..

411 views

commented Feb 2, 2018

1 answer

2

Test series
Plz explain ? How to solve such que. As I have solved this type of que earlier but when I am doing revision I am not able to do it. So plz provide some good explanation..

Plz explain ? How to solve such que. As I have solved this type of que earlier but when I am doing revision I am not able to do it. So plz provide some good explanation.....

349 views

commented Feb 1, 2018

1 answer

3

Test series
Plz explain ??

Plz explain ??

378 views

commented Feb 1, 2018

0 answers

4

Test series
my doubt is why 14 has been subtracted ??

my doubt is why 14 has been subtracted ??

257 views

commented Feb 1, 2018

0 answers

5

test series
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank was 250 also. but i am unable to cross 50marks ...i am obc student . is there any chance for me to iit...plz advice me

hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank wa...

672 views

commented Jan 30, 2018

0 answers

6

Ace Test Series: CO & Architecture - Cache Memory Tag

382 views

commented Jan 28, 2018

7 answers

7

GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.

Consider the systems, each consisting of $m$ linear equations in $n$ variables.If $m < n$, then all such systems have a solution.If $m n$, then none of these systems has...

15.9k views

answered Jan 24, 2018

1 answer

8

Set theory
Let $f: A \to B$ be a function and $S$ and $T$ be subsets of $B$. Consider the following statements about image (range) : $S1:\quad f^{-1}(S \cup T) = f^{-1}(S) \cup f^{-1}(T)$ $S2:\quad f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T)$ Which of the following is correct? A) only S1 is true B) only S2 is true C) Both S1 and S2 is true D) Neither S1 nor S2 is true

Let $f: A \to B$ be a function and $S$ and $T$ be subsets of $B$. Consider the following statements about image (range) :$S1:\quad f^{-1}(S \cup T) = f^{-1}(S) \cup f^{-1...

546 views

commented Jan 15, 2018

1 answer

9

DBMS ER-Diagram (No of Relations)
Options was:- 4,5,6,7

Options was:- 4,5,6,7

678 views

commented Jan 11, 2018

1 answer

10

static variable programming Q
Question:

Question:

1.1k views

answer edited Jan 6, 2018

3 answers

11

COMPILER DESIGN
Check whether this grammar is LL(1) or not?

Check whether this grammar is LL(1) or not?

1.0k views

answered Jan 5, 2018

13 answers

12

GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.

A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...

15.1k views

commented Jan 4, 2018

9 answers

13

GATE CSE 2014 Set 2 | Question: GA-10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.

At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$?$6: 22$ a.m.$6: 27$ a.m.$6: 38$ a.m.$6: 4...

10.1k views

commented Dec 27, 2017

2 answers

14

Decoder
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them

Which of following statement is true ?S1. Any boolean function can be realized using decoders2. One multiplexer can realize 1 function at a timea) S1 is trueb) S2 is true...

1.7k views

commented Dec 8, 2017

2 answers

15

MUX
How many 4*1 mux required to implement 8*1 Mux ?

How many 4*1 mux required to implement 8*1 Mux ?

859 views

answered Dec 7, 2017

5 answers

16

GATE IT 2007 | Question: 21
Which one of these first-order logic formulae is valid? $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$ ... $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$

Which one of these first-order logic formulae is valid?$\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall ...

10.5k views

commented Dec 2, 2017

9 answers

17

GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...

Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...

14.9k views

commented Dec 2, 2017

3 answers

18

GATE CSE 2015 Set 3 | Question: 23
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$

Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T...

12.1k views

commented Dec 1, 2017

5 answers

19

GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$

Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$$( \forall x \,...

21.1k views

commented Dec 1, 2017

7 answers

20

GATE CSE 2000 | Question: 2.7
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always True False Same as the truth-value of $b$ Same as the truth-value of $d$

Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨...

12.2k views

commented Nov 30, 2017

0 answers

21

GATE CSE 2003 | Question: 71
Consider the following logic program P $\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$ ... $(\forall x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land (\exists x)[B(x,x)]$

Consider the following logic program P$\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$Which of the following first order sentences is equivalent to...

3.8k views

commented Nov 30, 2017

7 answers

22

GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here $\alpha$ and $\beta$ are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$

Which of the following is a valid first order formula? (Here $\alpha$ and $\beta$ are first order formulae with $x$ as their only free variable)$((∀x)[α] ⇒ (∀x...

16.9k views

commented Nov 30, 2017

4 answers

23

GATE CSE 2012 | Question: 18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$

Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWA...

14.4k views

answered Nov 27, 2017

1 answer

24

Sorting Techniques
What is the best sorting algorithm to use for the elements in array are more than 1 million in general? A Merge sort. B Bubble sort. C Quick sort. D Insertion sort. Ans:C Source: http://quiz.geeksforgeeks.org/algorithms-insertionsort-question ... B Source: http://quiz.geeksforgeeks.org/algorithms-searching-and-sorting-question-16/ Kindly explain on why the answers are different?

What is the best sorting algorithm to use for the elements in array are more than 1 million in general?AMerge sort.BBubble sort.CQuick sort.DInsertion sort. Ans:CSource: ...

7.9k views

commented Nov 27, 2017

2 answers

25

geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)

In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...

7.0k views

commented Nov 26, 2017

10 answers

26

GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated

In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...

37.1k views

commented Nov 23, 2017

7 answers

27

GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$

A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the rig...

23.5k views

commented Nov 19, 2017

4 answers

28

GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...

24.2k views

commented Nov 18, 2017

7 answers

29

GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...

Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $1000...

14.3k views

commented Nov 10, 2017

9 answers

30

GATE CSE 2015 Set 1 | Question: 1‏9
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? If the sequence number of a segment is $m,$ then the sequence number of the subsequent segment is always ... always less than or equal to the advertised window. III only I and III only I and IV only II and IV only

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?If the sequence number ...

18.9k views

commented Nov 5, 2017

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