Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2001
29
votes
2
answers
61
GATE CSE 2001 | Question: 1.11
Given the following karnaugh map, which one of the following represents the minimal Sum-Of-Products of the map? $XY+Y'Z$ $WX'Y' + XY +XZ$ $W'X+Y'Z+XY$ $XZ+Y$
Given the following karnaugh map, which one of the following represents the minimal Sum-Of-Products of the map? $XY+Y'Z$$WX'Y' + XY +XZ$$W'X+Y'Z+XY$$XZ+Y$
Kathleen
7.3k
views
Kathleen
asked
Sep 14, 2014
Digital Logic
gatecse-2001
k-map
digital-logic
normal
+
–
43
votes
10
answers
62
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
Suppose a processor does not have any stack pointer registers, which of the following statements is true?It cannot have subroutine call instructionIt cannot have nested s...
Kathleen
18.1k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
+
–
1
votes
1
answer
63
GATE CSE 2001 | Question: 1.9
A low memory can be connected to 8085 by using $INTER$ $\overline{RESET\text{ }IN}$ $HOLD$ $READY$
A low memory can be connected to 8085 by using$INTER$$\overline{RESET\text{ }IN}$$HOLD$$READY$
Kathleen
2.4k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
8085-microprocessor
normal
out-of-syllabus-now
+
–
47
votes
2
answers
64
GATE CSE 2001 | Question: 1.8
Which of the following statements is false? Virtual memory implements the translation of a program's address space into physical memory address space Virtual memory allows each program to exceed the size of the primary memory Virtual memory increases the degree of multiprogramming Virtual memory reduces the context switching overhead
Which of the following statements is false?Virtual memory implements the translation of a program's address space into physical memory address spaceVirtual memory allows ...
Kathleen
21.6k
views
Kathleen
asked
Sep 14, 2014
Operating System
gatecse-2001
operating-system
virtual-memory
normal
+
–
44
votes
5
answers
65
GATE CSE 2001 | Question: 1.7, ISRO2008-18
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above
More than one word are put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the m...
Kathleen
17.1k
views
Kathleen
asked
Sep 14, 2014
CO and Architecture
gatecse-2001
co-and-architecture
easy
cache-memory
isro2008
+
–
29
votes
3
answers
66
GATE CSE 2001 | Question: 1.6
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least$N^2$$2^N$$2N$$N!$
Kathleen
15.9k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
finite-automata
theory-of-computation
easy
minimal-state-automata
+
–
30
votes
3
answers
67
GATE CSE 2001 | Question: 1.5
Which of the following statements is true? If a language is context free it can always be accepted by a deterministic push-down automaton The union of two context free languages is context free The intersection of two context free languages is a context free The complement of a context free language is a context free
Which of the following statements is true?If a language is context free it can always be accepted by a deterministic push-down automatonThe union of two context free lang...
Kathleen
13.9k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
context-free-language
easy
+
–
24
votes
2
answers
68
GATE CSE 2001 | Question: 1.4
Consider the following two statements: $S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following two statements:$S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language$S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \ri...
Kathleen
14.8k
views
Kathleen
asked
Sep 14, 2014
Theory of Computation
gatecse-2001
theory-of-computation
easy
regular-language
+
–
31
votes
5
answers
69
GATE CSE 2001 | Question: 1.3
Consider two well-formed formulas in propositional logic $F_1: P \Rightarrow \neg P$ $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$ Which one of the following statements is correct? $F_1$ is satisfiable, $F_2$ is valid $F_1$ unsatisfiable, $F_2$ is satisfiable $F_1$ is unsatisfiable, $F_2$ is valid $F_1$ and $F_2$ are both satisfiable
Consider two well-formed formulas in propositional logic$F_1: P \Rightarrow \neg P$ $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$Which one of the fo...
Kathleen
9.2k
views
Kathleen
asked
Sep 14, 2014
Mathematical Logic
gatecse-2001
mathematical-logic
easy
propositional-logic
+
–
24
votes
4
answers
70
GATE CSE 2001 | Question: 1.2
Consider the following relations: $R_1\:(a,b)$ iff $(a+b)$ is even over the set of integers $R_2 \:(a,b)$ iff $(a+b)$ is odd over the set of integers $R_3 \:(a,b)$ iff $a.b > 0$ ... $R_4$ are not $R_1$ and $R_4$ are equivalence relations, $R_2$ and $R_3$ are not $R_1, R_2, R_3$ and $R_4$ all are equivalence relations
Consider the following relations:$R_1\:(a,b)$ iff $(a+b)$ is even over the set of integers$R_2 \:(a,b)$ iff $(a+b)$ is odd over the set of integers$R_3 \:(a,b)$ iff $a.b ...
Kathleen
6.2k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
relations
+
–
23
votes
6
answers
71
GATE CSE 2001 | Question: 1.1
Consider the following statements: S1: The sum of two singular $n \times n$ matrices may be non-singular S2: The sum of two $n \times n$ non-singular matrices may be singular Which one of the following statements is correct? $S1$ and $S2$ both are true $S1$ is true, $S2$ is false $S1$ is false, $S2$ is true $S1$ and $S2$ both are false
Consider the following statements:S1: The sum of two singular $n \times n$ matrices may be non-singularS2: The sum of two $n \times n$ non-singular matrices may be singul...
Kathleen
8.6k
views
Kathleen
asked
Sep 14, 2014
Linear Algebra
gatecse-2001
linear-algebra
normal
matrix
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
