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 Phalkey
2
answers
1
GATE CSE 1998 | Question: 4
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language: $L=\{w \in \{0, 1\}^* \mid w$ interpreted as binary number (ignoring the leading zeros) is divisible by five $\}.$
Design a deterministic finite state automaton (using minimum number of states) that recognizes the following language:$L=\{w \in \{0, 1\}^* \mid w$ interpreted as binar...
11.9k
views
commented
Sep 26, 2018
Theory of Computation
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
descriptive
+
–
5
answers
2
GATE CSE 2003 | Question: 55
Consider the NFA $M$ shown below. Let the language accepted by $M$ be $L$. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of $M$ to a non-accepting state and by changing the non-accepting states of $M$ to accepting states. Which ... statements is true? $L_1 = \{0,1\}^*-L$ $L_1 = \{0,1\}^*$ $L_1 \subseteq L$ $L_1 = L$
Consider the NFA $M$ shown below.Let the language accepted by $M$ be $L$. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of ...
14.5k
views
commented
Sep 25, 2018
Theory of Computation
gatecse-2003
theory-of-computation
finite-automata
normal
+
–
1
answer
3
Consider the following languages
Consider the following languages $A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$ $B=\left\{\langle M \rangle \mid \text{ TM M accepts more than 2 distinct inputs} \right\}$ Identify the ... Turing recognizable $A$ is not Turing recognizable Both $A$ and $B$ are Turing recognizable Neither $A$ nor $B$ is Turing recognizable
Consider the following languages$A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$$B=\left\{\langle M \rangle \mid \text{ TM M acce...
10.8k
views
commented
Sep 24, 2018
Theory of Computation
turing-machine
theory-of-computation
normal
+
–
5
answers
4
GATE CSE 2014 Set 3 | Question: 15
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______. $a^*b^*(ba)^*a^*$
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______.$$a^*b^*(ba)^*a^*$$
13.8k
views
commented
Sep 14, 2018
Theory of Computation
gatecse-2014-set3
theory-of-computation
regular-expression
numerical-answers
easy
+
–
3
answers
5
GATE CSE 1998 | Question: 1.23
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
14.6k
views
commented
Sep 14, 2018
Combinatory
gate1998
combinatory
normal
+
–
0
answers
6
Korth
12.3... anyone could solve for joins
12.3... anyone could solve for joins
160
views
asked
Sep 11, 2018
1
answer
7
Can anyone please help me with that UNDO and REDO concept in recovery of transaction with commit and checkpoint?
3.8k
views
commented
Sep 10, 2018
9
answers
8
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
28.3k
views
commented
Sep 10, 2018
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
5
answers
9
GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...
25.5k
views
commented
Sep 10, 2018
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
normal
+
–
6
answers
10
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
13.7k
views
commented
Sep 8, 2018
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
4
answers
11
GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions ...
27.2k
views
commented
Sep 8, 2018
Databases
gatecse-2017-set1
databases
timestamp-ordering
normal
transaction-and-concurrency
+
–
1
answer
12
gate-08
what are the attributes of all the minimum tables formed??
what are the attributes of all the minimum tables formed??
227
views
asked
Aug 26, 2018
9
answers
13
GATE CSE 2017 Set 1 | Question: 53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
Consider the following C program.#include<stdio.h #include<string.h void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) c) ? strlen...
25.3k
views
commented
Aug 19, 2018
Programming in C
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
+
–
0
answers
14
gate 15 set-2
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; } return value of fun(5)??? how to solve this using tree method approach???
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;}return value of fun(5)??? how to solve this using tree method approach???
311
views
asked
Aug 18, 2018
0
answers
15
BOOK korth relational model
differnce between . year≥2009(takes) join student year≥2009(takes join student) with example
differnce between .year≥2009(takes) join studentyear≥2009(takes join student)with example
222
views
asked
Jul 5, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register