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 activity by Sukanya Das
User Sukanya Das
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sukanya Das
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
ISIMTECHCSE2018
One needs to choose six real numbers $x_1,x_2,....,x_6$ such that the product of any five of them is equal to other number. The number of such choices is $3$ $33$ $63$ $93$
answer selected
2 hours
ago
in
Combinatory

122
views
userisi2018
usermod
numbersystem
permutationsandcombinations
4
answers
2
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)$
comment edited
May 16
in
Mathematical Logic

252
views
engineeringmathematics
isi2017
probability
1
answer
3
# Self doubt
To get in shape, you have decided to start running to work. You want a route that goes entirely uphill and then entirely downhill so that you can work up a sweat going uphill and then get a nice breeze at the end of your run as you ... Assuming that every road segment is either uphill or downhill, give an efficient algorithm to find out shortest route that meets above specification??
answer selected
Apr 26
in
Algorithms

78
views
algorithms
2
answers
4
True/False
Which of the following statements related to graphs are True? Minimum Spanning Tree has ALWAYS Minimum weight edge included in it. Minimum Spanning Tree MIGHT have Maximum weight edge weight included in it. Maximum Spanning Tree has ALWAYS Maximum weight edge included ... edge included in it. Longest path from source to destination MAY OR MAY NOT have Maximum weight edge included in it.
answer selected
Apr 12
in
Graph Theory

106
views
graphs
graphalgorithms
algorithms
3
answers
5
BARC 2018
$\textbf{VPN}$ Works at which layer? Application layer Transport layer Network layer Datalink layer
answer selected
Apr 8
in
Computer Networks

166
views
computernetworks
networksecurity
barc2018
0
answers
6
Admission Query
Hi, I am 2016 B.Tech pass out.I currently do not have my degree certificate(I will take it from the university in some days). Is it alright to upload my provisional degree certificate in online pg admission forms?
commented
Apr 1
in
IISc/IITs

42
views
gate2018admissions
1
answer
7
****** Test Series
What will be the output of the following program? Void main() { int a = 5; a >> = 2; a << = 2; printf(“%d”,a); }
commented
Mar 31
in
Programming

142
views
0
answers
8
geeksforgeeks IP Addressing
An Internet Service Provider (ISP) has the following chunk of CIDRbased IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining with itself. ... .132.0/22 \text{ and } 245.248.132.0/21$ $245.248.136.0/24 \text{ and } 245.248.132.0/21$
closed
Mar 31
in
Computer Networks

76
views
computernetworks
ipaddressing
networkaddressing
ip
subnetting
0
answers
9
computer organization
A computer has a cache, main memory and a disk used for virtual memory. If reference word is in cache $15\hspace{0.1cm} ns$ are required to access it. If it is in main memory but not in cache, $50\hspace{0.1cm} nsec$ are needed to load it into cache and ... on this system will be____________. (in μsec) is this correct equation .$90*15 + .10*(.50*(50+15)+.50*(10000000+50))$
edited
Mar 31
in
CO & Architecture

29
views
coandarchitecture
2
answers
10
Virtual GATE Question
Let $L$ be a given contextfree language over the alphabet $\{a, b\}$. Construct $L1, L2$ as follows. Let $L1 = L − \{xyx \mid x, y \in \{a, b\}^*\}$, and $L2 = L·L$. Then, Both $L1$ and $L2$ are regular. Both $L1$ and $L2$ are context free but not necessarily regular. $L1$ is regular and $L2$ is context free. $L1$ and $L2$ both may not be context free.
edited
Mar 31
in
Theory of Computation

77
views
virtualgate
testseries
theoryofcomputation
0
answers
11
ME TEST
The format of double operand instruction of a CPU consist of $5$ bits opcode and $6$ bits for source and destination. $26$ double operand instructions and $184$ single operand instructions must be implemented. What will be the total number of zero operand instructions can be implemented? How to solve such questions? I always get confused.
retagged
Mar 31
in
CO & Architecture

51
views
coandarchitecture
1
answer
12
me test
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______ How to solve such examples. Rules for math of asymptotic notations(mul,div,add,sub of diif notations)
retagged
Mar 31
in
Algorithms

52
views
algorithms
1
answer
13
ugc net 2004
What item is at the root after the following sequence of insertions into an empty splay tree: $1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?$ $1$ $2$ $4$ $8$
edited
Mar 31
in
IS&Software Engineering

77
views
datastructure
splaytree
1
answer
14
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)$
edited
Mar 31
in
Algorithms

76
views
2
answers
15
time complexity
$t(n)= 2t(\sqrt n) +c $; if $n>2$ $\qquad =1$; if $n<=2$ $O(logn n) $ $O(log log n)$ $O(nlog n)$ $O(n)$
retagged
Mar 31
in
Algorithms

59
views
algorithms
1
answer
16
Test series
$\text{What is three address code representation of this ?}$ a+bc^d^e*fg
edited
Mar 31
in
Compiler Design

96
views
compiler
compilerdesign
2
answers
17
Time & work
$A$ does half as much work as $B$ in threefourths of the time. If together they take $18$ days to complete a work, how much time shall $A$ & $B$ take to do it individually ?
edited
Mar 31
in
Numerical Ability

90
views
numericalability
worktime
1
answer
18
Profit & loss
A cloth merchant announces $25$ percent rebate in prices. If one needs to have a rebate of $Rs. 40$, then how many shirts each costing $Rs. 32$, he should purchase ?
edited
Mar 31
in
Numerical Ability

58
views
numericalability
profitloss
0
answers
19
Radix Sort Problem
The complexity of Radix Sort is $O(wn)$, for $n$ keys which are integers of word size $w$. Here, $w=log_2(n^k)=k\times log_2(n)$ So, the complexity is $O(wn)=O(k\times log_2(n)\times n)$ For instance if size is $n^3$ the complexity ... nlogn)$ Then why we say radix sort sorts the input in linear time? Similar Concept used to solve : https://gateoverflow.in/3353/gate2008it43
retagged
Mar 31
in
Algorithms

54
views
algorithms
radixsort
timecomplexity
sorting
0
answers
20
Sheldon Ross
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and $\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$
edited
Mar 31
in
Combinatory

96
views
sheldonross
permutationsandcombinations
2
answers
21
For loop
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers Onethird of the product of the $3$ consecutive integers Onesixth of the product of the $3$ consecutive integers None of the above
edited
Mar 31
in
Algorithms

53
views
algorithms
1
answer
22
Self Doubt
What would be the execution order of the below statement? $$A \implies B \implies C$$
edited
Mar 31
in
Mathematical Logic

79
views
discretemathematics
2
answers
23
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.
retagged
Mar 31
in
Probability

50
views
probability
engineeringmathematics
2
answers
24
Theory of Computation Regular Expression
edited
Mar 31
in
Theory of Computation

83
views
theoryofcomputation
2
answers
25
mock test
Given an array $A[1:6,2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assume row major storage. $1245$ $1348$ $2434$ $1384$
edited
Mar 31
in
Programming

130
views
multidimensional
arrays
2
answers
26
mock test
Consider following pseudo code : main() { int t1,t2,t3; t1=t2=t3=0; t1=fork(); t2=fork(); if (t1!=0){t3=fork(); printf("Hello");} } How many Hello's are printed when above code get executed. $1$ $2$ $3$ $4$
edited
Mar 31
in
Operating System

155
views
fork
operatingsystem
1
answer
27
Made Easy Test Series
$L2$ is Regular ot not.?Please give proper example. $L_1= \{a^nb^n \mid n\geq 0 \} $ $L_2 = (L_1)^*$
edited
Mar 31
in
Theory of Computation

91
views
theoryofcomputation
1
answer
28
Combination Ex.14 Kenneth Rosen
How many bit strings of length $n$ contain exactly $r$ $1's$?
edited
Mar 31
in
Combinatory

140
views
discrete
discretemathematics
kennethrosen
counting
3
answers
29
Digital Logic
Convert $1100101110011011$ in binary to hexadecimal
retagged
Mar 31
in
Digital Logic

83
views
digitallogic
1
answer
30
Ambiguous or not
$S\rightarrow Aa\mid Bb$ $A\rightarrow aA\mid bA\mid \epsilon$ $B\rightarrow bB\mid aB\mid \epsilon$ is ambiguous or not
retagged
Mar 31
in
Theory of Computation

31
views
theoryofcomputation
1
answer
31
probability
From a pack of $52$ cards, all the face cards are removed and four cards are drawn. Then the probability that they are of different suit and different denomination is
edited
Mar 31
in
Probability

73
views
probability
engineeringmathematics
1
answer
32
Gateforum booklet
Which of the following is false? Regular sets are closed under substitution Regular sets are closed under homomorphism Regular sets are closed under inverse homomorphism Regular sets are closed under quotient with nonregular sets. iv) only iii) and iv) only iii) only None of these
edited
Mar 31
in
Theory of Computation

34
views
regularexpressions
1
answer
33
self doubt
#include<stdio.h> main() { char *p = 0; *p = 'a'; printf("value in pointer p is %c\n",*p); } What is the output of this code ? Why?
edited
Mar 31
in
Programming

40
views
programminginc
1
answer
34
Selfdoubt
#include <stdio.h> main() { if (sizeof(int) > 1) printf("True"); else printf("False"); } I expect output is True. But the output is False. Why? explain!!
edited
Mar 31
in
Programming

49
views
programminginc
1
answer
35
self doubt
#include <stdio.h> main() { float a ; double b ; scanf("%f %lf",&a, &b); if(a==b) printf ("true\n"); else if(a>b) printf("a>b"); else if(a<b) printf("a<b"); } Case 1: input $a=1, b=1$ output = true ... 1.1, b=1.1$ output= a>b case 3: input $a = 1.01, b= 1.01$ output = a<b Can anyone explain output of Case2 and Case3
edited
Mar 31
in
Programming

65
views
programminginc
1
answer
36
toc#reguler
Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is?? a)always finite language b)always infinite language and regular c)need not be infinite language. d)none
retagged
Mar 31
in
Theory of Computation

36
views
theoryofcomputation
0
answers
37
PGEE Sample Question
Consider the following four data structures: array, binary search tree, hash table, and a linked list. Which of the following options arranges them in nondecreasing order of worst case runtime for searching? Array, Binary Search Tree, Linked List, Hash Table Hash ... them in the worst cases: Arrayunsorted, BSTskewed, Hash Tablemapped to one location only, $LL$ has $O(n)$.
edited
Mar 31
in
Algorithms

142
views
iiithpgee
algorithms
2
answers
38
Random
Let $'r'$ be a regular expression, then which of the following statements is/are TRUE for every $'r'$? $\qquad S1: \text{There exists 'x' which satisfies property } r + x =x$. $\qquad S1: \text{There exists 'x' which satisfies property } r .x =x$. $\text{S1 is FALSE, S2 is FALSE}$ $\text{S1 is FALSE, S2 is TRUE}$ $\text{S1 is TRUE, S2 is FALSE}$ $\text{S1 is TRUE, S2 is TRUE}$
edited
Mar 31
in
Theory of Computation

80
views
theoryofcomputation
regularexpressions
1
answer
39
toc#reguler
how many states are there in a minimum DFA for language $L$ $L= 0, 00, 01, 001, 011$
retagged
Mar 31
in
Theory of Computation

22
views
theoryofcomputation
1
answer
40
toc#csl
$L = a^nb^nc^n$. complement of $L$? regular cfl csl recursive
edited
Mar 31
in
Theory of Computation

38
views
theoryofcomputation
35,519
questions
42,843
answers
121,778
comments
42,191
users