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
Answers by himanshu19
4
votes
1
GATE CSE 2021 Set 2 | Question: 13
In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program? Three address code Abstract Syntax Tree $\text{(AST)}$ Control Flow Graph $\text{(CFG)}$ Symbol table
In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program?Three address codeAbstract Syntax Tree $\text...
6.8k
views
answered
Feb 18, 2021
Compiler Design
gatecse-2021-set2
multiple-selects
compiler-design
intermediate-code
1-mark
+
–
18
votes
2
GATE CSE 2021 Set 2 | Question: 3
Consider the following $\text{ANSI C}$ program: int main () { Integer x; return 0; } Which one of the following phases in a seven-phase $C$ compiler will throw an error? Lexical analyzer Syntax analyzer Semantic analyzer Machine dependent optimizer
Consider the following $\text{ANSI C}$ program:int main () { Integer x; return 0; }Which one of the following phases in a seven-phase $C$ compiler will throw an error?Lex...
17.3k
views
answered
Feb 18, 2021
Compiler Design
gatecse-2021-set2
compilation-phases
compiler-design
1-mark
+
–
2
votes
3
GATE CSE 2021 Set 2 | Question: 2
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in $H$? $\Theta (1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the...
8.9k
views
answered
Feb 18, 2021
DS
gatecse-2021-set2
data-structures
binary-heap
time-complexity
1-mark
+
–
13
votes
4
GATE CSE 2021 Set 2 | Question: 1
Let $G$ be a connected undirected weighted graph. Consider the following two statements. $S_1$: There exists a minimum weight edge in $G$ which is present in every minimum spanning tree of $G$. $S_2$: If every edge in $G$ has distinct weight, then $G$ has a ... are true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false
Let $G$ be a connected undirected weighted graph. Consider the following two statements.$S_1$: There exists a minimum weight edge in $G$ which is present in every minimum...
11.9k
views
answered
Feb 18, 2021
Algorithms
gatecse-2021-set2
algorithms
graph-algorithms
minimum-spanning-tree
1-mark
+
–
3
votes
5
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.6k
views
answered
Feb 3, 2020
Theory of Computation
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
6
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
2.3k
views
answered
Nov 12, 2019
Databases
databases
er-diagram
er-to-relational
relational
+
–
0
votes
7
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
42.6k
views
answered
Oct 21, 2018
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
0
votes
8
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
860
views
answered
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
12
votes
9
Topological Sort
How many Topological Orderings possible from A to H?
How many Topological Orderings possible from A to H?
2.1k
views
answered
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
0
votes
10
ds book
Consider an array A in which upto some index I , integers are stored and after that NULL values are stored. Let the size of array be n, then the time taken to find the value of I is : 1.O(n) 2.O(n^2) 3.O(logn) 4.O(loglogn)
Consider an array A in which upto some index I , integers are stored and after that NULL values are stored. Let the size of array be n, then the time taken to find the va...
596
views
answered
Sep 6, 2018
0
votes
11
questions
Q.which give unique BST ? 1.level order and pre-order 2.level order and post-order 3.level order and in-order 4.all of these 5.none of these
Q.which give unique BST ?1.level order and pre-order2.level order and post-order3.level order and in-order4.all of these5.none of these
162
views
answered
Sep 6, 2018
0
votes
12
#self doubt
https://gateoverflow.in/8283/gate2015-1-35 how x+3 and *(x+3) printing the same output
https://gateoverflow.in/8283/gate2015-1-35how x+3 and *(x+3) printing the same output
304
views
answered
Sep 6, 2018
Programming in C
usergate2015
usermod
+
–
0
votes
13
Mathematical logic
How to solve these Question.
How to solve these Question.
1.0k
views
answered
Jun 27, 2018
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
0
votes
14
Graph Theory Question
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that is, there exists a set of persons F1, . . . , Fm such that A and F1 ... . It is known that there are k persons such that no pair among them is connected. What is the maximum number of friendships possible?
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that ...
903
views
answered
Jun 22, 2018
Graph Theory
graph-connectivity
+
–
0
votes
15
Graph Theory- vertex degree
Consider an undirected graph with n vertices, vertex 1 has degree 1, while each vertex 2,3......, n – 1 has degree 4. The degree of vertex n is unknown. Which of the following statement must be TRUE? a. Vertex n has degree 1. b. Graph is connected. c. There is a path from vertex 1 to vertex n. d. Spanning tree will include the edge connecting vertex 1 and n.
Consider an undirected graph with n vertices, vertex 1 has degree 1, while each vertex 2,3......, n – 1 has degree 4. The degree of vertex n is unknown. Which of the fo...
666
views
answered
Jun 22, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
0
votes
16
MadeEasy Test Series: Operating System - Resource Allocation
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______.
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
1.2k
views
answered
Jan 13, 2018
Operating System
made-easy-test-series
operating-system
resource-allocation
+
–
0
votes
17
Programming
Consider the following program segment int main() { char *str = "GATECS"; printf("%d", madeeasy(str)); return 0; } int madeeasy(int *p1) { int *p2 = p1; while(*++p1); return p1-p2; } The out of above program will be ________. Assume that the object of data type int occupies 2 bytes.
Consider the following program segmentint main(){char *str = "GATECS";printf("%d", madeeasy(str));return 0;}int madeeasy(int *p1){int *p2 = p1;while(*++p1);return p1-p2;}...
1.1k
views
answered
Jan 4, 2018
Programming in C
programming
programming-in-c
made-easy-test-series
pointers
output
bad-question
+
–
0
votes
18
Context Free Languages
Please Explain in detail.
Please Explain in detail.
565
views
answered
Dec 23, 2017
Theory of Computation
context-free-language
theory-of-computation
+
–
0
votes
19
combinatorics
How many ways 5 identical apples and 5 identical oranges be distributed among 5 people such that each person receives exactly 2 fruits?
How many ways 5 identical apples and 5 identical oranges be distributed among 5 people such that each person receives exactly 2 fruits?
438
views
answered
Dec 23, 2017
3
votes
20
virtual-gate
355
views
answered
Nov 29, 2017
Calculus
limits
+
–
3
votes
21
Engineering Maths: Increasing function
If $f(x)$ is an increasing function ,then $(f(x))^2$ >$f(x)$ ? True/false
If $f(x)$ is an increasing function ,then $(f(x))^2$ >$f(x)$ ? True/false
332
views
answered
Nov 29, 2017
Calculus
engineering-mathematics
linear-algebra
calculus
+
–
1
votes
22
Discrete Maths problem.
382
views
answered
Nov 29, 2017
Set Theory & Algebra
discrete-mathematics
mathematical-logic
+
–
0
votes
23
Discrete maths:- Graph theory
366
views
answered
Nov 29, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
24
Discrete maths Combinatorics
How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?
How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?
608
views
answered
Nov 29, 2017
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
25
indexing
please can someone explain dense index ,sparse index ,cluster indexing with a proper example instead of theory ?
please can someone explain dense index ,sparse index ,cluster indexing with a proper example instead of theory ?
368
views
answered
Nov 10, 2017
Databases
indexing
+
–
0
votes
26
madeeasy work book
T1: r1(A) r1(B) w1(B) T2:r2(A) r2(B) w2(B) 1)how many concurrent schedules between t1 and t2? 2) how many non serial achedule are serializable? 3) how many schedules serializable as T1-->T2 Am not getting how to find all these. please someone help me. thanku in advance
T1: r1(A) r1(B) w1(B)T2:r2(A) r2(B) w2(B)1)how many concurrent schedules between t1 and t2?2) how many non serial achedule are serializable?3) how many schedules serializ...
2.0k
views
answered
Nov 10, 2017
Databases
databases
+
–
0
votes
27
DLC :
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied (i) either A or B or both must go (ii) either C or E but both must not go (iii) either both A and C go or neither goes (iv) If D' goes, then ... combination of soldiers who can get the arrangement will be a). $ADE$ b). $BD(C + E)$ c). $AC$ d). $ABCD'E'$
Five soldiers A, B, C, D and E volunteer to perform an important military task if their following conditions are satisfied(i) either A or B or both must go(ii) either C o...
3.3k
views
answered
Oct 13, 2017
Digital Logic
digital-logic
minimal-cover
boolean-algebra
+
–
0
votes
28
MADE EASY TEST SERIES
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00 For an input sequence X = 1010, the respective output sequence will be _______.
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00For an input sequence X = 1010, the respective output sequence ...
2.3k
views
answered
Oct 11, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register