Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rajsh3kar
1
answer
1
Complementation of DFA
Complementation of DFA works for all DFA is it true ? Given DFA, a should be followed by a 'b', In the complementation of this DFA the string aab is getting accepted a is getting followed by a 'b'
Complementation of DFA works for all DFA is it true ?Given DFA, a should be followed by a 'b',In the complementation of this DFA the string aab is getting accepted a is g...
930
views
answered
Mar 18, 2018
Theory of Computation
finite-automata
theory-of-computation
+
–
2
answers
2
When do floors and ceilings matter while solving recurrences?
every time while finding recurence solution (in CLRS book , page 88) a statement "Floors and ceilings usually do not matter when solving recurrences" but my doubt is when they matter ?
every time while finding recurence solution (in CLRS book , page 88) a statement "Floors and ceilings usually do not matter when solving recurrences" but my doubt is whe...
861
views
answer selected
Sep 22, 2017
Algorithms
algorithms
recurrence-relation
+
–
6
answers
3
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
15.1k
views
commented
Jun 18, 2017
CO and Architecture
gate1987
co-and-architecture
addressing-modes
easy
+
–
1
answer
4
Consider an air traffic system with 6 airlines suppose that
Consider an air traffic system with 6 airlines suppose that 1) Direct service between two cities means round trip direct service 2) Each pair of cities has direct service from at least one air line. Suppose also that no airline can schedule a cycle through an odd number of cities, what is the maximum number of cities in the system?
Consider an air traffic system with 6 airlines suppose that1) Direct service between two cities means round trip direct service2) Each pair of cities has direct service f...
444
views
answered
May 18, 2017
Graph Theory
graph-theory
+
–
1
answer
5
type of relation
how is it not transitive?? i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
how is it not transitive??i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
722
views
answered
May 11, 2017
Set Theory & Algebra
relations
engineering-mathematics
+
–
13
answers
6
GATE CSE 2017 Set 2 | Question: 55
Consider the following C program. #include<stdio.h> #include<string.h> int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; } The output of the program is _______
Consider the following C program.#include<stdio.h #include<string.h int main() { char* c="GATECSIT2017"; char* p=c; printf("%d", (int)strlen(c+2[p]-6[p]-1)); return 0; }T...
27.9k
views
commented
Apr 21, 2017
Programming in C
gatecse-2017-set2
programming-in-c
numerical-answers
array
pointers
+
–
3
answers
7
theory of computation
The language generated by the below grammar is S --> aSS / b
The language generated by the below grammar is S aSS / b
1.5k
views
commented
Apr 12, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
5
answers
8
GATE Overflow | Operating Systems | Test 1 | Question: 9
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) forever The code for $P_{10}$ is identical except that it uses $V$ (mutex) instead of $P$ (mutex) and vice ... number of processes that can be inside the critical section at any moment if initial value of the semaphore is 1? 1 2 3 none
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) foreverThe code for $P_{10}$ is identical except that it uses ...
897
views
answered
Apr 12, 2017
Operating System
go-os-1
operating-system
process-synchronization
mutex
+
–
5
answers
9
ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...
6.4k
views
answered
Apr 10, 2017
Operating System
operating-system
virtual-memory
paging
isro2016
+
–
2
answers
10
Finding matching number of graph
Given explanation: In the above explanation, it is written that matching number is 4 but I am getting matching number as 3 for this graph(choosing edges 1-2, 3-4 and 6-7). Please check where I am going wrong
Given explanation:In the above explanation, it is written that matching number is 4 but I am getting matching number as 3 for this graph(choosing edges 1-2, 3-4 and 6-7)....
2.3k
views
answered
Feb 15, 2017
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
2
answers
11
ER Model
The relationship between 2 entity A and B is 1:1 and the relationship is optional at the end . Only 50% of B entities are related To A . Now Consider mapping these entity types into relations Select the best statement : A ) A and B should be seperate and foreign ... B relation c) A and B should be seperate and foreign key should be in A and B both relation d) None of these Verify please
The relationship between 2 entity A and B is 1:1 and the relationship is optional at the end . Only 50% of B entities are related To A .Now Consider mapping these entity ...
1.8k
views
answered
Dec 15, 2016
Databases
databases
er-diagram
+
–
3
answers
12
Which blocksize is considered for transfering words from mem to cache incase miss if blocksize of memory & cache differ?
Case1) cache block size is 4 Words and memory block size is 8 WordsCase2) cache block size is 8 Words and memory block size is 4 Words
788
views
answered
Sep 30, 2015
CO and Architecture
cache-memory
co-and-architecture
memory-management
+
–
3
answers
13
explain
1.0k
views
commented
Sep 22, 2015
CO and Architecture
stall
pipelining
+
–
0
answers
14
find number of replacements and cache utilization
Consider the execution of the following program segment on a 4ⅹ10 array. The two-dimensional array A is stored in the main memory in a column major order. Assume that there are eight blocks in the cache, each is just one word, and that the LRU is used for replacement. ... A(0,j) End for AVE: SUM/10 For k: 0 to 9 do A(0,k): A(0, k)/AVE End for
Consider the execution of the following program segment on a 4ⅹ10 array. The two-dimensional array A is stored in the main memory in a column major order. Assume tha...
407
views
asked
Sep 19, 2015
CO and Architecture
co-and-architecture
cache-memory
+
–
12
answers
15
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
Consider the following C function.int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; }The return value of $fun(5)$...
21.2k
views
commented
Mar 25, 2015
Algorithms
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
+
–
1
answer
16
In message passing system how many points of synchronization is possible??
In message passing system how many points of synchronization is possible??
In message passing system how many points of synchronization is possible??
1.4k
views
commented
Jan 8, 2015
Operating System
operating-system
process-synchronization
inter-process-communication
+
–
2
answers
17
If a file consists of 5 attributes, than what is the number of secondary indices that can be constructed on the file?? plz answer n explain the anwer also.. :)
1.1k
views
answered
Jan 5, 2015
2
answers
18
GATE CSE 2005 | Question: 47
Which one of the following graphs is NOT planar? G1 G2 G3 G4
Which one of the following graphs is NOT planar? G1G2G3G4
8.3k
views
commented
Jan 5, 2015
Graph Theory
gatecse-2005
graph-theory
graph-planarity
normal
+
–
2
answers
19
GATE IT 2004 | Question: 37
What is the number of vertices in an undirected connected graph with $27$ edges, $6$ vertices of degree $2, 3$ vertices of degree $4$ and remaining of degree $3$? $10$ $11$ $18$ $19$
What is the number of vertices in an undirected connected graph with $27$ edges, $6$ vertices of degree $2, 3$ vertices of degree $4$ and remaining of degree $3$?$10$$11$...
13.0k
views
commented
Jan 5, 2015
Graph Theory
gateit-2004
graph-theory
graph-connectivity
normal
+
–
1
answer
20
Number of distinct graphs
Number of distinct graphs with p vertices and q edges ( p not equal to q) is always equal to a) p b) q c)min(p,q) d)max (p,q) e) none of this
Number of distinct graphs with p vertices and q edges ( p not equal to q) is always equal toa) pb) qc)min(p,q)d)max (p,q)e) none of this
618
views
asked
Jan 5, 2015
Graph Theory
graph-theory
+
–
6
answers
21
GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$
21.5k
views
answered
Dec 6, 2014
Graph Theory
gateit-2007
graph-theory
graph-connectivity
normal
+
–
2
answers
22
trees
Number of trees possible with 5 or fewer vertices is A) 5 B) 8 C) 7 D) 10 Ans is b . Please explain
Number of trees possible with 5 or fewer vertices is A) 5 B) 8 C) 7 D) 10 Ans is b . Please explain
1.1k
views
commented
Dec 6, 2014
4
answers
23
is it context free?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ? i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language as a^n b^n c^2n ?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ?i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language ...
4.5k
views
asked
Nov 28, 2014
Theory of Computation
theory-of-computation
context-free-language
+
–
1
answer
24
true or false?
abcd belongs to (b*a*)*(d*c*)*
abcd belongs to (b*a*)*(d*c*)*
450
views
asked
Nov 26, 2014
Theory of Computation
theory-of-computation
regular-expression
+
–
10
answers
25
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in...
30.1k
views
commented
Nov 21, 2014
Operating System
gatecse-2013
operating-system
disk
normal
+
–
3
answers
26
GATE IT 2007 | Question: 37
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order $3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24.$ Which of the following memory blocks will not be in the cache at the end of the sequence ? $3$ $18$ $20$ $30$
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order$3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, ...
7.9k
views
answered
Nov 21, 2014
CO and Architecture
gateit-2007
co-and-architecture
cache-memory
normal
+
–
2
answers
27
GATE IT 2006 | Question: 42
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is: $32$ $ns$ $64$ $ns$ $96$ $ns$ $128$ $ns$
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is:$...
11.8k
views
answered
Nov 21, 2014
CO and Architecture
gateit-2006
co-and-architecture
cache-memory
normal
+
–
8
answers
28
GATE IT 2004 | Question: 12, ISRO2016-77
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rat...
29.5k
views
answered
Nov 21, 2014
CO and Architecture
gateit-2004
co-and-architecture
cache-memory
normal
isro2016
+
–
3
answers
29
GATE IT 2004 | Question: 48
Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests: $4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7$ If LRU replacement policy is used, which cache block will have memory block $7$? $4$ $5$ $6$ $7$
Consider a fully associative cache with $8$ cache blocks (numbered $0-7$) and the following sequence of memory block requests:$4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, ...
15.0k
views
commented
Nov 21, 2014
CO and Architecture
gateit-2004
co-and-architecture
cache-memory
normal
+
–
5
answers
30
GATE IT 2005 | Question: 22
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$ In terms of Normalization, this table is in $1\;\text{NF}$ $2\;\text{NF}$ $3\;\text{NF}$ None of these
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$In terms of Normalization, this ...
7.4k
views
answered
Nov 21, 2014
Databases
gateit-2005
databases
database-normalization
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register