Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
jaisyking
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by jaisyking
0
answers
1
Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?
PDA for $a^i b^j | i \neq 2j+1$ ?
187
views
asked
Jan 12, 2023
Theory of Computation
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
+
–
6
answers
2
GATE CSE 2008 | Question: 3
The following system of equations $x_1 + x_2 + 2x_3 = 1$ $x_1 + 2x_2 + 3x_3 = 2$ $x_1 + 4x_2 + αx_3 = 4$ has a unique solution. The only possible value(s) for $α$ is/are $0$ either $0$ or $1$ one of $0, 1$, or $-1$ any real number
The following system of equations$x_1 + x_2 + 2x_3 = 1$$x_1 + 2x_2 + 3x_3 = 2$$x_1 + 4x_2 + αx_3 = 4$has a unique solution. The only possible value(s) for $α$ is/are$0$...
9.9k
views
commented
Jan 15, 2019
Linear Algebra
gatecse-2008
easy
linear-algebra
system-of-equations
+
–
1
answer
3
The maximum number of distinct subwords of the word "AXIOMATIZABLE" is: a)183 b) 111 c)92 d)88
5.0k
views
commented
Jan 13, 2019
Combinatory
combinatory
+
–
3
answers
4
GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable
Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...
28.1k
views
commented
Nov 21, 2018
Databases
gatecse-2014-set2
databases
transaction-and-concurrency
conflict-serializable
normal
+
–
4
answers
5
GATE CSE 2003 | Question: 63, ISRO2009-25
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements in the set. Deletion of the smallest element Insertion of an ... used but not a heap Both balanced binary search tree and heap can be used Neither balanced search tree nor heap can be used
A data structure is required for storing a set of integers such that each of the following operations can be done in $O(\log n)$ time, where $n$ is the number of elements...
20.1k
views
commented
Nov 2, 2018
DS
gatecse-2003
data-structures
easy
isro2009
binary-search-tree
+
–
8
answers
6
GATE CSE 1991 | Question: 01,x
Consider the following recursive definition of $fib$: fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2) The number of times $fib$ is called (including the first call) for evaluation of $fib(7)$ is___________.
Consider the following recursive definition of $fib$:fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2)The number of times $fib$ is called (includin...
10.1k
views
commented
Oct 30, 2018
Programming in C
gate1991
programming
recursion
normal
numerical-answers
+
–
4
answers
7
GATE IT 2008 | Question: 50
Consider the C program below. What does it print? # include <stdio.h> # define swapl (a, b) tmp = a; a = b; b = tmp void swap2 ( int a, int b) { int tmp; tmp = a; a = b; b = tmp; } void swap3 (int*a, int*b) { int tmp; tmp = *a; *a = *b; *b ... (num1 > = num2) {swap3 (&num1, &num2);} printf ("%d, %d", num1, num2); } $5, 5$ $5, 4$ $4, 5$ $4, 4$
Consider the C program below. What does it print?# include <stdio.h # define swapl (a, b) tmp = a; a = b; b = tmp void swap2 ( int a, int b) { int tmp; tmp = a; a = b; b ...
10.4k
views
commented
Oct 29, 2018
Programming in C
gateit-2008
programming
programming-in-c
easy
parameter-passing
+
–
1
answer
8
CMI2010 - 6
You are given a list of positive integers along with a sequence of operations from the set $\left \{ *,+\right \}$ .You construct expressions from these two lists so that: The numbers in the expression are drawn from the first list, without repetition and ... assume that the length of the first list is more than the length of the second list. Describe an algorithm to solve this problem.
You are given a list of positive integers along with a sequence of operations from the set $\left \{ *,+\right \}$ .You construct expressions from these two lists so that...
2.3k
views
commented
Oct 28, 2018
Algorithms
algorithms
descriptive
cmi2010
algorithm-design
+
–
3
answers
9
GATE IT 2006 | Question: 52
The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m > n$) int func(int m, int n) { if (E) return 1; else return(func(m -1, n) + func(m - 1, n - 1)); } In the above function, which of the following is the ... $(m = = 1)$ $(n = = 0) || (m = = n)$ $(n = = 0)$ && $(m = = n)$
The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m n$)int func(int m, int n) { if (E) retu...
8.0k
views
commented
Oct 26, 2018
Algorithms
gateit-2006
algorithms
identify-function
normal
+
–
2
answers
10
GATE CSE 1990 | Question: 9b
Assuming the current disk cylinder to be $50$ and the sequence for the cylinders to be $1, 36, 49, 65, 53, 12, 3, 20, 55, 16, 65$ and $78$ find the sequence of servicing using Shortest seek time first (SSTF) and Elevator disk scheduling policies.
Assuming the current disk cylinder to be $50$ and the sequence for the cylinders to be $1, 36, 49, 65, 53, 12, 3, 20, 55, 16, 65$ and $78$ find the sequence of servicing ...
5.5k
views
commented
Oct 25, 2018
Operating System
gate1990
descriptive
operating-system
disk-scheduling
+
–
4
answers
11
GATE CSE 2015 Set 3 | Question: GA-10
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage in...
5.5k
views
commented
Oct 25, 2018
Quantitative Aptitude
gatecse-2015-set3
quantitative-aptitude
data-interpretation
normal
numerical-answers
+
–
6
answers
12
GATE CSE 2003 | Question: 72
The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE? $((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ ... if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable $(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable
The following resolution rule is used in logic programming.Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$Which of the following statements related to th...
13.9k
views
commented
Oct 10, 2018
Mathematical Logic
gatecse-2003
mathematical-logic
normal
propositional-logic
+
–
5
answers
13
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$$( \forall x \,...
20.5k
views
commented
Oct 9, 2018
Mathematical Logic
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
+
–
3
answers
14
GATE CSE 2015 Set 2 | Question: 42
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack ... value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack...
16.8k
views
commented
Sep 18, 2018
CO and Architecture
gatecse-2015-set2
co-and-architecture
machine-instruction
easy
+
–
6
answers
15
GATE CSE 2018 | Question: 3
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' ... $\Theta(1), \Theta(n)$ $\Theta(n), \Theta(1)$ $\Theta(n), \Theta(n)$
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of node...
15.2k
views
commented
Aug 6, 2018
DS
gatecse-2018
algorithms
data-structures
queue
normal
linked-list
1-mark
+
–
0
answers
16
Finite Automata
Whenever it is mentioned to derive minimal finite automata. We should go with DFA or NFA?
Whenever it is mentioned to derive minimal finite automata. We should go with DFA or NFA?
260
views
asked
Jun 15, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register