Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
1
votes
0
answers
11941
made easy test series
rohit vishkarma
238
views
rohit vishkarma
asked
Jan 5, 2018
Computer Networks
computer-networks
+
–
1
votes
0
answers
11942
Testseries
What will be the output of following program? #include <stdio.h> void f1(char* str, int index) { *(str + index) &= ~32; } int main() { char arr[] = "gatecsit"; f1(arr, 0); printf("%s", arr); return 0; }
What will be the output of following program? #include <stdio.h void f1(char* str, int index) { *(str + index) &= ~32; } int main() { char arr[] = "gatecsit"; f1(arr, 0);...
trupti_n
283
views
trupti_n
asked
Jan 5, 2018
Programming in C
programming-in-c
+
–
1
votes
0
answers
11943
prev gate
construct a DPDA for this language is this a DCFL? a^i b^j such that i!=2j+1 my attempt: is for the first a I dont perform any action and then I start pushing 1 a for every 2a's but this is failing for i=2j+2 because it will have the same ... which we don't perform anything + j a's pushed on to the stack for rest of all the cases this is working fine except this please help
construct a DPDA for this language is this a DCFL? a^i b^j such that i!=2j+1 my attempt: is for the first a I dont perform any action and then I start pu...
Venkat Sai
144
views
Venkat Sai
asked
Jan 5, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
0
answers
11944
Ace practice
Appu B
224
views
Appu B
asked
Jan 5, 2018
1
votes
0
answers
11945
IEEE 754
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is
Parshu gate
901
views
Parshu gate
asked
Jan 5, 2018
1
votes
0
answers
11946
turing machines
consider a language which contains encodings of all DFA’s together with strings that the DFA’s accept. LDFA={ 〈B,w〉 | B is a DFA that accepts input string w} Assume LDFA ≤m Lx, i.e. Problem LDFA is polynomial time reducible to problem Lx. Lx must be regular Lx must be undecidable Lx must be decidable
consider a language which contains encodings of all DFA’s together with strings that the DFA’s accept.LDFA={ 〈B,w〉 | B is a DFA that accepts input string w}Assume...
Parshu gate
486
views
Parshu gate
asked
Jan 5, 2018
2
votes
0
answers
11947
Recursion Stack
My doubt is, In the stack, we will push [main()->PTN(3)->PTN(2)->PTN(1)->PTN(0)] PTN = printTwoNumbers function call Then according to answer PTN(0) won't pushed into stack, but at least to check if and return we should push it. What's the correct. My answer is 5, given is 4
My doubt is, In the stack, we will push [main()->PTN(3)->PTN(2)->PTN(1)->PTN(0)] PTN = printTwoNumbers function callThen according to answer PTN(0) won't pushed int...
Ashwin Kulkarni
710
views
Ashwin Kulkarni
asked
Jan 5, 2018
DS
data-structures
stack
recursion
+
–
3
votes
0
answers
11948
Sum of series
Lakshman Bhaiya
293
views
Lakshman Bhaiya
asked
Jan 5, 2018
Quantitative Aptitude
series-evaluvation
+
–
1
votes
0
answers
11949
acetest series
here what i thinking is every type of hazard is present so what to choose or any other view is there for question
here what i thinking is every type of hazard is present so what to choose or any other view is there for question
eyeamgj
363
views
eyeamgj
asked
Jan 5, 2018
1
votes
0
answers
11950
File Structure
Whether to count disk head movement during JUMP In CSCAN and CLOOK or not. I found 2 pdf's both are saying different things? http://www.cpp.edu/~kanluezhang/cs537/presentation/CS537-DiskScheduling-Rev.051915.pdf http://www4.comp.polyu.edu.hk/~csajaykr/myhome/teaching/eel358/ds.pdf
Whether to count disk head movement during JUMP In CSCAN and CLOOK or not. I found 2 pdf's both are saying different things?http://www.cpp.edu/~kanluezhang/cs537/presenta...
abhijeet pandey
309
views
abhijeet pandey
asked
Jan 5, 2018
Operating System
file-system
operating-system
c-look
c-scan
+
–
1
votes
0
answers
11951
https://web.stanford.edu/class/archive/cs/cs143/cs143.1128/handouts/170%20Problem%20Set%202.pdf
Consider the following grammar, which describes lists of nouns: S → noun | noun and noun | M, noun, and noun M → M, noun | noun For example, this grammar can generate (among others) the strings ... productions for S contribute to the conflict (C) No production for M causes a conflict (D) None of these
Consider the following grammar, which describes lists of nouns: S → noun | noun and noun | M, noun, and noun M → M, noun | nounFor example, this grammar can g...
asharani97
324
views
asharani97
asked
Jan 5, 2018
1
votes
0
answers
11952
ace test
ADITYA CHAURASIYA 5
193
views
ADITYA CHAURASIYA 5
asked
Jan 5, 2018
1
votes
0
answers
11953
Addressing Sectors
I am getting $ \Large1374845$ Is it right? Please explain your logic if you got other from this !
I am getting $ \Large1374845$ Is it right? Please explain your logic if you got other from this !
saxena0612
365
views
saxena0612
asked
Jan 5, 2018
CO and Architecture
co-and-architecture
+
–
3
votes
0
answers
11954
Number system
I thnk the answer should be (1000)5
I thnk the answer should be (1000)5
Pawan Kumar 2
390
views
Pawan Kumar 2
asked
Jan 5, 2018
Digital Logic
digital-logic
number-representation
+
–
1
votes
0
answers
11955
functions
https://gateoverflow.in/27344/tifr2014-b-17 this says option C ( parity function is not possible ) but why ? if we take OR of the inputs it will give 0 for even no of 1's and 1 for odd no.of 1's right ? any counter ?
https://gateoverflow.in/27344/tifr2014-b-17this says option C ( parity function is not possible )but why ?if we take OR of the inputs it will give 0 for even no of 1's an...
A_i_$_h
461
views
A_i_$_h
asked
Jan 5, 2018
2
votes
0
answers
11956
madeeasy test series
A link has a transmission speed of 500 × 106 bpsec. Assume acknowledgment has negligible transmission delay, and its one way propagation delay is 2 sec. Also assumes that the processing delays at nodes are also negligible. If data packet size is 107 bits, then the efficiency of Go-Back-7 protocol is _______ (in %) Ans is given 63.18 . Please explain
A link has a transmission speed of 500 × 106 bpsec. Assume acknowledgment has negligible transmission delay, and its one way propagation delay is 2 sec. Also assumes tha...
garg div
454
views
garg div
asked
Jan 5, 2018
1
votes
0
answers
11957
Test Series
Detailed Solution please..!
Detailed Solution please..!
Anmol_Binani
380
views
Anmol_Binani
asked
Jan 5, 2018
Digital Logic
digital-logic
+
–
1
votes
0
answers
11958
Test Series
How to solve this.. help please.!
How to solve this.. help please.!
Anmol_Binani
114
views
Anmol_Binani
asked
Jan 5, 2018
CO and Architecture
co-and-architecture
+
–
1
votes
0
answers
11959
madeeast test series
Consider the following cache A and B. Let the average access times in cache A and B is tA and tB respectively. Find the value (in ns) of tA + tB. here questio is solved i solution with hierarchical technnique ..............but how to know simultaneous or hierachy becz nothig is metion i question ad as i studied whe othing is metioned we use simultaeous tech.pleae verify
Consider the following cache A and B. Let the average access times in cache A and B is tA and tB respectively. Find the value (in ns) of tA + tB.here questio is solved ...
eyeamgj
156
views
eyeamgj
asked
Jan 5, 2018
1
votes
0
answers
11960
Grammar
Representing the syntax by a grammar is advantageous because (a)it is accurate (c) it is concise (b) automation becomes easy (d) all of the above
Representing the syntax by a grammar is advantageous because (a)it is accurate (c) it is concise(b) automation becomes easy (d) all of ...
asharani97
3.3k
views
asharani97
asked
Jan 5, 2018
1
votes
0
answers
11961
TOC Regular Language
Which of the following languages over the alphabet A = {0, 1} is regular? 1. {w ε A* : Ǝu ε A* such that w = uu} 2. {w ε A* : w does not contain any 1’s in even positions, where the leftmost is position 1} 3. {w ε A* : w contains a 1 in every position that is a power of 2}
Which of the following languages over the alphabet A = {0, 1} is regular?1. {w ε A* : Ǝu ε A* such that w = uu}2. {w ε A* : w does not contain any 1’s in even posit...
Harish Karnam
431
views
Harish Karnam
asked
Jan 5, 2018
Theory of Computation
theory-of-computation
regular-language
+
–
1
votes
0
answers
11962
test book
Please explain?
Please explain?
shreyansh jain
118
views
shreyansh jain
asked
Jan 5, 2018
1
votes
0
answers
11963
made easy
Consider the following statements: S1 : If all state of DFA is final then language of DFA is Σ* i.e., regular. S2: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. The number of statements corrects are ________. how second statement is true . an bn am bm where n,m>=0; is it accepted by dpda ?? i think it also not satisfy prefix property.
Consider the following statements:S1 : If all state of DFA is final then language of DFA is Σ* i.e., regular.S2: Set of languages accepted by DPDA by empty stack contain...
ADITYA CHAURASIYA 5
119
views
ADITYA CHAURASIYA 5
asked
Jan 5, 2018
1
votes
0
answers
11964
Probabillity
4 friends (Alex, Blake, Chris and Dusty) each choose a random number between 1 and 5. What is the chance that any of them chose the same number? Ans:101/125
4 friends (Alex, Blake, Chris and Dusty) each choose a random number between 1 and 5. What is the chance that any of them chose the same number?Ans:101/125
Rohit Gupta 8
831
views
Rohit Gupta 8
asked
Jan 5, 2018
Probability
probability
discrete-mathematics
+
–
2
votes
0
answers
11965
nptel course
why are WAR AND WAW hazards not possible in mips architecture please see this video at 17:58 youtube.com/watch?v=9mpOG9YtSLc&t=1242s
why are WAR AND WAW hazards not possible in mips architecture please see this video at 17:58 youtube.com/watch?v=9mpOG9YtSLc&t=1242s
Venkat Sai
272
views
Venkat Sai
asked
Jan 5, 2018
CO and Architecture
nptel
computer
co-and-architecture
+
–
1
votes
0
answers
11966
E-R Diagram
Consider the following ER diagram. The minimum number of RDBMS tables are required for the above drawn ER diagram ________ which satisfies 3NF.
Consider the following ER diagram.The minimum number of RDBMS tables are required for the above drawn ER diagram ________ which satisfies 3NF.
Aditya Bahuguna
384
views
Aditya Bahuguna
asked
Jan 5, 2018
1
votes
0
answers
11967
question
suppose i converted regular expression to nfa with empty moves (lets call ε NFA = Q) , then i converted ε - nfa(Q) to nfa without ε moves (more than one possible here ) LET i got 4 different nfa without empty moves let call them as : (q1,q2,q3,q4) . ... my question Will i get same dfa corresponding to 4 different nfa when we convert nfa to dfa will i be sure that dfa is minimal always ??
suppose i converted regular expression to nfa with empty moves (lets call ε NFA = Q) , then i converted ε - nfa(Q) to nfa without ε moves (more than one possible...
sumit goyal 1
109
views
sumit goyal 1
asked
Jan 5, 2018
1
votes
0
answers
11968
E-R Diagram
Consider the following ER diagram: The minimum number of tables needed to represent ER-diagram are __________ such that the relational database satisfies 1NF.
Consider the following ER diagram:The minimum number of tables needed to represent ER-diagram are __________ such that the relational database satisfies 1NF.
Aditya Bahuguna
506
views
Aditya Bahuguna
asked
Jan 5, 2018
1
votes
0
answers
11969
TestBook
According to me, The dependencies are Pincode -> State,City Street, City, State -> Pincode So the candidate keys are 1. empcode, name, street, Pincode 2. empcode, name, street, City, State. So, here every attribute is prime attribute. So, as per me, the answer should be 3NF and hence also in 2NF and 1 NF. Am I right?
According to me,The dependencies arePincode - State,City Street, City, State - PincodeSo the candidate keys are1. empcode, name, street, Pincode2. empcode, name, street,...
Ashok
211
views
Ashok
asked
Jan 4, 2018
3
votes
0
answers
11970
IEEE 754 Single Precision
Question 1 (a) Convert the positive decimal number 17.45 to IEEE 754 single precision representation. Show all of your working out. [15 marks] (b) In IEEE 754 single precision, 1.25 is represented as: 0 01111111 01000000000000000000000 In IEEE 754 single ... representation of 1.26 than 1.25. [10 marks] (c) Why is the exponent biased in IEEE representation? [5 marks]
Question 1 (a) Convert the positive decimal number 17.45 to IEEE 754 single precision representation. Show all of your working out. [15 marks](b) In IEEE 754 single preci...
Theo
1.2k
views
Theo
asked
Jan 4, 2018
GATE
ieee-representation
floating-point-representation
co-and-architecture
+
–
Page:
« prev
1
...
394
395
396
397
398
399
400
401
402
403
404
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register