Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User admin
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by admin
7
votes
1
TIFR CSE 2015 | Part B | Question: 8
Let $\sum_{1}= \left\{a\right\}$ be a one letter alphabet and $\sum_{2}= \left\{a, b\right\}$ be a two letter alphabet. A language over an alphabet is a set of finite length words comprising letters of the alphabet. Let $L_{1}$ and $L_{2}$ be the ... $L_{1}$ is countable but $L_{2}$ is not. $L_{2}$ is countable but $L_{1}$ is not. Neither of them is countable.
answered
in
Theory of Computation
Jan 2, 2016
3.5k
views
tifr2015
identify-class-language
0
votes
2
TIFR CSE 2015 | Part B | Question: 5
Suppose $\begin{pmatrix} 0&1 &0&0&0&1 \\ 1&0&1&0&0&0 \\ 0&1&0&1&0&1 \\ 0&0&1&0&1&0 \\ 0&0&0&1&0&1 \\ 1&0&1&0&1&0 \end{pmatrix}$ is the adjacency ... the above adjacency matrix? Only $(i)$ Only $(ii)$ Only $(iii)$ Only $(iv)$ $(i)$ and $(ii)$
answered
in
Graph Theory
Jan 2, 2016
3.2k
views
tifr2015
graph-connectivity
graph-theory
11
votes
3
TIFR CSE 2015 | Part A | Question: 1
Consider a $6$-sided die with all sides not necessarily equally likely such that probability of an even number is $P (\left \{2, 4, 6 \right \}) =\dfrac{1}{2}$, probability of a multiple of $3$ is $P (\left \{3, 6 \right \}) = 1/3$ and probability of $1$ is ... $P(\left \{ 5 \right \}) \leq \dfrac{1}{3}$ None of the above
answered
in
Probability
Jan 2, 2016
1.5k
views
tifr2015
probability
conditional-probability
1
vote
4
Calculating disk access time
A program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms. Page size is 4MB and track size is 32MB. If the pages of the program are contiguously placed on disk, then the total time required to load the program from disk in ms is _____ Given answer: 120
answered
in
Operating System
Nov 29, 2015
8.7k
views
operating-system
disk
1
vote
5
Identify the class of the language
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$ Identify the class of the language.
answered
in
Theory of Computation
Oct 24, 2015
461
views
theory-of-computation
identify-class-language
2
votes
6
TIFR CSE 2011 | Part B | Question: 28
Consider a basic block: x:= a[i]; a[j]:= y; z:= a[j] optimized by removing common sub expression a[i] as follows: x:= a[i]; z:= x; a[j]:= y. Which of the following is true? Both are equivalent. The values computed ... same values only if $i$ is not equal to $j$. They will be equivalent in concurrent programming languages with shared memory. None of the above.
answered
in
Operating System
Oct 23, 2015
1.3k
views
tifr2011
process-synchronization
operating-system
normal
2
votes
7
evaluation of prefix expression takes O(n^2)....true?
answered
in
DS
Oct 20, 2015
1.2k
views
data-structures
stack
infix-prefix
time-complexity
1
vote
8
Modulus operator in C
How C will behave with negative operands with modulus operator?
answered
in
Programming
Oct 20, 2015
508
views
programming-in-c
0
votes
9
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
answered
in
Operating System
Oct 19, 2015
333
views
operating-system
0
votes
10
if natural join is done then min and max no. of tuples if referential integrity is taken and not
R(ABC) S(BDE) F:A->B B ->C B->D D->E AND R HAS 100 TUPLES AND S HAS 200
answered
in
Databases
Oct 19, 2015
1.6k
views
natural-join
referential-integrity
1
vote
11
No. of MUX, NAND and NOR
answered
in
Digital Logic
Oct 19, 2015
1.1k
views
2
votes
12
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
answered
in
Operating System
Oct 17, 2015
19.1k
views
semaphore
isro2015
process-synchronization
0
votes
13
System call
main( ) { if (fork( ) == 0) { /* Child */ while (1) { for (i=0; i
answered
in
Operating System
Oct 17, 2015
205
views
operating-system
0
votes
14
GATE CSE 2001 | Question: 1.6
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
answered
in
Theory of Computation
Oct 16, 2015
13.9k
views
gatecse-2001
finite-automata
theory-of-computation
easy
minimal-state-automata
–3
votes
15
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
answered
in
Theory of Computation
Oct 16, 2015
15.3k
views
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
6
votes
16
seek time
the seek time of a disk is 30ms.it rotates at the rate of 30 rotations/second.the capacity of each track is 300 words.the access time is (approximately) guys can any one solve this plzzzz...
answered
in
CO and Architecture
Oct 16, 2015
9.5k
views
disk
1
vote
17
ISRO2008-7
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
answered
in
Theory of Computation
Oct 14, 2015
8.0k
views
isro2008
theory-of-computation
context-free-language
grammar
26
votes
18
OS Synchronization
Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } 5 What is the minimum and maximum possible value of count after the completion of the program? (a) 1, 40 (b) 2, 40 (c) 3, 40 (d) 4, 40
answered
in
Operating System
Oct 11, 2015
3.6k
views
process-synchronization
operating-system
0
votes
19
Predict the state of this system?
Consider the following process and resource requirement of each process. Process Type 1 Type 2 Used Max Used Max P1 1 2 1 3 P2 1 3 1 2 P3 2 4 1 4 Predict the ... of resource type 1 and 4 instances of resource type 2. a)Can go to safe or unsafe state based on sequence b)Safe state c)Unsafe state d)Deadlock state
answered
in
Operating System
Oct 10, 2015
1.1k
views
deadlock-prevention-avoidance-detection
0
votes
20
which of the following is not a necessary condition for deadlock?
which of the following is not a necessary condition for deadlock? a)Mutual exclusion b)Reentrancy c)Hold and Wait d)No pre-emption
answered
in
Operating System
Oct 10, 2015
37.7k
views
deadlock-prevention-avoidance-detection
2
votes
21
Find out the value of PC(Program Counter)?
A computer has 24-bits instructions.A program has been loaded into main memory with starting address of 300.Which of the following is the valid value for the PC(Program counter)? 1.$400$ 2.$500$ 3.$600$ 4.$700$
answered
in
CO and Architecture
Oct 9, 2015
2.6k
views
co-and-architecture
0
votes
22
when we realize a 64x1 mux using 4x1 muxes we have levels?
options are:- A) 2 B)3 C)4 D)5 Please provide answer with explanation.
answered
in
Digital Logic
Oct 7, 2015
5.4k
views
0
votes
23
a 4-way set - associative
a 4-way set - associative cache memory unit with a capacity of 16kb is built using a block size of 8 words. the word length is 32 bits. the size of the physical address space is 4gb.the number of bits for the tag field is i am geting the answer 21 tag field bit length but answer is 22 can any explain this question if answer is 22...
answered
in
CO and Architecture
Oct 7, 2015
1.9k
views
cache-memory
5
votes
24
TIFR CSE 2010 | Part A | Question: 17
Suppose there is a sphere with diameter at least $6$ inches. Through this sphere we drill a hole along a diameter. The part of the sphere lost in the process of drilling the hole looks like two caps joined to a cylinder, where the cylindrical part has length $6$ ... $36\pi$ cu. inches $27\pi$ cu. inches $32\pi$ cu. inches $35\pi$ cu. inches
answered
in
Quantitative Aptitude
Oct 7, 2015
729
views
tifr2010
quantitative-aptitude
geometry
19
votes
25
GATE CSE 2006 | Question: 43
Consider a new instruction named branch-on-bit-set (mnemonic bbs). The instruction bbs reg, pos, label jumps to label if bit in position pos of register operand reg is one. A register is $32$ -bits wide and the bits are numbered $0$ to $31,$ bit ... $ mask\leftarrow \text{0xffffffff} << pos$ $ mask\leftarrow pos $ $ mask\leftarrow \text{0xf}$
answered
in
CO and Architecture
Oct 6, 2015
8.2k
views
gatecse-2006
co-and-architecture
normal
instruction-execution
0
votes
26
no of state in minimal finite automata that accept the string from alphabet {a,b,c}
no of state in minimal finite automata that accept the string from alphabet {a,b,c} where no of a is divisible by 2 or 3 and no of c is divisible by 6?? plzz explain!!!
answered
in
Theory of Computation
Oct 3, 2015
816
views
0
votes
27
TIFR CSE 2010 | Part A | Question: 2
The hour hand and the minute hands of a clock meet at noon and again at mid-night. In between they meet $N$ times, where $N$ is.: $6$ $11$ $12$ $13$ None of the above
answered
in
Quantitative Aptitude
Oct 2, 2015
1.6k
views
tifr2010
quantitative-aptitude
clock-time
0
votes
28
Which statement is true?
Consider dfa , nfa & ∈-nfa accepting the same language, choose the correct statement? a) All three models always have the same number of states. b) The minimal dfa for all three machines is unique. c) The nfa model always has more number of states than the dfa. d) The ∈-nfa always has the maximum number of states.
answered
in
Theory of Computation
Oct 1, 2015
2.6k
views
finite-automata
theory-of-computation
0
votes
29
Which of the following statement is correct regarding DFS?
Which of the following statement is correct regarding DFS? 1) All the vertices are pushed in the stack during DFS Traversal. 2) No vertex is pushed more than once in the stack during traversal.
answered
in
Algorithms
Sep 29, 2015
2.2k
views
algorithms
graph-algorithms
depth-first-search
7
votes
30
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ?
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ? Does this imply that a subset of non regular language can be regular ?
answered
in
Theory of Computation
Sep 28, 2015
810
views
theory-of-computation
finite-automata
regular-expression
regular-language
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent Blog Comments
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....