Register
Filter

Questions by Mayankprakash

0 votes
2 answers
21
States in DFA
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true. As per my understanding every DFA is NFA then how no of states can be more in DFA than nfa Please suggest Thanks
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true.As per my understanding every DFA is NFA then how no of states c...
1 votes
1 answer
23
Algorithms revision question
Please suggest some revision or must see questions for algorithms subject. It would be helpful for me to revise. Thanks
Please suggest some revision or must see questions for algorithms subject.It would be helpful for me to revise. Thanks
0 votes
0 answers
24
AVL TREES
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpful Thanks
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpfulThanks
0 votes
0 answers
25
Array address calculation
Please provide link or gatetoverflow link so that I can learn address calculation of 2d and 3d array. As I find it very tough to understand. Thanks
Please provide link or gatetoverflow link so that I can learn address calculation of 2d and 3d array.As I find it very tough to understand.Thanks
0 votes
1 answer
26
Analysis of algorithms of recurrence relation
I want to learn to find time complexity of the recurrence relation of an algorithm. Please suggest some good links or any gatetoverflow imp questions links to look as examples . Thanks
I want to learn to find time complexity of the recurrence relation of an algorithm.Please suggest some good links or any gatetoverflow imp questions links to look as exam...
0 votes
0 answers
27
Analysis of algorithms
When we have to use multiplication and addition while finding the time complexity of an algorithm Eg( n * logn )or (n + logn) Please explain me this concept Thanks
When we have to use multiplication and addition while finding the time complexity of an algorithmEg( n * logn )or (n + logn)Please explain me this conceptThanks
1 votes
0 answers
28
Token passing
Do we have to study Token passing access control method and Aloha for Gate 2019? Please suggest Thanks
Do we have to study Token passing access control method and Aloha for Gate 2019?Please suggest Thanks
0 votes
0 answers
30
Page replacement
Do we have to study page replacement algorithm implementation...Is it important for gate? Please suggest
Do we have to study page replacement algorithm implementation...Is it important for gate?Please suggest
1 votes
0 answers
31
Order of growth
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions? Please suggest on above point.
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions?Please suggest on above point.
1 votes
1 answer
32
Programming in c
Please suggest on below 2 points . I'm not able to understand those 2 points. Char s[100]; 1.What is difference between scanf("%s",s) and scanf("%[^\n]s",s)? 2.how below two codes are same Code 1 Getchar(); Scanf("%[^\n]s",s); Code 2 Scanf("%*[\n] %[^\n]",s); Thanks
Please suggest on below 2 points .I'm not able to understand those 2 points.Char s[100];1.What is difference between scanf("%s",s) and scanf("%[^\n]s",s)?2.how below two ...
1 votes
1 answer
33
Token
No of token? $a b c d + y{^3}+(2-5+x$ $6/2$--;$ Please suggest how to count token in this type of questions?
No of token?$a b c d + y{^3}+(2-5+x$ $6/2$$ ;$Please suggest how to count token in this type of questions?
0 votes
2 answers
34
Regular language
A^n | n>=1 In this language 'n' is unbounded so I want to understand why it comes under finite automata as language is infinite. As finite automata has finite memory. Please suggest Thanks Mayank
A^n | n>=1In this language 'n' is unbounded so I want to understand why it comes under finite automata as language is infinite.As finite automata has finite memory.Please...
2 votes
1 answer
35
Switch
case : 'AB' is it valid to write multiple characters in single quotes? And if valid does ASCII value of a& b gets added and stored as integral constant? Thanks
case : 'AB' is it valid to write multiple characters in single quotes?And if valid does ASCII value of a& b gets added and stored as integral constant?Thanks
0 votes
1 answer
36
Define keyword
Float pi = 3.14 #define pi 3.14 Why constant declaration with define is considered to be fast than above one? Thanks
Float pi = 3.14#define pi 3.14Why constant declaration with define is considered to be fast than above one?Thanks
0 votes
0 answers
37
Data type size
My doubt is very basic, I want to understand what is the use of signed and unsigned used with integer.? 2.what does size of signed int (-128 to 127) signify? 3how to big endian and little endian output problem in C.? Please suggest Thanks
My doubt is very basic, I want to understand what is the use of signed and unsigned used with integer.?2.what does size of signed int (-128 to 127) signify?3how to big en...
0 votes
1 answer
38
Finite automata
1.How to identify the reachable state in NFA or DFA.
1.How to identify the reachable state in NFA or DFA.
0 votes
1 answer
40
Gate practice
Anyone can please let me know from where to practice questions of each subject other than Go pdf and previous year paper. Thanks
Anyone can please let me know from where to practice questions of each subject other than Go pdf and previous year paper.Thanks
Page: