Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
himanshu19
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by himanshu19
1
answer
1
GATE CSE 2021 Set 2 | Question: 21
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. ... that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}...
9.0k
views
commented
Feb 18, 2021
Databases
gatecse-2021-set2
numerical-answers
databases
indexing
1-mark
+
–
4
answers
2
GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...
10.1k
views
commented
Feb 18, 2021
Operating System
gatecse-2021-set2
multiple-selects
operating-system
threads
2-marks
+
–
1
answer
3
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
Consider the following two statements about regular languages:$S_1$: Every infinite regular language contains an undecidable language as a subset.$S_2$:...
11.8k
views
commented
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
+
–
3
answers
4
GATE CSE 2021 Set 2 | Question: 20
Consider a computer system with $\text{DMA}$ support. The $\text{DMA}$ module is transferring one $8$-bit character in one $\text{CPU}$ cycle from a device to memory through cycle stealing at regular intervals. Consider a $\text{2 MHz}$ ... $\text{DMA}$, the data transfer rate of the device is __________ bits per second.
Consider a computer system with $\text{DMA}$ support. The $\text{DMA}$ module is transferring one $8$-bit character in one $\text{CPU}$ cycle from a device to memory thro...
11.1k
views
commented
Feb 18, 2021
CO and Architecture
gatecse-2021-set2
numerical-answers
co-and-architecture
dma
1-mark
+
–
2
answers
5
GATE CSE 2021 Set 2 | Question: 27
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements. $S_1$: Read misses in a write through $L1$ cache do not result in writebacks of dirty lines to the $L2$ $S_2$: Write ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements.$S_1$: Read misses i...
8.0k
views
commented
Feb 18, 2021
CO and Architecture
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
+
–
3
answers
6
GATE CSE 2021 Set 2 | Question: 39
For constants $a \geq 1$ and $b>1$, consider the following recurrence defined on the non-negative integers: $T(n) = a \cdot T \left(\dfrac{n}{b} \right) + f(n)$ Which one of the following options is correct about the recurrence $T(n)$? If $f(n)$ is $n \log_2(n)$, ... $f(n)$ is $\Theta(n^{\log_b(a)})$, then $T(n)$ is $\Theta(n^{\log_b(a)})$
For constants $a \geq 1$ and $b>1$, consider the following recurrence defined on the non-negative integers:$$T(n) = a \cdot T \left(\dfrac{n}{b} \right) + f(n)$$ Which on...
8.0k
views
commented
Feb 18, 2021
Algorithms
gatecse-2021-set2
algorithms
recurrence-relation
2-marks
+
–
4
answers
7
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.6k
views
answered
Feb 18, 2021
Compiler Design
gatecse-2021-set2
multiple-selects
compiler-design
intermediate-code
1-mark
+
–
7
answers
8
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...
16.9k
views
answered
Feb 18, 2021
Compiler Design
gatecse-2021-set2
compilation-phases
compiler-design
1-mark
+
–
4
answers
9
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.7k
views
answered
Feb 18, 2021
DS
gatecse-2021-set2
data-structures
binary-heap
time-complexity
1-mark
+
–
6
answers
10
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.6k
views
answered
Feb 18, 2021
Algorithms
gatecse-2021-set2
algorithms
graph-algorithm
minimum-spanning-tree
1-mark
+
–
7
answers
11
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.3k
views
answered
Feb 3, 2020
Theory of Computation
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
6
answers
12
#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.2k
views
answered
Nov 12, 2019
Databases
databases
er-diagram
er-to-relational
relational
+
–
2
answers
13
IPv4 (Wrap around time)
Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each packet in the network is identified by unique identification number of 48 bits, then the host wrap around time for generating packets will be ________s
Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each packet in the network is identified by unique identification numbe...
2.5k
views
commented
Nov 20, 2018
Computer Networks
ip-addressing
computer-networks
network-addressing
ip-address
madeeasy-testseries-2018
+
–
0
answers
14
Ace test series
Why the ans is 253 and not 254???????Please help???
Why the ans is 253 and not 254???????Please help???
267
views
commented
Nov 4, 2018
0
answers
15
Ace Test Series
How to solve it???? Please help
How to solve it???? Please help
162
views
asked
Nov 4, 2018
1
answer
16
Ace test series
Guys, acc to Ace ans is 51, but the same question in gate overflow have different ans.....Which one to follow??????Please help https://gateoverflow.in/57976/ugcnet-june2013-ii-18
Guys, acc to Ace ans is 51, but the same question in gate overflow have different ans.....Which one to follow??????Please help https://gateoverflow.in/57976/ugcnet-june20...
236
views
commented
Nov 4, 2018
2
answers
17
Ace test series
Guys, I am not getting C as the ans..Can someone help.
Guys, I am not getting C as the ans..Can someone help.
547
views
commented
Nov 3, 2018
21
answers
18
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...
41.7k
views
answered
Oct 21, 2018
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
1
answer
19
Aptitude
One of the best questions of aptitude...Lets see who does it first..... 1 1 1 2 1 1 2 1 1 1 1 1 2 2 1 What will be the next term in the series?????
One of the best questions of aptitude...Lets see who does it first..... 1 ...
546
views
commented
Sep 9, 2018
5
answers
20
made easy
What is the output???
What is the output???
1.4k
views
commented
Sep 8, 2018
Programming in C
programming-in-c
+
–
0
answers
21
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
743
views
commented
Sep 7, 2018
Algorithms
no-of-topological-ordering
+
–
2
answers
22
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
821
views
answered
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
1
answer
23
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
1.1k
views
commented
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
1
answer
24
Topological Sort
How many Topological Orderings possible?
How many Topological Orderings possible?
496
views
commented
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
4
answers
25
Topological Sort
How many Topological Orderings possible from A to H?
How many Topological Orderings possible from A to H?
2.0k
views
commented
Sep 7, 2018
Algorithms
algorithms
topological-sort
numerical-answers
+
–
1
answer
26
Cache
531
views
commented
Sep 7, 2018
CO and Architecture
cache-memory
+
–
1
answer
27
Ace Test Series: Programming & DS - Programming In C
#include<stdio.h> int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0; } Output : 400 I ran this program and got 400 as output. But I don't understand why it is so?
#include<stdio.h>int main() { char *p; p = "%d\n"; p++; p++; printf(p-2, 400); return 0;}Output : 400I ran this program and got 400 as output. But I don...
519
views
commented
Sep 7, 2018
Programming in C
ace-test-series
programming-in-c
programming
+
–
1
answer
28
minimum number of comparisons
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
8.1k
views
commented
Sep 7, 2018
Algorithms
algorithms
normal
numerical-answers
sorting
+
–
1
answer
29
Algorithms timeComplexity
It answer is given as A but according to me answer should be C. Please help
It answer is given as A but according to me answer should be C.Please help
481
views
commented
Sep 7, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
1
answer
30
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...
568
views
answered
Sep 6, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register