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
Questions by Mizuki
0
votes
0
answers
1
Function return type
Are these return types valid for a function in C? Would any of these result in error, or simply will be ignored? 1 const void f() 2 extern void f() 3 static void f()
Are these return types valid for a function in C? Would any of these result in error, or simply will be ignored?1 const void f()2 extern void f()3 static void f()
315
views
asked
Dec 9, 2018
Programming and DS
programming-in-c
functions
+
–
0
votes
0
answers
2
Modulo Operator
What is −6 mod 18? Please elaborate.
What is −6 mod 18?Please elaborate.
276
views
asked
Nov 20, 2018
0
votes
1
answer
3
Finite Automata
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA? Please elaborate.
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.
1.1k
views
asked
Nov 14, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
0
votes
1
answer
4
Decidability
How to distinguish between a problem which is (undecidable) and which is (undecidable but partially decidable); or rather for a given problem how to say in which category it falls?
How to distinguish between a problem which is (undecidable) and which is (undecidable but partially decidable); or rather for a given problem how to say in which category...
470
views
asked
Nov 14, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
1
votes
2
answers
5
Decidability
Decidable or Undecidable? Given a Turing machine M, a string s and an integer k, M accepts s within k steps. Please elaborate.
Decidable or Undecidable? Given a Turing machine M, a string s and an integer k, M accepts s within k steps.Please elaborate.
527
views
asked
Nov 14, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
6
Gate 2016 - 2 - 8
In the first one, why is L3 compliment recursively enumerable? https://gateoverflow.in/39574#39584
In the first one, why is L3 compliment recursively enumerable?https://gateoverflow.in/39574#39584
217
views
asked
Nov 12, 2018
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
2
votes
5
answers
7
Lexical Analysis
What it the number of tokens in the following line? printf("%d numbers.", &x);
What it the number of tokens in the following line?printf("%d numbers.", &x);
1.8k
views
asked
Nov 11, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
votes
2
answers
8
Permutations, TIFR2011-B-30
What does it mean when they say "An array A[1...n] consists of a permutation of numbers 1....n.".? Also I'd be grateful if you give some example.
What does it mean when they say "An array A[1...n] consists of a permutation of numbers 1....n.".?Also I'd be grateful if you give some example.
664
views
asked
Nov 1, 2018
Quantitative Aptitude
data-structures
combinatory
array
usertifr2011
usermod
general-aptitude
+
–
0
votes
0
answers
9
EX NOR Gate
$A\odot(BC) = (A\odot B)(A\odot C)$ Does it hold? Please solve.
$A\odot(BC) = (A\odot B)(A\odot C)$Does it hold? Please solve.
1.2k
views
asked
Sep 27, 2018
Digital Logic
digital-logic
digital-circuits
+
–
0
votes
1
answer
10
Parsing
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
468
views
asked
Aug 31, 2018
Compiler Design
compiler-design
parsing
context-free-language
pushdown-automata
theory-of-computation
+
–
0
votes
2
answers
11
Linked list
What are sequential access structures? Are arrays or linked list the sequential access structures?
What are sequential access structures? Are arrays or linked list the sequential access structures?
3.3k
views
asked
Aug 30, 2018
Programming in C
data-structures
+
–
1
votes
1
answer
12
File handling in C
I'm trying to use the fseek() and ftell() function to find the length of the file 'test.txt' which is present in the same directory as the file 'file.c'. file.c #include <stdio.h> int main() { FILE *fp; ... run it, I'm getting the 'Segmentation fault (core dumped)' error abd the execution terminates. What's going wrong in here?
I'm trying to use the fseek() and ftell() function to find the length of the file 'test.txt' which is present in the same directory as the file 'file.c'.file.c#include <s...
1.2k
views
asked
Aug 30, 2018
Programming in C
programming-in-c
file-system
programming
+
–
4
votes
0
answers
13
MadeEasy Test Series: Compiler Design - Parsing
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. The number of entries have multiple productions in LL(1) table are ________.
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production.The number of entries have multiple productions in LL(1) ...
2.6k
views
asked
Aug 19, 2018
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register