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 abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by abhishekmehta4u
1
vote
151
Peter Linz Edition 4 Exercise 2.2 Question 7 (Page No. 55)
Design an nfa with no more than five states for the set {$abab^n: n ≥ 0$} $∪$ {$aba^n: n ≥ 0$}. Do you think this can be solved with fewer than three states? (Question 9)
answered
in
Theory of Computation
Mar 24, 2019
520
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
2
votes
152
Peter Linz Edition 4 Exercise 2.2 Question 8 (Page No. 55)
Construct an nfa with three states that accepts the language {$ab,abc$}*.
answered
in
Theory of Computation
Mar 24, 2019
443
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
4
votes
153
Peter Linz Edition 4 Exercise 2.2 Question 11 (Page No. 55)
Find an nfa with four states for $L$ = {$a^n: n ≥ 0$} $∪$ {$b^na: n ≥ 1$} .
answered
in
Theory of Computation
Mar 24, 2019
3.2k
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
1
vote
154
Peter Linz Edition 4 Exercise 2.2 Question 13 (Page No. 55)
What is the complement of the language accepted by the nfa in the following figure:
answered
in
Theory of Computation
Mar 24, 2019
311
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
0
votes
155
Peter Linz Edition 4 Exercise 2.2 Question 16 (Page No. 55)
Find an nfa that accepts {$a$}* and is such that if in its transition graph a single edge is removed (without any other changes), the resulting automaton accepts {$a$}. Can this be solved using a dfa? If so, give the solution; if not, give convincing arguments for your conclusion. (Question 17)
answered
in
Theory of Computation
Mar 24, 2019
869
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
3
votes
156
Peter Linz Edition 4 Exercise 2.2 Question 21 (Page No. 56)
An nfa in which (a) there are no λ-transitions, and (b) for all $q ∈ Q$ and all $a ∈ Σ$, $δ (q,a)$contains at most one element, is sometimes called an incomplete dfa. This is reasonable since the conditions make it such that there is never any choice of moves. For $Σ = $ {$a,b$}, convert the incomplete dfa below into a standard dfa
answered
in
Theory of Computation
Mar 24, 2019
1.0k
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
1
vote
157
Peter Linz Edition 4 Exercise 2.3 Question 1 (Page No. 62)
Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N= (Q_N, Σ,δ N,q0,F_N)$. Then there exists a deterministic finite accepter $M_D= (Q_D, Σ,δ_D,${$q_0$}$,F_D)$ such that $L= L (M_D)$. convert the nfa in following figure to a dfa: Can you see a simpler answer more directly?
answered
in
Theory of Computation
Mar 24, 2019
364
views
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
5
votes
158
GATE CSE 1999 | Question: 12
In binary tree, a full node is defined to be a node with $2$ children. Use induction on the height of the binary tree to prove that the number of full nodes plus one is equal to the number of leaves. Draw the min-heap that results from insertion of the following ... empty min-heap: $7, 6, 5, 4, 3, 2, 1$. Show the result after the deletion of the root of this heap.
answered
in
DS
Mar 24, 2019
4.4k
views
gate1999
data-structures
binary-heap
normal
descriptive
4
votes
159
Turing Machine Self Doubt
Can someone explain in details how set of all TM is countable?
answered
in
Theory of Computation
Mar 24, 2019
603
views
turing-machine
theory-of-computation
counting
set-theory
0
votes
160
Syntax directed translation
answered
in
Compiler Design
Mar 24, 2019
986
views
compiler-design
syntax-directed-translation
ace-test-series
2
votes
161
Self Doubt on scoping
int x = 5, y = 10 ; void main ( ) { int i = 2, j = 3 A (i, j); } void A (int i, int j) { int x = 10, y = 5 ; i = i + x : j = i + y : printf ("%d %d", i, j); B (i, j); } void B (int i, int j) { i ... by-name 3. call-by-need 4. call-by-value 5.Static scoping 6.Dynamic scoping Any reference for call by name and call by need Is for static coping $12,17,54$ or $12,17,59$?
answered
in
Programming in C
Mar 24, 2019
452
views
programming-in-c
dynamic-scoping
parameter-passing
4
votes
162
GATE CSE 2009 | Question: 11
What is the number of swaps required to sort $n$ elements using selection sort, in the worst case? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
answered
in
Algorithms
Mar 23, 2019
27.6k
views
gatecse-2009
algorithms
sorting
easy
10
votes
163
GATE CSE 2009 | Question: 39
In quick-sort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time complexity of the quick sort? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
answered
in
Algorithms
Mar 23, 2019
21.3k
views
gatecse-2009
algorithms
sorting
normal
1
vote
164
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
answered
in
Theory of Computation
Mar 23, 2019
13.1k
views
gatecse-2009
theory-of-computation
easy
identify-class-language
5
votes
165
GATE CSE 2009 | Question: 43
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below: $T_1: R_1[x]W_1[x]W_1[y]$ $T_2: R_2[x]R_2[y]W_2[y]$ $S_1: R_1[x]R_2[x]R_2[y] W_1[x] W_1[y] W_2[y]$ ... $S_1 \text{ and } S_2$ $S_2 \text{ and } S_3$ $S_3$ only $S_4$ only
answered
in
Databases
Mar 23, 2019
6.5k
views
gatecse-2009
databases
transaction-and-concurrency
normal
6
votes
166
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
answered
in
DS
Mar 23, 2019
43.3k
views
gatecse-2009
data-structures
binary-search-tree
normal
isrodec2017
avl-tree
3
votes
167
GATE CSE 2009 | Question: 60
Consider a binary max-heap implemented using an array. What is the content of the array after two delete operations on $\left\{25,14,16,13,10,8,12\right\}$ $\left\{14,13,12,10, 8\right\}$ $\left\{14,12,13,8,10\right\}$ $\left\{14,13,8,12,10\right\}$ $\left\{14,13,12,8,10\right\}$
answered
in
DS
Mar 23, 2019
8.6k
views
gatecse-2009
data-structures
binary-heap
normal
0
votes
168
GATE CSE 2009 | Question: 59
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? $\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,13,16,10,8,12\right\}$ $\left\{25,14,16,13,10,8,12\right\}$ $\left\{25,14,12,13,10,8,16\right\}$
answered
in
DS
Mar 23, 2019
13.6k
views
gatecse-2009
data-structures
heap
easy
0
votes
169
GATE CSE 2009 | Question: 38
Consider the following graph: Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm? $\text{(b, e) (e, f) (a, c) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (a, c) (f, g) (b, c) (c, d)}$ $\text{(b, e) (a, c) (e, f) (b, c) (f, g) (c, d)}$ $\text{(b, e) (e, f) (b, c) (a, c) (f, g) (c, d)}$
answered
in
Algorithms
Mar 23, 2019
8.9k
views
gatecse-2009
algorithms
spanning-tree
normal
2
votes
170
Multiplexer
Consider the given function F(A,B,C,D) = Σm(2,3,5,6,8,9,11,14) then what is the value connected at input I1 in the figure shown below if the select lines are connected to B & D respectively?
answered
in
Digital Logic
Mar 23, 2019
1.1k
views
multiplexer
digital-logic
2
votes
171
Made Easy Workbook
Minimum Number of 2 input NAND gates required to implement the logic function F=A+B+C+D are________________?
answered
in
Digital Logic
Mar 23, 2019
2.0k
views
0
votes
172
Computer networking
What is the use of MAC broadcast address in ARP?
answered
in
Computer Networks
Mar 23, 2019
370
views
1
vote
173
GATE CSE 2000 | Question: 2.5
A relation $R$ is defined on the set of integers as $xRy$ iff $(x + y)$ is even. Which of the following statements is true? $R$ is not an equivalence relation $R$ is an equivalence relation having $1$ equivalence class $R$ is an equivalence relation having $2$ equivalence classes $R$ is an equivalence relation having $3$ equivalence classes
answered
in
Set Theory & Algebra
Mar 23, 2019
14.0k
views
gatecse-2000
set-theory&algebra
relations
normal
1
vote
174
GATE CSE 2000 | Question: 2.10
The simultaneous equations on the Boolean variables $x, y, z$ and $w$, $x + y + z = 1 $ $xy = 0$ $xz + w = 1$ $xy + \bar{z}\bar{w} = 0$ have the following solution for $x, y, z$ and $w,$ respectively: $0 \ 1 \ 0 \ 0$ $1 \ 1 \ 0 \ 1$ $1 \ 0 \ 1 \ 1$ $1 \ 0 \ 0 \ 0$
answered
in
Digital Logic
Mar 23, 2019
7.2k
views
gatecse-2000
digital-logic
boolean-algebra
easy
5
votes
175
GATE CSE 2000 | Question: 2.9
Consider the following decision problems: $(P1):$ Does a given finite state machine accept a given string? $(P2):$ Does a given context free grammar generate an infinite number of strings? Which of the following statements is true? Both$(P1)$ and $(P2)$ are decidable Neither $(P1)$ nor $(P2)$ is decidable Only $(P1)$ is decidable Only $(P2)$ is decidable
answered
in
Theory of Computation
Mar 23, 2019
9.0k
views
gatecse-2000
theory-of-computation
decidability
normal
4
votes
176
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
answered
in
Algorithms
Mar 23, 2019
22.8k
views
gatecse-2000
algorithms
asymptotic-notation
normal
1
vote
177
GATE CSE 2000 | Question: 2.22
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds
answered
in
Operating System
Mar 23, 2019
18.1k
views
gatecse-2000
operating-system
easy
virtual-memory
0
votes
178
GATE CSE 2000 | Question: 2.24
Given the following relation instance. ... $YZ \rightarrow X$ and $Y \rightarrow Z$ $YZ \rightarrow X$ and $X \rightarrow Z$ $XZ \rightarrow Y$ and $Y \rightarrow X$
answered
in
Databases
Mar 23, 2019
14.5k
views
gatecse-2000
databases
database-normalization
easy
3
votes
179
GATE CSE 2000 | Question: 2.21, ISRO2015-24
Given the following expression grammar: $\begin{align} E &\to E * F \mid F + E \mid F \\[1em] F &\to F - F \mid id \end{align}$ Which of the following is true? $*$ has higher precedence than $+$ $-$ has higher precedence than $*$ $+$ and $-$ have same precedence $+$ has higher precedence than $*$
answered
in
Compiler Design
Mar 23, 2019
10.7k
views
gatecse-2000
operator-precedence
normal
compiler-design
isro2015
4
votes
180
GATE CSE 2000 | Question: 12
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched till the branch instruction ... 50% of the conditional branch instructions are such that the branch is taken, calculate the average instruction execution time.
answered
in
CO and Architecture
Mar 23, 2019
17.4k
views
gatecse-2000
co-and-architecture
pipelining
normal
descriptive
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
33
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...