Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1993
49
votes
7
answers
1
GATE CSE 1993 | Question: 01.1
The eigen vector $(s)$ of the matrix $\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$ is (are) $(0,0,\alpha)$ $(\alpha,0,0)$ $(0,0,1)$ $(0,\alpha,0)$
The eigen vector $(s)$ of the matrix $$\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$$ is (are)$(0,0,\alpha)$$(\alpha,0,0)$$(0,0,1)$$(0,\al...
Kathleen
11.4k
views
Kathleen
asked
Sep 13, 2014
Linear Algebra
gate1993
eigen-value
linear-algebra
easy
multiple-selects
+
–
23
votes
5
answers
2
GATE CSE 1993 | Question: 7.9, UGCNET-Dec2012-III: 41
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B$, and $C$ which have peak demands of $3, 4$, and $6$ respectively. For what value of $m$ deadlock will not occur? $7$ $9$ $10$ $13$ $15$
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B$, and $C$ which have peak demands of $3, 4$, and $6$ respective...
Kathleen
26.4k
views
Kathleen
asked
Sep 29, 2014
Operating System
gate1993
operating-system
resource-allocation
normal
ugcnetcse-dec2012-paper3
multiple-selects
+
–
26
votes
4
answers
3
GATE CSE 1993 | Question: 8.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n 2)$. Then, which of the following statements are true?$G$ has no cyclesThe graph obtained by re...
Kathleen
9.7k
views
Kathleen
asked
Sep 29, 2014
Graph Theory
gate1993
graph-theory
graph-connectivity
easy
multiple-selects
+
–
33
votes
9
answers
4
GATE CSE 1993 | Question: 6-3
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is: Shift Register $\text{Mod- 3}$ Counter $\text{Mod- 6}$ Counter $\text{Mod- 2}$ Counter None of the above
For the initial state of $000$, the function performed by the arrangement of the $\text{J-K}$ flip-flops in figure is:Shift Register$\text{Mod- 3}$ Counter$\text{Mod- 6}$...
go_editor
12.4k
views
go_editor
asked
Sep 20, 2015
Digital Logic
gate1993
digital-logic
sequential-circuit
flip-flop
digital-counter
circuit-output
multiple-selects
+
–
27
votes
5
answers
5
GATE CSE 1993 | Question: 6.7
A certain moving arm disk storage, with one head, has the following specifications: Number of tracks/recording surface $= 200$ Disk rotation speed $= 2400$ rpm Track storage capacity $= 62,500$ bits The average latency of this device is $\text{P}$ ms and the data transfer rate is $\text{Q}$ bits/sec. Write the values of $\text{P}$ and $\text{Q}$.
A certain moving arm disk storage, with one head, has the following specifications:Number of tracks/recording surface $= 200$Disk rotation speed $= 2400$ rpmTrack storage...
Kathleen
20.1k
views
Kathleen
asked
Sep 29, 2014
Operating System
gate1993
operating-system
disk
normal
descriptive
+
–
23
votes
4
answers
6
GATE CSE 1993 | Question: 8.2
The proposition $p \wedge (\sim p \vee q)$ is: a tautology logically equivalent to $p \wedge q$ logically equivalent to $p \vee q$ a contradiction none of the above
The proposition $p \wedge (\sim p \vee q)$ is:a tautologylogically equivalent to $p \wedge q$logically equivalent to $p \vee q$a contradictionnone of the above
Kathleen
8.2k
views
Kathleen
asked
Sep 29, 2014
Mathematical Logic
gate1993
mathematical-logic
easy
propositional-logic
+
–
29
votes
4
answers
7
GATE CSE 1993 | Question: 8.3
Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Then at least one of the sets $S_i$ is a finite set not more than one of the sets $S_i$ can be finite at least one of the sets $S_i$ is an infinite not more than one of the sets $S_i$ can be infinite None of the above
Let $S$ be an infinite set and $S_1 \dots , S_n$ be sets such that $S_1 \cup S_2 \cup \dots \cup S_n = S$. Thenat least one of the sets $S_i$ is a finite setnot more than...
Kathleen
7.5k
views
Kathleen
asked
Sep 29, 2014
Set Theory & Algebra
gate1993
set-theory&algebra
normal
set-theory
+
–
27
votes
3
answers
8
GATE CSE 1993 | Question: 8.4
Let A be a finite set of size n. The number of elements in the power set of $A\times A$ is: $2^{2^n}$ $2^{n^2}$ $\left(2^n\right)^2$ $\left(2^2\right)^n$ None of the above
Let A be a finite set of size n. The number of elements in the power set of $A\times A$ is:$2^{2^n}$$2^{n^2}$$\left(2^n\right)^2$$\left(2^2\right)^n$None of the above
Kathleen
6.8k
views
Kathleen
asked
Sep 29, 2014
Set Theory & Algebra
gate1993
set-theory&algebra
easy
set-theory
+
–
31
votes
3
answers
9
GATE CSE 1993 | Question: 10
The instruction format of a CPU is: $\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an addressing mode. In particular, $\text{Mode}=2$ specifies that ... address of the operand? Assuming that is a non-jump instruction, what are the contents of PC after the execution of this instruction?
The instruction format of a CPU is:$\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an add...
Kathleen
7.0k
views
Kathleen
asked
Sep 29, 2014
CO and Architecture
gate1993
co-and-architecture
addressing-modes
normal
descriptive
+
–
30
votes
4
answers
10
GATE CSE 1993 | Question: 28
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that: $p*q=q*p$ and $q*q=q$
Let $\left(\{ p,q \},*\right)$ be a semigroup where $p*p=q$. Show that:$p*q=q*p$ and$q*q=q$
Kathleen
4.5k
views
Kathleen
asked
Sep 29, 2014
Set Theory & Algebra
gate1993
set-theory&algebra
group-theory
normal
descriptive
+
–
41
votes
5
answers
11
GATE CSE 1993 | Question: 8.7
$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is: $O(n)$ $O(n^2)$ $O(n^3)$ $O(3n^2)$ $O(1.5n^2)$
$\displaystyle \sum_{1\leq k\leq n} O(n)$, where $O(n)$ stands for order $n$ is:$O(n)$$O(n^2)$$O(n^3)$$O(3n^2)$$O(1.5n^2)$
Kathleen
12.6k
views
Kathleen
asked
Sep 29, 2014
Algorithms
gate1993
algorithms
time-complexity
easy
+
–
32
votes
4
answers
12
GATE CSE 1993 | Question: 27
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurrences of the letter $b$.
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurre...
Kathleen
12.8k
views
Kathleen
asked
Sep 29, 2014
Theory of Computation
gate1993
theory-of-computation
finite-automata
easy
descriptive
+
–
11
votes
3
answers
13
GATE CSE 1993 | Question: 26
A stack is used to pass parameters to procedures in a procedure call. If a procedure $P$ has two parameters as described in procedure definition: procedure P (var x :integer; y: integer); and if $P$ is called by ; $P(a, b)$ State precisely in a ... $b$ In the generated code for the body of procedure $P$, how will the addressing of formal parameters $x$ and $y$ differ?
A stack is used to pass parameters to procedures in a procedure call.If a procedure $P$ has two parameters as described in procedure definition:procedure P (var x :intege...
Kathleen
2.9k
views
Kathleen
asked
Sep 29, 2014
Compiler Design
gate1993
compiler-design
parameter-passing
runtime-environment
normal
descriptive
+
–
17
votes
2
answers
14
GATE CSE 1993 | Question: 9
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
Kathleen
2.8k
views
Kathleen
asked
Sep 29, 2014
Digital Logic
gate1993
digital-logic
combinational-circuit
adder
descriptive
functional-completeness
+
–
14
votes
4
answers
15
GATE CSE 1993 | Question: 13
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored ... insert $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \...
Kathleen
3.6k
views
Kathleen
asked
Sep 29, 2014
DS
gate1993
data-structures
linked-list
normal
descriptive
+
–
42
votes
4
answers
16
GATE CSE 1993 | Question: 17
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
Kathleen
8.1k
views
Kathleen
asked
Sep 29, 2014
Set Theory & Algebra
gate1993
set-theory&algebra
easy
set-theory
descriptive
+
–
7
votes
2
answers
17
GATE CSE 1993 | Question: 25
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ; ; statement end Write a context-free grammar (CFG) for statements in ... CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end
A simple Pascal like language has only three statements.assignment statement e.g. x:=expressionloop construct e.g. for i:=expression to expression do statementsequencing ...
Kathleen
1.5k
views
Kathleen
asked
Sep 29, 2014
Compiler Design
gate1993
compiler-design
parsing
normal
descriptive
+
–
15
votes
3
answers
18
GATE CSE 1993 | Question: 02.1
$\displaystyle \lim_{x \to 0} \frac{x(e^x - 1) + 2(\cos x -1)}{x(1 - \cos x)}$ is __________
$\displaystyle \lim_{x \to 0} \frac{x(e^x - 1) + 2(\cos x -1)}{x(1 - \cos x)}$ is __________
Kathleen
3.7k
views
Kathleen
asked
Sep 13, 2014
Calculus
gate1993
limits
calculus
normal
fill-in-the-blanks
+
–
20
votes
5
answers
19
GATE CSE 1993 | Question: 23
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each relation are marked by *'. Students (rollno*, sname, saddr) courses (cno*, ... name of students who got A grade in at least one course taught by teacher names Ramesh for the above relational database.
The following relations are used to store data about students, courses, enrollment of students in courses and teachers of courses. Attributes for primary key in each rela...
Kathleen
3.8k
views
Kathleen
asked
Sep 29, 2014
Databases
gate1993
databases
sql
relational-calculus
normal
descriptive
+
–
49
votes
6
answers
20
GATE CSE 1993 | Question: 11
In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$ ... a page swap is $T_i$. Calculate the average time $t_A$ required for a processor to read one word from this memory system.
In the three-level memory hierarchy shown in the following table, $p_i$ denotes the probability that an access request will refer to $M_i$.$$\begin{array}{|c|c|c|c|} \hli...
Kathleen
10.8k
views
Kathleen
asked
Sep 29, 2014
CO and Architecture
gate1993
co-and-architecture
cache-memory
normal
descriptive
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register