Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
jaiganeshcse94
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by jaiganeshcse94
0
votes
1
decidability
a) I only b) II only c) I and II only d) all these are true
a) I onlyb) II onlyc) I and II onlyd) all these are true
333
views
answered
Sep 17, 2017
0
votes
2
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
4.9k
views
answered
Apr 12, 2017
Theory of Computation
finite-automata
+
–
0
votes
3
Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the Code
Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the CodeProblemGiven an unordered array arr[] which contains n di...
521
views
answered
Dec 26, 2016
Programming in C
programming-in-c
algorithms
functions
time-complexity
+
–
0
votes
4
Minimized DFA no of states || Peter Linz
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$ Minimal DFA for the above language ?
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$Minimal DFA for the above language ?
3.0k
views
answered
Nov 21, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
theory-of-computation-
+
–
0
votes
5
minimised DFA
453
views
answered
Nov 21, 2016
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
0
votes
6
computer science
A page fault?
A page fault?
464
views
answered
Nov 8, 2016
0
votes
7
c_programming
What will be the output of the program? #include<stdio.h> int main() { char c=48; int i, mask=01; for(i=1; i<=5; i++) { printf("%c", c|mask); mask = mask<<1; } return 0; } A. 12400 B. 12480 C. 12500 D. 12556
What will be the output of the program?#include<stdio.h>int main(){ char c=48; int i, mask=01; for(i=1; i<=5; i++) { printf("%c", c|mask); mask ...
1.8k
views
answered
Sep 8, 2016
Programming in C
bitwise
+
–
2
votes
8
Select the difference between Java and C++
Spot the features that are present in C++ not in Java: I. New operator II. Delete opeartor III. Objects stored in stack memory. IV . Objects stored in Heap memory a. III only b. II and III only c. III only d. All features are present in C++ and Java
Spot the features that are present in C++ not in Java:I. New operator II. Delete opeartor III. Objects stored in stack memory. IV . Objects stored in Heap memorya. ...
359
views
answered
Sep 2, 2016
Programming in C
cpp
java
programming
+
–
0
votes
9
Prog \ What is the output of the following program? tricky question
#include<stdio.h> int main() { int a = 5; switch(a) { default: a = 4; case 6: a--; case 5: a = a+1; case 1: a = a-1; } printf("%d \n",a); return 0; } (a) 5 (b) 4 (c) 3 (d) None of these
#include<stdio.h int main() { int a = 5; switch(a) { default: a = 4; case 6: a ; case 5: a = a+1; case 1: a = a-1; } printf("%d \n",a); return 0; }(a) 5 (b) 4 (c) 3 (d) N...
8.8k
views
answered
Aug 31, 2016
Programming in C
output
programming-in-c
interview
+
–
1
votes
10
ISRO2015-45
To add a background color for all <h1> elements, which of the following HTML syntax is used h1 { background-color :#FFFFFF} { background-color :#FFFFFF} . h1 h1 { background-color :#FFFFFF} . h1(all) h1. all{bgcolor= #FFFFFF}
To add a background color for all <h1 elements, which of the following HTML syntax is usedh1 { background-color :#FFFFFF}{ background-color :#FFFFFF} . h1h1 { background-...
3.2k
views
answered
Aug 27, 2016
Web Technologies
isro2015
html
non-gate
+
–
0
votes
11
GATE IT 2005 | Question: 30
A HTML form is to be designed to enable purchase of office stationery. Required items are to be selected (checked). Credit card details are to be entered and then the submit button is to be pressed. Which one of the following options would be appropriate ... in a way that is transparent to the form design. Only GET Only POST Either of GET or POST Neither GET nor POST
A HTML form is to be designed to enable purchase of office stationery. Required items are to be selected (checked). Credit card details are to be entered and then the sub...
3.5k
views
answered
Aug 27, 2016
Web Technologies
gateit-2005
web-technologies
html
normal
+
–
0
votes
12
self doubt
can we further minimize it.
can we further minimize it.
637
views
answered
Aug 24, 2016
Theory of Computation
minimal-state-automata
+
–
2
votes
13
CFL closure property
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is (a) a DCFL (b) a recursive set but not CFL (c) a CFL but not DCFL (d) not a CFL
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is(a) a DCFL(b) a recursive set but not CFL(c) a CFL but not DCFL(d) not a CFL
1.2k
views
answered
Aug 22, 2016
Theory of Computation
theory-of-computation
closure-property
context-free-language
+
–
1
votes
14
gate ,toc
a*b*b (a+ (ab)*)* b* shortest string generated by this RE?
a*b*b (a+ (ab)*)* b*shortest string generated by this RE?
1.2k
views
answered
Aug 22, 2016
Theory of Computation
theory-of-computation
regular
regular-expression
+
–
0
votes
15
DFA
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
765
views
answered
Aug 18, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
–1
votes
16
GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of ...
35.4k
views
answered
Aug 13, 2016
Computer Networks
gatecse-2007
computer-networks
subnetting
easy
isro2016
+
–
4
votes
17
GATE CSE 2001 | Question: 18
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$ Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid ∊$ Construct all possible parse trees for the string abab. Is the grammar ambiguous?
Remove left-recursion from the following grammar: $S \rightarrow Sa \mid Sb \mid a \mid b$Consider the following grammar: $S \rightarrow aSbS\mid bSaS \mid �...
3.6k
views
answered
Aug 10, 2016
Compiler Design
gatecse-2001
compiler-design
grammar
descriptive
+
–
1
votes
18
ACE-BOOKLET-VOL1-CHAPTER1 Question #15 page #54
Let $\Sigma$ be an alphabet define $L_{\Sigma}$ to be the collection of all infinite languages over $\Sigma$. Then choose the correct from the following: $L_{\Sigma}$ is closed under complementation $L_{\Sigma}$ is closed under concatenation $L_{\Sigma}$ is closed under Kleen closure None of the above answer given as B what is that infinite language?
Let $\Sigma$ be an alphabet define $L_{\Sigma}$ to be the collection of all infinite languages over $\Sigma$. Then choose the correct from the following:$L_{\Sigma}$ is c...
504
views
answered
Aug 2, 2016
Theory of Computation
ace-booklet
theory-of-computation
+
–
5
votes
19
Theory Of Computation, Chapter 2, Exercises 2 (e) Minimal DFA
Construct a minimal DFA for the given language. How to find the union of two DFA's ?
Construct a minimal DFA for the given language.How to find the union of two DFA's ?
3.6k
views
answered
Aug 2, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
20
UGC NET CSE | December 2015 | Part 3 | Question: 73
Consider Language $A$ defined over the alphabet $\Sigma=\{0,1\}$ as $A=\{0^{\lfloor n/2 \rfloor} 1^n :n>=0 \}$ The expression $\lfloor n/2 \rfloor$ means the floor of $n/2$, or what you get by rounding $n/2$ down to the nearest integer. Which of the following is not an example of a string in $A$? $011$ $0111$ $0011$ $001111$
Consider Language $A$ defined over the alphabet $\Sigma=\{0,1\}$ as $A=\{0^{\lfloor n/2 \rfloor} 1^n :n>=0 \}$ The expression $\lfloor n/2 \rfloor$ means the floor of $n/...
2.6k
views
answered
Aug 2, 2016
Theory of Computation
ugcnetcse-dec2015-paper3
theory-of-computation
+
–
1
votes
21
UGC NET CSE | Junet 2015 | Part 3 | Question: 19
Minimal deterministic finite automaton for the language $L=\{0^n \mid n \geq 0, n \neq 4 \}$ will have: 1 final state among 5 states 4 final states among 5 states 1 final state among 6 states 5 final state among 6 states
Minimal deterministic finite automaton for the language $L=\{0^n \mid n \geq 0, n \neq 4 \}$ will have:1 final state among 5 states4 final states among 5 states1 final st...
6.0k
views
answered
Aug 1, 2016
Theory of Computation
ugcnetcse-june2015-paper3
theory-of-computation
finite-automata
+
–
0
votes
22
Dfa identify the language accepted by the following dfa
Accepting language is1- [(1*0)*01*]*0* Or 2- (1*0)*0]*0* any of these is correct??
Accepting language is1- [(1*0)*01*]*0* Or 2- (1*0)*0]*0* any of these is correct??
1.1k
views
answered
Aug 1, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
23
TOC John C Martin Finite Automata
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
1.1k
views
answered
Jul 31, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
–1
votes
24
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
4.9k
views
answered
Jul 29, 2016
Theory of Computation
finite-automata
+
–
–1
votes
25
what is output
int main(){ int i=5,j; j=++i + ++i + ++i; printf("%d %d",i,j); return 0; } https://gateoverflow.in/?qa=blob&qa_blobid=15560219953750733487 please explain how j = 22 comes in output??
int main(){ int i=5,j; j=++i + ++i + ++i; printf("%d %d",i,j); return 0; } https://gateoverflow.in/?qa=blob&qa_blobid=15560219953750733487please explain how j = 22 comes ...
4.0k
views
answered
Jul 21, 2016
Programming in C
programming-in-c
output
interview
+
–
0
votes
26
Regular Language
A Language is said to be regular iff a. There exists a Right Linear Regular Grammar for L b. There exists a Left Linear Regular Grammar for L c. There exists a NFA with a single final state d. There exists a DFA with a single final state e. There exists a NFA without ԑ - move.
A Language is said to be regular iffa. There exists a Right Linear Regular Grammar for Lb. There exists a Left Linear Regular Grammar for Lc. There exists a NFA with a si...
4.1k
views
answered
Jul 21, 2016
0
votes
27
The square of the binary number 1001 in hexadecimal is
The square of the binary number 1001 in hexadecimal is a. 81 b. 51 c. 121 d. A1
The square of the binary number 1001 in hexadecimal is a. 81 b. 51 c. 121 d. A1
2.7k
views
answered
Jul 18, 2016
CO and Architecture
number-representation
+
–
1
votes
28
Question on Ford Fulkerson algorithm
1.3k
views
answered
Jul 18, 2016
0
votes
29
A device which converts BCD to Seven Segment is called
A device which converts BCD to Seven Segment is called (A) Encoder (B) Decoder (C) Multiplexer (D) Demultiplexer
A device which converts BCD to Seven Segment is called(A) Encoder(B) Decoder(C) Multiplexer(D) Demultiplexer
4.0k
views
answered
Jul 18, 2016
Digital Logic
digital-logic
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register