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
Recent activity by gatecrack
4
answers
1
GATE CSE 2003 | Question: 24
Which of the following statements is FALSE? In statically typed languages, each variable in a program has a fixed type In un-typed languages, values do not have any types In dynamically typed languages, variables have no types In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
Which of the following statements is FALSE?In statically typed languages, each variable in a program has a fixed typeIn un-typed languages, values do not have any typesIn...
9.1k
views
commented
Aug 19, 2019
Programming in C
gatecse-2003
programming
normal
type-checking
+
–
5
answers
2
GATE CSE 1989 | Question: 3-i
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s): It makes it more difficult to verify programs. It makes programs more inefficient. It makes it more difficult to modify existing programs. It results in the compiler generating longer machine code.
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s):It makes it more difficult to verify programs.It makes programs more ...
4.3k
views
commented
Aug 7, 2019
Programming in C
gate1989
normal
programming
goto
+
–
7
answers
3
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...
33.5k
views
answered
Mar 17, 2019
Theory of Computation
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
4
answers
4
GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...
17.5k
views
answered
Mar 17, 2019
Theory of Computation
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
+
–
5
answers
5
GATE IT 2004 | Question: 7
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$? $(a^* + b^* + c^*)^*$ $(a^*b^*c^*)^*$ $((ab)^* + c^*)^*$ $(a^*b^* + c^*)^*$
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$?$(a^* + b^* + c^*)^*$$(a^*b^*c^*)^*$$((ab)^* + c^*)^*$$(a^*b^* ...
8.9k
views
answered
Feb 24, 2019
Theory of Computation
gateit-2004
theory-of-computation
regular-expression
normal
+
–
0
answers
6
Relational Algebra from Aku paper previous year
841
views
commented
Dec 10, 2018
Databases
relational-algebra
databases
joins
+
–
2
answers
7
Self doubt dbms Normalisation
Is minimal set of functional dependency for a functional dependency set is always unique???
Is minimal set of functional dependency for a functional dependency set is always unique???
603
views
asked
Dec 10, 2018
Databases
databases
decomposition
lossless-join
database-normalization
+
–
2
answers
8
Transaction dbms self doubt
T1 T2 R(A) W(A) W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN
T1T2R(A) W(A)W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN
723
views
asked
Dec 10, 2018
Databases
databases
transaction-and-concurrency
conflict-serializable
+
–
0
answers
9
Relational Algebra dbms
501
views
commented
Dec 10, 2018
Databases
relational-algebra
databases
relations
relationalal
+
–
2
answers
10
os syllabus doubt
which topic should i need to learn under file system and disk scheduling for gate??
which topic should i need to learn under file system and disk scheduling for gate??
758
views
asked
Sep 9, 2018
Operating System
syllabus
operating-system
disk-scheduling
+
–
0
answers
11
transaction and concurrency control protocol
Consider th following schedule r1(A)r2(B)r3(C)w1(B)w2(C)w3(D) Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate last operation of each transaction
Consider th following scheduler1(A)r2(B)r3(C)w1(B)w2(C)w3(D)Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate...
386
views
asked
Sep 5, 2018
Databases
transaction-and-concurrency
databases
2phaselocking
2pl
+
–
5
answers
12
transaction cascadeless
is this is cascadeless? r1(X),w2(X),w1(X), abort2, commit1
is this is cascadeless?r1(X),w2(X),w1(X), abort2, commit1
1.5k
views
commented
Sep 5, 2018
Databases
databases
transaction-and-concurrency
+
–
0
answers
13
no. of schedule doubt
plz someone solve it
plz someone solve it
281
views
asked
Sep 3, 2018
Databases
databases
transaction-and-concurrency
scheduling
+
–
5
answers
14
number of schedules conflict equivalent schedule
Consider the following schedule: S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) The number of schedules conflict equivalent are __________ .
Consider the following schedule:S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B)The number of schedules conflict equivalent are __________ .
7.3k
views
commented
Sep 3, 2018
Databases
databases
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register