Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User gatecrack
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
commented
in
Programming in C
Aug 19, 2019
9.0k
views
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.
commented
in
Programming in C
Aug 7, 2019
4.3k
views
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
answered
in
Theory of Computation
Mar 17, 2019
33.5k
views
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.
answered
in
Theory of Computation
Mar 17, 2019
17.5k
views
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^*)^*$
answered
in
Theory of Computation
Feb 24, 2019
8.8k
views
gateit-2004
theory-of-computation
regular-expression
normal
0
answers
6
Relational Algebra from Aku paper previous year
commented
in
Databases
Dec 10, 2018
840
views
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???
asked
in
Databases
Dec 10, 2018
606
views
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
asked
in
Databases
Dec 10, 2018
732
views
databases
transaction-and-concurrency
conflict-serializable
0
answers
9
Relational Algebra dbms
commented
in
Databases
Dec 10, 2018
504
views
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??
asked
in
Operating System
Sep 9, 2018
746
views
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
asked
in
Databases
Sep 5, 2018
385
views
transaction-and-concurrency
databases
2phaselocking
2pl
5
answers
12
transaction cascadeless
is this is cascadeless? r1(X),w2(X),w1(X), abort2, commit1
commented
in
Databases
Sep 5, 2018
1.5k
views
databases
transaction-and-concurrency
0
answers
13
no. of schedule doubt
plz someone solve it
asked
in
Databases
Sep 3, 2018
283
views
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 __________ .
commented
in
Databases
Sep 3, 2018
7.4k
views
databases
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...