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. For hardcopy of previous year questions please see
here
Answers by Tesla!
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
ISI 2016 MMA 24
let $f:\mathbb{R} \rightarrow \mathbb{R}$ be a strictly increasing function. Then which one of the following is always true? A) The limits $\lim_{x\rightarrow a+} f(X)$ and $\lim_{x\rightarrow a} f(X)$ exist for all real number a B) if $f$ is differentiable at a ... that $f(x) < B$ for all real $x$ D) There cannot not be a real number $L$ such that $f(x) > L$ for all real $x$
answered
Apr 30
in
Calculus

42
views
isi2016
functions
0
votes
2
ISI201602
How many complex numbers $z$ are there such that $\mid z+1 \mid = \mid z+i \mid$ and $\mid z \mid = 5$ ? $0$ $1$ $2$ $3$
answered
Apr 30
in
Mathematical Logic

70
views
engineeringmathematics
complexnumber
0
votes
3
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.
answered
Apr 28
in
Others

85
views
cmi2016
descriptive
0
votes
4
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}$, the spelling ... among all alignments of $x$ and $y$. What is the running time of your algorithm (in terms of the lengths of $x$ and $y$)?
answered
Apr 28
in
Others

37
views
cmi2016
descriptive
0
votes
5
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 i < n} 3^{ ... $$ Design a finite automaton that accepts exactly the set of strings $ x \in \{0, 1, 2\}^*$ such that $val(x)$ is divisible by 4.
answered
Apr 28
in
Others

43
views
cmi2016
descriptive
0
votes
6
ISI2017MMA27
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second coin is drawn at random from the box ( without replacing the first one). Given that the first coin has shown ... that the second coin is fair, is $\frac{20}{39}$ $\frac{20}{37}$ $\frac{1}{2}$ $\frac{7}{13}$
answered
Apr 25
in
Probability

93
views
isi2017
probability
+1
vote
7
ISI201729
Suppose the rank of the matrix $$\begin{pmatrix}1&1&2&2\\1&1&1&3\\a&b&b&1\end{pmatrix}$$ is $2$ for some real numbers $a$ and $b$. Then $b$ equals $1$ $3$ $1/2$ $1/3$
answered
Apr 24
in
Linear Algebra

150
views
isi2017
engineeringmathematics
matrices
rankofmatrix
0
votes
8
ISI201719
If $\alpha, \beta$ and $\gamma$ are the roots of $x^3  px +q = 0$, then the value of the determinant $$\begin{vmatrix}\alpha & \beta & \gamma\\\beta & \gamma & \alpha\\\gamma & \alpha & \beta\end{vmatrix}$$ is $p$ $p^2$ $0$ $p^2+6q$
answered
Apr 24
in
Mathematical Logic

110
views
isi2017
matrices
determinant
+2
votes
9
ISI 2017 MMA 1
The area lying in the first quadrant and bounded by the circle $x^{2}+y^{2}=4$ and the lines $x= 0$ and $x=1$ is given by $\frac{\pi}{3}+\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{4}$ $\frac{\pi}{3}\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{2}$
answered
Apr 23
in
Calculus

89
views
isi2017
calculus
areaundercurve
0
votes
10
Maths: Probability Distribution
Suppose X is a uniform random variable between 0.50 and 1.00. What is the probability that a randomly selected value of X is between 0.55 and 0.60 or between 0.75 and 0.85? A. 0.00 B. 0.15 C. 0.60 D. 0.30
answered
Apr 22
in
Probability

97
views
engineeringmathematics
probability
randomvariable
+1
vote
11
PGEE 2018
let 5,8,11,14,17,20.. be series then 320 will be which term of this series A) 104 B) 106 C) 962 D) 87
answered
Apr 22
in
Set Theory & Algebra

54
views
iiithpgee
0
votes
12
Data Transfer
I have a normal Doubt Consider a Scenario: 1. Total number of block are = K Total number of records per block = P Size of record = B bytes And we need to transfer all the blocks in memory. Avg rotation latency = R Seek time = S Block transfer rate ... rotation latency and transfer time for every block rt? else in one access i can transfer everything??? Plz correct me if i am wrong?
answered
Apr 14
in
Operating System

27
views
disks
0
votes
13
self  doubt
Physical memory are divide into frame. The frame of each size are equal. Is the word size in each frame same or it may possible to different in size ? (I am taking about word size in two different frame in main memory. )
answered
Apr 14
in
Operating System

30
views
operatingsystem
memorymanagement
+4
votes
14
Introduction to Computer Theory
Give CFG for the following language L =$ {(a^{m})(b^{m+n})(c^{n})  m,n= 0,1,2,.....}$
answered
Apr 12
in
Theory of Computation

55
views
theoryofcomputation
contextfreelanguage
0
votes
15
ISI201411
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{pmatrix}X_1 &X_2\\ X_3 &X_4\end{pmatrix}$ is nonsingular equals $1/2$ $3/8$ $5/8$ $1/4$
answered
Apr 11
in
Mathematical Logic

111
views
isi2014
probability
+1
vote
16
ISI2015CS6b
Consider scheduling $n$ processes $P_1, P_2, \dots, P_n$ which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst of duration $D$ units (and no I/O bursts). Compute the average waiting time and ... switch from one running process to another and $\Delta$ units of time to switch from a terminated process to a running process.
answered
Apr 11
in
Operating System

433
views
descriptive
isi2015
operatingsystem
processschedule
+3
votes
17
Probability Practice
Six balls are to be randomly chosen from an urn containing 8 red, 10 green, and 12 blue balls. What is the probability at least one red ball, one blue and one green ball is chosen?
answered
Apr 10
in
Probability

372
views
probability
+4
votes
18
ISI201721
There are four machines and it is known that exactly two of them are faulty. They are tested one by one in a random order till both the faulty machines are identified. The probability that only two tests are required is $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{6}\right)$
answered
Apr 6
in
Probability

268
views
engineeringmathematics
isi2017
probability
0
votes
19
ISI20178
answered
Apr 6
in
Mathematical Logic

42
views
0
votes
20
Permutations
answered
Apr 6
in
Combinatory

90
views
permutationsandcombinations
isisamplepapers
0
votes
21
Self Doubt
Q1. Find 1's and 2's complement of decimal number of 15 Q2. Find 1's and 2's complement of decimal number of 15 Answer with Explanation will be welcomed. :)
answered
Apr 4
in
Digital Logic

81
views
digitallogic
+1
vote
22
ISI sample paper
answered
Apr 4
in
Operating System

78
views
isisamplepapers
0
votes
23
Boolean lattice
If X and Y are distributive lattice then show that X×Y are also distributive lattice ?
answered
Mar 27
in
Mathematical Logic

117
views
booleanalgebra
0
votes
24
largest number
I take an integer $n$ .If $n$ is even, I divide it by $2$, if it is odd, I multiple $n$ by $3$ and add one to the product.I keep doing this till the number reduces to $1$.If I start with $5$ for example,I reach $1$ in $5$ steps. $(16, ... )$. $7$ takes $16$ steps to reach $1$. The number between $1$ and $2000000000$ that requires the largest number of steps to reach $1$ this way is?
answered
Mar 22
in
Numerical Ability

105
views
numericalability
+2
votes
25
Fork System Call
#include<stdio.h> #include<stdlib.h> void main() { int a =100; if(fork()==0) { a=a+5; printf("%d %d \n",a,&a ); } } How many parent and child process will be created?
answered
Mar 9
in
Operating System

295
views
operatingsystem
fork
+1
vote
26
Rosen (Graphs)
How much storage is needed to represent a simple graph with n vertices and m edges using. a) adjacency lists? b) an adjacency matrix? c) an incidence matrix?
answered
Mar 1
in
Graph Theory

103
views
graphtheory
kennethrosen
0
votes
27
Memory managment
Difference between static memory allocation and dynamic memory allocation.(Need concept clearing explanation)
answered
Mar 1
in
Programming

49
views
memory
memoryallocation
programminginc
+4
votes
28
Find the grammar for the languages (PeterLinz)
answered
Feb 27
in
Theory of Computation

110
views
theoryofcomputation
peterlinz
grammar
+1
vote
29
WebProbability
A candidate is selected for interview of management trainees for $3$ companies. For the first company, there are $12$ candidates, for the second there are $15$ candidates and for the third, there are $10$ candidates. Find the probability that he is ... be selected in each of the interviews, and all candidates appearing for the interview have an equal probability of getting selected.
answered
Feb 27
in
Probability

55
views
probability
engineeringmathematics
+1
vote
30
Rosen Ex1.1 Q No. 45
Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a fork in the ... A villager is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?
answered
Feb 26
in
Mathematical Logic

85
views
discretemathematics
mathematicallogic
puzzle
0
votes
31
JEST Exam
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this.They decide to settle this by an actual trial; if within n coin tosses, no two ... has been demonstrated. What happens for larger values of n? Is it true that P(n) only increases with n? Justify your answer.
answered
Feb 17
in
Probability

94
views
jest
0
votes
32
how to solve
answered
Feb 16
in
Set Theory & Algebra

91
views
+2
votes
33
GATE201847
Consider the following undirected graph $G$: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.
answered
Feb 14
in
Algorithms

1.9k
views
gate2018
algorithms
graphalgorithms
minimumspanningtrees
numericalanswers
+1
vote
34
Complement of CFL
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
answered
Feb 14
in
Theory of Computation

116
views
contextfreelanguage
theoryofcomputation
+4
votes
35
time complexity
let $S$ be a String containing either $0$ or $1$ .further there are no two consecutive $0s$ in $S$. No of solution on an input size $S(N)$ is bounded by $O(n^2)$ $O(nlogn)$ $O(2^n)$ $O(n)$
answered
Feb 14
in
Algorithms

77
views
0
votes
36
operating system
Context switching time in FCFS scheduling algorithm have less than equal to RoundRobin. explain this statement
answered
Feb 7
in
Operating System

90
views
0
votes
37
CMI2017B1
Let Σ = {a, b, c}. Let Leven be the set of all even length strings in Σ* (a) Construct a deterministic finite state automaton for L$_{EVEN}$. (b) We consider an operation Erase$_{ab}$ that takes as input a string w ∈ Σ* and erases all occurrences of the pattern ab from w ... in L: Erease$_{ab}$(L):= { Erease$_{ab}$(w)  w$\in$ L} Show that Erase$_{ab}$(L$_{even}$) is a regular language.
answered
Feb 6
in
Theory of Computation

90
views
cmi2017
theoryofcomputation
0
votes
38
CMI2017B4
In a party there are 2n participants, where n is a positive integer. Some participants shake hands with other participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total number of handshakes is not more than n2
answered
Feb 6
in
Combinatory

107
views
cmi2017
handshake
permutationsandcombinations
+3
votes
39
CMI2017A02
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository. Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated during these ... \\ 3 \end{pmatrix}*\begin{pmatrix} 7\\ 3 \end{pmatrix}*\begin{pmatrix} 10\\ 6 \end{pmatrix}^{1}$
answered
Feb 5
in
Probability

116
views
probability
cmi2017
0
votes
40
CMI2017A04
City authorities are concerned about traffic accidents on major roads. They would like to have ambulances stationed at road intersections to quickly reach the scene of any accident along these roads. To minimize response time, ambulances are to be located at intersections with ... (b) Find a spanning tree with minimum (c) Find a minimal coloring. (d) Find a minimum size vertex cover.
answered
Feb 5
in
Graph Theory

57
views
algorithms
graphalgorithms
cmi2017
Page:
1
2
3
4
5
6
7
next »
36,194
questions
43,647
answers
124,088
comments
42,929
users