Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1998
22
votes
3
answers
21
GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions
Consider the following set of equations$x+2y=5$$4x+8y=12$$3x+6y+3z=15$This sethas unique solutionhas no solutionhas finite number of solutionshas infinite number of solut...
Kathleen
7.2k
views
Kathleen
asked
Sep 25, 2014
Linear Algebra
gate1998
linear-algebra
system-of-equations
easy
+
–
29
votes
6
answers
22
GATE CSE 1998 | Question: 2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
What value would the following function return for the input $x=95$?Function fun (x:integer):integer; Begin If x 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;$...
Kathleen
13.9k
views
Kathleen
asked
Sep 25, 2014
Algorithms
gate1998
algorithms
recursion
identify-function
normal
+
–
44
votes
9
answers
23
GATE CSE 1998 | Question: 19b
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
Compute the post fix equivalent of the following expression $3^*\log(x+1)-\frac{a}{2}$
Arjun
15.9k
views
Arjun
asked
Aug 29, 2015
DS
gate1998
stack
infix-prefix
descriptive
+
–
40
votes
4
answers
24
GATE CSE 1998 | Question: 1.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
Which of the following addressing modes permits relocation without any change whatsoever in the code?Indirect addressingIndexed addressingBase register addressingPC relat...
Kathleen
11.1k
views
Kathleen
asked
Sep 25, 2014
CO and Architecture
gate1998
co-and-architecture
addressing-modes
easy
+
–
20
votes
4
answers
25
GATE CSE 1998 | Question: 2.1
The rank of the matrix given below is: $\begin{bmatrix} 1 &4 &8 &7\\ 0 &0& 3 &0\\ 4 &2& 3 &1\\ 3 &12 &24 &21 \end{bmatrix}$ $3$ $1$ $2$ $4$
The rank of the matrix given below is:$$\begin{bmatrix} 1 &4 &8 &7\\ 0 &0& 3 &0\\ 4 &2& 3 &1\\ 3 &12 &24 &21 \end{bmatrix}$$$3$$1$$2$$4$
Kathleen
7.1k
views
Kathleen
asked
Sep 25, 2014
Linear Algebra
gate1998
linear-algebra
matrix
normal
rank-of-matrix
+
–
21
votes
3
answers
26
GATE CSE 1998 | Question: 6a
Solve the following recurrence relation $x_n = 2x_{n-1}-1, n>1$ $x_1=2$
Solve the following recurrence relation$x_n = 2x_{n-1}-1, n>1$$x_1=2$
Arjun
5.9k
views
Arjun
asked
May 3, 2016
Algorithms
gate1998
algorithms
recurrence-relation
descriptive
+
–
18
votes
5
answers
27
GATE CSE 1998 | Question: 2.4
In a room containing $28$ people, there are $18$ people who speak English, $15$ people who speak Hindi and $22$ people who speak Kannada. $9$ persons speak both English and Hindi, $11$ persons speak both Hindi and Kannada whereas $13$ persons speak both Kannada and English. How many speak all three languages? $9$ $8$ $7$ $6$
In a room containing $28$ people, there are $18$ people who speak English, $15$ people who speak Hindi and $22$ people who speak Kannada. $9$ persons speak both English a...
Kathleen
6.8k
views
Kathleen
asked
Sep 25, 2014
Set Theory & Algebra
gate1998
set-theory&algebra
easy
set-theory
+
–
18
votes
2
answers
28
GATE CSE 1998 | Question: 1.28
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants? $0, 200, 500, 600$ $0, 200, 1000, 1600$ $200, 500, 600, 800$ $200, 700, 1300, 2100$
A linker reads four modules whose lengths are $200, 800, 600$ and $500$ words, respectively. If they are loaded in that order, what are the relocation constants?$0, 200, ...
Kathleen
5.9k
views
Kathleen
asked
Sep 25, 2014
Compiler Design
gate1998
compiler-design
runtime-environment
normal
+
–
35
votes
4
answers
29
GATE CSE 1998 | Question: 3a
Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If not, they will wait for 10 minutes or the end of the hour whichever is earlier and leave. What is the probability that the two will not meet?
Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If ...
Kathleen
6.3k
views
Kathleen
asked
Sep 25, 2014
Probability
gate1998
probability
normal
numerical-answers
uniform-distribution
+
–
12
votes
6
answers
30
GATE CSE 1998 | Question: 1.4
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function is continuous and differentiable continuous but not differentiable differentiable but not continuous neither continuous nor differentiable
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
Kathleen
5.5k
views
Kathleen
asked
Sep 25, 2014
Calculus
gate1998
calculus
continuity
differentiation
easy
+
–
23
votes
3
answers
31
GATE CSE 1998 | Question: 1.23
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
Kathleen
14.6k
views
Kathleen
asked
Sep 25, 2014
Combinatory
gate1998
combinatory
normal
+
–
29
votes
4
answers
32
GATE CSE 1998 | Question: 1.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock fr...
Kathleen
14.3k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
resource-allocation
normal
+
–
33
votes
5
answers
33
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
Kathleen
13.0k
views
Kathleen
asked
Sep 26, 2014
CO and Architecture
gate1998
co-and-architecture
cache-memory
descriptive
+
–
13
votes
4
answers
34
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
Arjun
4.3k
views
Arjun
asked
Aug 12, 2018
Set Theory & Algebra
gate1998
descriptive
set-theory&algebra
relations
+
–
28
votes
4
answers
35
GATE CSE 1998 | Question: 1.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
Which of the following devices should get higher priority in assigning interrupts?Hard diskPrinterKeyboardFloppy disk
Kathleen
12.5k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
interrupts
normal
+
–
19
votes
4
answers
36
GATE CSE 1998 | Question: 1.31
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semaphore is $0$ $8$ $10$ $12$
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semap...
Kathleen
14.0k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
process-synchronization
semaphore
easy
+
–
32
votes
3
answers
37
GATE CSE 1998 | Question: 12
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$. Show that for every $a$ in $A$, $a*a=a$ Show that for every $a$, $b$ in $A$, $a*b*a=a$ Show that for every $a,b,c$ in $A$, $a*b*c=a*c$
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$.Show that for every $a$ in $A$, $a*a=a$Show that for every $a$,...
Kathleen
7.3k
views
Kathleen
asked
Sep 26, 2014
Set Theory & Algebra
gate1998
set-theory&algebra
group-theory
descriptive
+
–
45
votes
4
answers
38
GATE CSE 1998 | Question: 24
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par begin-par end}$ to represent the precedence graph shown below.
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time?Write a concurrent...
Kathleen
12.2k
views
Kathleen
asked
Sep 26, 2014
Operating System
gate1998
operating-system
process-scheduling
descriptive
+
–
32
votes
3
answers
39
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
Kathleen
10.2k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
easy
process-synchronization
+
–
47
votes
2
answers
40
GATE CSE 1998 | Question: 1.35
There are five records in a database. ... and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category
There are five records in a database.$$\begin{array}{|c|c|c|c|} \hline \textbf {Name} & \textbf {Age} & \textbf {Occupation} & \textbf{Category } \\\hline \text{Rama} & ...
Kathleen
9.9k
views
Kathleen
asked
Sep 25, 2014
Databases
gate1998
databases
indexing
normal
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register