The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged descriptive
0
votes
0
answers
1
GATE19901ivb
A 32bit floatingpoint number is represented by a 7bit signed exponent, and a 24bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________, if the scale factor is represented in excess64 format.
asked
Feb 12
in
Digital Logic
by
jothee
Veteran
(
108k
points)

43
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
0
votes
0
answers
2
GATE200111b
A sequential circuit takes an input stream of 0's and 1's and produces an output stream of 0's and 1's. Initially it replicates the input on its output until two consecutive 0's are encountered on the input. From then onward, it ... used to design the circuit. Give the minimized sumofproduct expression for J and K inputs of one of its state flipflops
asked
Feb 12
in
Digital Logic
by
jothee
Veteran
(
108k
points)

36
views
gate2001
digitallogic
normal
descriptive
flipflop
+1
vote
2
answers
3
GATE200121b
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write an SQL query to list the regno of examinees who have a score greater than the average score.
asked
Feb 8
in
Databases
by
jothee
Veteran
(
108k
points)

63
views
gate2001
databases
sql
normal
descriptive
0
votes
0
answers
4
GATE200121c
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number.
asked
Feb 8
in
Databases
by
jothee
Veteran
(
108k
points)

37
views
gate2001
databases
sql
normal
descriptive
+2
votes
1
answer
5
False sharing in cache Line
Here is pseudo code for a multiprocessing purpose: set_num_threads(NUM_THREADS); double sum=0.0; sum_local[NUM_THREADS]; parallel region { int this_thread_id = get_thread_number(); // returns 0 to (no_of_threads1) sum_local[this_thread_id] ... DRAM write back causing the problem, but not very clear, though. please explain a bit. @Arjun Sir
asked
Mar 6, 2017
in
CO & Architecture
by
Debashish Deka
Veteran
(
59.9k
points)

166
views
coandarchitecture
cachememory
nongate
descriptive
+2
votes
1
answer
6
ISI 2016 PCB C8
Consider $2n$ committees, each having at least $2n$ persons, formed from a group of $4n$ persons. Prove that there exists at least one person who belongs to at least $n$ committees.
asked
Mar 5, 2017
in
Others
by
Devasish Ghosh
Junior
(
745
points)

120
views
datastructure
engineeringmathematics
isi2016
descriptive
graphtheory
0
votes
2
answers
7
Discrete math
The following is a sequence of formula, $$\begin{align*} \begin{matrix} & 9*1+2 &= &11 \\ & 9*12+3 &= &111 \\ & 9*123+4 &= &1111 \\ & 9*1234+5 &= &11111 \\ \end{matrix} \\ ... align*}$$ Here numbers are in base $10$. (a) Establish a formula in $\sum$ notation. (b) Generalize that formula in for any base $b$..
asked
Feb 26, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
59.9k
points)

106
views
discretemathematics
descriptive
nongate
0
votes
2
answers
8
Discrete Math
Prove or disprove: $\begin{align*} \log_8x = \frac{1}{2}.\log_{2}x \end{align*}$.
asked
Feb 25, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
59.9k
points)

105
views
discretemathematics
descriptive
nongate
0
votes
0
answers
9
Discrete math
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$
asked
Feb 23, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
59.9k
points)

70
views
descriptive
iitg_math
discretemathematics
0
votes
2
answers
10
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A  B) \cup (B  A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
asked
Feb 23, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
59.9k
points)

105
views
discretemathematics
iitg_math
nongate
descriptive
0
votes
1
answer
11
Discrete math
Prove the following: $3 \;  \;\left ( a^2+b^2 \right )$ if and only if $3 \;  \;a$ and $3 \;  \;b$.
asked
Feb 23, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
59.9k
points)

102
views
discretemathematics
iitg_math
descriptive
nongate
+1
vote
2
answers
12
Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
asked
Feb 21, 2017
in
Algorithms
by
Debashish Deka
Veteran
(
59.9k
points)

178
views
algorithms
descriptive
timecomplexity
nongate
0
votes
1
answer
13
CMI2016B7ai
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following: M(101)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

37
views
cmi2016
descriptive
0
votes
0
answers
14
CMI2016B7b
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Give a constant time algorithm that computes $M(n)$ on input $n$. (A contanttime algorithm is one whose running time is independent of the input $n$)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

17
views
cmi2016
descriptive
0
votes
1
answer
15
CMI2016B7aiii
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following: M(87)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

24
views
cmi2016
descriptive
+1
vote
2
answers
16
CMI2016B7aii
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following: M(99)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

47
views
cmi2016
descriptive
0
votes
0
answers
17
CMI2016B6
An automatic spelling checker works as follows. Given a word $w$, first check if $w$ is found in the dictionary. If $w$ is not in the dictionary, compute a dictionary entry that is close to $w$. For instance if the user types $\mathsf{ocurrance ... alignments of $x$ and $y$. What is the running time of your algorithm (in terms of the lengths of $x$ and $y$)?
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

29
views
cmi2016
descriptive
0
votes
1
answer
18
CMI2016B5
For a string $x=a_0a_1 \ cdots a_{n1}$ over the alphabet $\{0, 1, 2\}$, define $val(x)$ to be the value of $x$ interpreted as a ternary number, where $a_0$ is the most significant digit. More formally, $val(x)$ is given by $$ \Sigma_{0 \leq ... automaton that accepts exactly the set of strings $ x \in \{0, 1, 2\}^*$ such that $val(x)$ is divisible by 4.
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

38
views
cmi2016
descriptive
0
votes
0
answers
19
CMI2016B4
Let $\Sigma  \{0, 1\}$. Let $A, \: B$ be arbitrary subsets of $\Sigma^*$. We define the following operatins on such sets: $$ A+B := \{ w \in \Sigma^* \mid w \in A \text{ or } w \in B \}$$ $$A \cdot B := \{ uv \in \ ... B +2(A \cdot B)$ for all choices of $A$ and $B$? If yes, give a proof. If not, provide suitable $A$ and $B$ for which this equation fails.
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
108k
points)

18
views
cmi2016
descriptive
0
votes
0
answers
20
CMI2016B3
An undirected graph canbe converted into a directed graph by choosing a direction for every edge. Here is an example: Show that for every undirected graph, there is a way of choosing directions for its edges so that the resulting directed graph has no directed cycles.
asked
Dec 30, 2016
in
Others
by
jothee
Veteran
(
108k
points)

76
views
cmi2016
descriptive
0
votes
0
answers
21
CMI2016B2b
A $\textit{simple path}$ (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex os repeated. The $length$ of such a path (respectively cycle) is the number of edges in the path (respectively cycle). Let ... an undirected graph with minimum degree $k \geq 2$. Show that $G$ contains a simple cycle of length at least $k+1$.
asked
Dec 30, 2016
in
Others
by
jothee
Veteran
(
108k
points)

11
views
cmi2016
descriptive
0
votes
0
answers
22
CMI2016B2a
A $\textit{simple path}$ (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex os repeated. The $length$ of such a path (respectively cycle) is the number of edges in the path (respectively cycle). Let $G$ be an undirected graph with minimum degree $k \geq 2$. Show that $G$ contains a simple path of length at least $k$.
asked
Dec 30, 2016
in
Others
by
jothee
Veteran
(
108k
points)

19
views
cmi2016
descriptive
+1
vote
0
answers
23
CMI2016B1
A group of war prisoners are trying to escape from a prison. They have thoroughly planned teh escape from the prison itself, and after that they hope to find shelter in a nearby village. However, the village (marked as $B$, see ... assuming that soldiers do not change their locations ($Hint$: Model this as a graph, with soldiers represented by the vertices.)
asked
Dec 30, 2016
in
Others
by
jothee
Veteran
(
108k
points)

37
views
cmi2016
descriptive
0
votes
0
answers
24
GATE198817iiiiii
The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations. ... For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.
asked
Dec 20, 2016
in
Others
by
jothee
Veteran
(
108k
points)

84
views
gate1988
nongate
descriptive
linearprogramming
0
votes
0
answers
25
GATE198816iiiii
If $x \ \underline{x} \ \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ and $\ A \ \infty = x^{Sup} \frac{\ A ... property of this norm. Although this norm is very easy to calculate for any matrix, explain why the condition number is difficult (i.e. expensive) to calculate.
asked
Dec 20, 2016
in
Linear Algebra
by
jothee
Veteran
(
108k
points)

110
views
gate1988
descriptive
matrices
outofsyllabusnow
0
votes
0
answers
26
GATE198816i
Assume that the matrix $A$ given below, has factorization of the form $LU=PA$, where $L$ is lowertriangular with all diagonal elements equal to 1, $U$ is uppertriangular, and $P$ is a permutation matrix. For $A = \begin{bmatrix} 2 & 5 ... \\ 8 & 2 & 3 \end{bmatrix}$ Compute $L, U,$ and $P$ using Gaussian elimination with partial pivoting.
asked
Dec 20, 2016
in
Linear Algebra
by
jothee
Veteran
(
108k
points)

161
views
gate1988
normal
descriptive
linearalgebra
matrices
+1
vote
0
answers
27
GATE198815
Consider the DFA $M$ and NFA M2 as defined below. Let the language accepted by machine $M$ be $L$. What language machine M2 accepts, if $F2=A$ ? $F2=B$ ? $F2=C$ ? $F2=D$ ? $M=(Q, \Sigma, \delta, q_0, F)$ $M2=(Q2, \Sigma, \delta_2, q_{00}, F2)$ where $Q2=(Q \times ... in \Sigma^* ( \delta (p,s) \in F) \}$ $D=\{\langle p, q, r \rangle \mid p \in Q; q \in F\}$
asked
Dec 20, 2016
in
Theory of Computation
by
jothee
Veteran
(
108k
points)

115
views
normal
gate1988
descriptive
theoryofcomputation
0
votes
0
answers
28
GATE198814ii
Consider the following wellformed formula: $\exists x \forall y [ \neg \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(y)$ Show using resolution principle that the wellformed formula, given above, cannot be satisfied for any interpretation.
asked
Dec 20, 2016
in
Mathematical Logic
by
jothee
Veteran
(
108k
points)

98
views
gate1988
descriptive
firstorderlogic
0
votes
0
answers
29
GATE198814i
Consider the following wellformed formula: $\exists x \forall y [ \neg \: \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(y)$ Express the above wellformed formula in clause form.
asked
Dec 20, 2016
in
Mathematical Logic
by
jothee
Veteran
(
108k
points)

74
views
gate1988
descriptive
firstorderlogic
+1
vote
3
answers
30
GATE198813iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$
asked
Dec 20, 2016
in
Algorithms
by
jothee
Veteran
(
108k
points)

216
views
gate1988
descriptive
algorithms
recurrence
Page:
1
2
3
4
5
6
...
17
next »
Quick search syntax
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
Recent Posts
isro sc 2017 2nd paper
Which college to expect?
Interview Guidance
CDAC CoursesAugust session
Counselling...
Follow @csegate
Gatecse
Recent questions tagged descriptive
Recent Blog Comments
Sir , pls guide us how to prepare for the ...
Sir in Indian edition it is present
Okay Thanks
i think they call everyone ith a score higher ...
@raviyogi Do you know what was the cutoff ot IIT ...
33,717
questions
40,263
answers
114,378
comments
38,900
users