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
Exam Category
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.
Search results for iisccsaresearch2016
+1
vote
4
answers
1
IISCCSAResearchTest10
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
asked
Jun 8, 2016
in
Graph Theory
by
jothee
Veteran
(
99.2k
points)

155
views
iisccsaresearch2016
descriptive
graphtheory
graphcoloring
iiscinterview
0
votes
3
answers
2
IISCCSAResearchTest3
Hardware cache memories exploit spatial locality of reference by remembering which pieces of data have been accessed recently when data items are reaccessed frequently by remembering which cache blocks (lines) have been written to only if cache block (line) size is greater than 1 byte
asked
Jun 8, 2016
in
CO & Architecture
by
jothee
Veteran
(
99.2k
points)

177
views
iisccsaresearch2016
coandarchitecture
cachememory
iiscinterview
0
votes
2
answers
3
IISCCSAResearchTest7
If we arrange the following according to increasing asymptotic complexity, which quantity comes in the second position; which one comes in the fourth position? $(\sqrt{2}^{\log n}, n^2, 2^{\sqrt{2 \log n} }, e^n, (\log n)!, n!$
asked
Jun 8, 2016
in
Algorithms
by
jothee
Veteran
(
99.2k
points)

108
views
iisccsaresearch2016
descriptive
algorithms
asymptoticnotations
iiscinterview
+1
vote
1
answer
4
IISCCSAResearchTest8
Write the truth table for the connective: "If A then B"
asked
Jun 8, 2016
in
Mathematical Logic
by
jothee
Veteran
(
99.2k
points)

74
views
iisccsaresearch2016
descriptive
mathematicallogic
iiscinterview
0
votes
1
answer
5
IISCCSAResearchTest1
What is the determinant of the following matrix? $\begin{matrix} 76 && 18 && 34 \\ 14 && 12 && 6 \\ 90 && 30 && 40 \end{matrix}$
asked
Jun 8, 2016
in
Linear Algebra
by
jothee
Veteran
(
99.2k
points)

119
views
iisccsaresearch2016
descriptive
linearalgebra
matrices
0
votes
2
answers
6
IISCCSAResearchTest9
Which of the following statement(s) is(are) true? If $n$ is odd prime number then $2^{n1} \text{ mod } n =1$ If $2^{n1} \text{ mod } n =1$ for a number $n$ then $n$ is prime
asked
Jun 8, 2016
in
Numerical Ability
by
jothee
Veteran
(
99.2k
points)

81
views
iisccsaresearch2016
descriptive
numericalability
iiscinterview
0
votes
1
answer
7
IISCCSAResearchTest5
A computer uses a 2way set associative cache of size 128 KBytes with block (line) size of 32 Bytes. The cache accepts 32 bit addresses of the form $b_{31}b_{30} \dots b_2b_1b_0$ where $b_{31}$ is the most significant address and $b_0$ is the least significant address bit. Which bits are used by the cache controller for indexing into the cache directory?
asked
Jun 8, 2016
in
CO & Architecture
by
jothee
Veteran
(
99.2k
points)

96
views
iisccsaresearch2016
descriptive
coandarchitecture
cachememory
iiscinterview
0
votes
1
answer
8
IISCCSAResearchTest6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
asked
Jun 8, 2016
in
Algorithms
by
jothee
Veteran
(
99.2k
points)

94
views
iisccsaresearch2016
descriptive
algorithms
graphalgorithms
minimumspanningtrees
iiscinterview
0
votes
1
answer
9
IISCCSAResearchTest4
What is the output of the following program? int main() { int i=0; do { if (i >=5) { i+=2; printf("%d \n", i); break; } else { printf("%d \n", ++i); continue; } } while (i<7); }
asked
Jun 8, 2016
in
Algorithms
by
jothee
Veteran
(
99.2k
points)

72
views
iisccsaresearch2016
descriptive
algorithms
identifyfunction
iiscinterview
0
votes
1
answer
10
IISCCSAResearchTest2
Which of the following components of a compiler runs earlier in the flow of compilation?  the lexical analyser  the type checker
asked
Jun 8, 2016
in
Compiler Design
by
jothee
Veteran
(
99.2k
points)

67
views
iisccsaresearch2016
descriptive
compilerdesign
iiscinterview
To see more, click for the
full list of questions
or
popular tags
.
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for iisccsaresearch2016
Recent Blog Comments
yes isro should change their dates. This is very ...
Hi Guys, I think this is not correct. ISRO ...
NIELIT specifically mailed that they decided ...
is there any chances of changing the exam date??
ISRO and NIELIT Exam on the same day i.e 17th ...
29,157
questions
36,984
answers
92,161
comments
34,824
users