Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged iisccsaresearch2016
1
votes
0
answers
1
IISc Research Field
Can anybody please tell what INTERDISCIPLINARY PROGRAM - CYBER PHYSICAL SYSTEM is in IISc? It seems to be an interesting research area by whatever I have read but after seeing the cut off scores for this field it seems nobody is much interested in this field. What may be the reason for such less interest in this field?
Can anybody please tell what INTERDISCIPLINARY PROGRAM - CYBER PHYSICAL SYSTEM is in IISc? It seems to be an interesting research area by whatever I have read but after s...
vishal chugh
597
views
vishal chugh
asked
Mar 20, 2018
IISc/IITs
iisccsaresearch2016
+
–
1
votes
4
answers
2
IISC-CSA-Research-Test-10
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?
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 num...
go_editor
776
views
go_editor
asked
Jun 8, 2016
Graph Theory
iisccsaresearch2016
descriptive
graph-theory
graph-coloring
iisc-interview
+
–
0
votes
2
answers
3
IISC-CSA-Research-Test-9
Which of the following statement(s) is(are) true? If $n$ is odd prime number then $2^{n-1} \text{ mod } n =1$ If $2^{n-1} \text{ mod } n =1$ for a number $n$ then $n$ is prime
Which of the following statement(s) is(are) true?If $n$ is odd prime number then $2^{n-1} \text{ mod } n =1$If $2^{n-1} \text{ mod } n =1$ for a number $n$ then $n$ is pr...
go_editor
452
views
go_editor
asked
Jun 8, 2016
Quantitative Aptitude
iisccsaresearch2016
descriptive
quantitative-aptitude
iisc-interview
+
–
2
votes
1
answer
4
IISC-CSA-Research-Test-8
Write the truth table for the connective: "If A then B"
Write the truth table for the connective: "If A then B"
go_editor
335
views
go_editor
asked
Jun 8, 2016
Mathematical Logic
iisccsaresearch2016
descriptive
mathematical-logic
iisc-interview
+
–
0
votes
3
answers
5
IISC-CSA-Research-Test-6
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.
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? I...
go_editor
657
views
go_editor
asked
Jun 8, 2016
Algorithms
iisccsaresearch2016
descriptive
algorithms
graph-algorithms
minimum-spanning-tree
iisc-interview
+
–
0
votes
1
answer
6
IISC-CSA-Research-Test-5
A computer uses a 2-way 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?
A computer uses a 2-way 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_...
go_editor
532
views
go_editor
asked
Jun 8, 2016
CO and Architecture
iisccsaresearch2016
descriptive
co-and-architecture
cache-memory
iisc-interview
+
–
0
votes
1
answer
7
IISC-CSA-Research-Test-4
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); }
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...
go_editor
411
views
go_editor
asked
Jun 7, 2016
Algorithms
iisccsaresearch2016
descriptive
algorithms
identify-function
iisc-interview
+
–
0
votes
3
answers
8
IISC-CSA-Research-Test-3
Hardware cache memories exploit spatial locality of reference by remembering which pieces of data have been accessed recently when data items are re-accessed frequently by remembering which cache blocks (lines) have been written to only if cache block (line) size is greater than 1 byte
Hardware cache memories exploit spatial locality of referenceby remembering which pieces of data have been accessed recentlywhen data items are re-accessed frequentlyby r...
go_editor
1.2k
views
go_editor
asked
Jun 7, 2016
CO and Architecture
iisccsaresearch2016
co-and-architecture
cache-memory
iisc-interview
+
–
0
votes
1
answer
9
IISC-CSA-Research-Test-2
Which of the following components of a compiler runs earlier in the flow of compilation? - the lexical analyser - the type checker
Which of the following components of a compiler runs earlier in the flow of compilation?- the lexical analyser- the type checker
go_editor
286
views
go_editor
asked
Jun 7, 2016
Compiler Design
iisccsaresearch2016
descriptive
compiler-design
iisc-interview
+
–
0
votes
1
answer
10
IISC-CSA-Research-Test-1
What is the determinant of the following matrix? $\begin{matrix} 76 && 18 && 34 \\ 14 && 12 && 6 \\ 90 && 30 && 40 \end{matrix}$
What is the determinant of the following matrix?$\begin{matrix} 76 && 18 && 34 \\ 14 && 12 && 6 \\ 90 && 30 && 40 \end{matrix}$
go_editor
450
views
go_editor
asked
Jun 7, 2016
Linear Algebra
iisccsaresearch2016
descriptive
linear-algebra
matrix
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register