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 nehab.sairam
2
answers
1
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s.What will be the time complexity???????
3.3k
views
asked
Jul 18, 2015
Algorithms
algorithms
sorting
time-complexity
+
–
2
answers
2
what is the use of reducing a problem for which no polynomial time algorithm exist into some another problem ?
If I have a problem A for which no polynomial time algo exists then what do we achieve by reducing it to another problemB and then proving by contradiction that if we cou...
708
views
answered
Jul 18, 2015
Algorithms
algorithms
time-complexity
+
–
3
answers
3
why is merge sort better if we try to do sorting on linked lists and also insertion sort and why not any other algo like quick sort or selection sort ?
If we talk about that since since we cant access any random element in a linked list for that reason quick sort cant be used for linked lists ,then in merge sort also we ...
991
views
answered
Jul 17, 2015
Algorithms
sorting
+
–
7
answers
4
GATE CSE 2015 Set 1 | Question: 55
The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is__________________.
The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is_...
29.3k
views
commented
May 16, 2015
Compiler Design
gatecse-2015-set1
compiler-design
intermediate-code
normal
numerical-answers
static-single-assignment
+
–
1
answer
5
Identify the grammar represented by the following production rules
$S \rightarrow C C \\ C \rightarrow c C | d$
$S \rightarrow C C \\ C \rightarrow c C | d$
1.1k
views
commented
May 16, 2015
Compiler Design
theory-of-computation
grammar
+
–
1
answer
6
GATE CSE 2015 Set 2 | Question: 14
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ ... an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of nod...
13.3k
views
commented
May 16, 2015
Compiler Design
gatecse-2015-set2
compiler-design
easy
abstract-syntax-tree
+
–
5
answers
7
GATE CSE 2015 Set 3 | Question: 35
Consider the equation $(43)_x = (y3)_8$ where $x$ and $y$ are unknown. The number of possible solutions is _____
Consider the equation $(43)_x = (y3)_8$ where $x$ and $y$ are unknown. The number of possible solutions is _____
10.0k
views
commented
May 13, 2015
Digital Logic
gatecse-2015-set3
digital-logic
number-representation
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register