Recent activity by KartikGawande / GATE Overflow for GATE CSE

1 answer

1

GO Classes Test Series 2024 | Programming | Test 3 | Question: 29
Mark all options which are likely to create problems with memory, i.e., run time error or have a memory leak. Assume malloc is always successful, and sizes are as follows - sizeof(int *) = 8 bytes sizeof(double) = 8 bytes sizeof(char) = 1 ... 4 int *p = malloc(sizeof(char)); *p = 0; Program $1$ Program $2$ Program $3$ Program $4$

Mark all options which are likely to create problems with memory, i.e., run time error or have a memory leak. Assume malloc is always successful, and sizes are as follows...

579 views

comment edited Dec 29, 2022

1 answer

2

GO Classes Test Series 2024 | Programming | Test 3 | Question: 21
Consider the following C code where main shows the intended use of the functions relating to struct foo. struct foo { int x; int y; int * p; }; struct foo* make_foo() { struct foo *foo = malloc(sizeof( ... program has a dangling pointer Given program may result in run time error Given program will result in a compile-time error

Consider the following C code where main shows the intended use of the functions relating to struct foo.struct foo { int x; int y; int * p; }; struct foo* make_foo() { st...

555 views

commented Dec 29, 2022

1 answer

3

GO Classes Test Series 2024 | Programming | Test 2 | Question: 20
Consider the following two .c files, which both include the same .h file: When compiled, linked, and executed, the following output results: $x = 1 \; y = 2\; z = 3\; w = 4\; v = 5$ Assuming that this program compiled and linked ... Line$(6)$ - empty Line$(7)$ - empty Line$(8)$ - static Line$(9)$ - empty Line$(10)$ - static

Consider the following two .c files, which both include the same .h file:When compiled, linked, and executed, the following output results:$x = 1 \; y = 2\; z = 3\; w = 4...

431 views

comment edited Dec 25, 2022

1 answer

4

GO Classes Test Series 2024 | Discrete Mathematics | Test 2 | Question: 7
A relation $\text{R}$ on a set $\text{A}$ is said to be triangular iff $a\text{R}b$ and $c\text{R}b$ together imply $a\text{R}c,$ For all $a,b,c \in \text{A} \,\,\,and \,\,\, a \neq c.$ ... $\text{S}$ is a transitive relation. If a relation $\text{S}$ is transitive and triangular, then $\text{S}$ is a symmetric relation.

A relation $\text{R}$ on a set $\text{A}$ is said to be triangular iff $a\text{R}b$ and $c\text{R}b$ together imply $a\text{R}c,$ For all $a,b,c \in \text{A} \,\,\,and \,...

713 views

commented Dec 24, 2022

3 answers

5

GATE CSE 2015 Set 2 | Question: 6
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.

With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following...

13.3k views

commented Dec 12, 2022

6 answers

6

GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.

Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ buffers each of size equal to disk block size, out of w...

20.8k views

commented Dec 4, 2022

8 answers

7

GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases

Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...

15.2k views

commented Dec 4, 2022

1 answer

8

GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$

Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a fo...

7.1k views

commented Dec 4, 2022

7 answers

9

GATE CSE 2002 | Question: 1.19
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is Zero More than zero but less than that of an equivalent $3NF$ decomposition Proportional to the size of F+ Indeterminate

Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resu...

20.3k views

commented Nov 25, 2022

1 answer

10

Look-ahead buffer VS Look-aside buffer
What is the main difference between translation look aside buffer and translation look ahead buffer .

What is the main difference between translation look aside buffer and translation look ahead buffer .

9.3k views

commented Nov 14, 2022

6 answers

11

GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$

Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...

14.6k views

answered Nov 14, 2022

2 answers

12

GATE IT 2005 | Question: 18
The shell command find -name passwd -print is executed in /etc directory of a computer system running Unix. Which of the following shell commands will give the same information as the above command when executed in the same directory? ls passwd cat passwd grep name passwd grep print passwd

The shell commandfind -name passwd -printis executed in /etc directory of a computer system running Unix. Which of the following shell commands will give the same informa...

3.2k views

commented Nov 13, 2022

7 answers

13

GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which the signal handling routine executes? User mode Kernel mode Superuser mode Privileged mode

A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When ...

11.2k views

commented Nov 13, 2022

3 answers

14

GATE CSE 2017 Set 2 | Question: 08
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? Contiguous Linked Indexed $1$ and $3$ only $2$ only $3$ only $2$ and $3$ only

In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?ContiguousLinkedIndexed$1$ and $3$ only$2$ on...

13.0k views

commented Nov 13, 2022

5 answers

15

GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.

Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given:$45, 20, 90, 10, 50, 60, 80, 25, 70.$Assume that the initial position of...

23.9k views

commented Nov 13, 2022

5 answers

16

GATE IT 2006 | Question: 12
In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there are enough extra frames. It selects a process to suspend if the sum of the sizes of the working-sets exceeds the total number of available frames. I only II only Neither I nor II Both I and II

In the working-set strategy, which of the following is done by the operating system to prevent thrashing?It initiates another process if there are enough extra frames.It ...

10.6k views

comment edited Nov 13, 2022

2 answers

17

GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk

Which of the following requires a device driver?RegisterCacheMain memoryDisk

10.5k views

commented Nov 12, 2022

2 answers

18

GATE CSE 1998 | Question: 1.20
Which of the following is true? Unless enabled, a CPU will not be able to process interrupts. Loop instructions cannot be interrupted till they complete. A processor checks for interrupts before executing a new instruction. Only level triggered interrupts are possible on microprocessors.

Which of the following is true?Unless enabled, a CPU will not be able to process interrupts.Loop instructions cannot be interrupted till they complete.A processor checks ...

11.8k views

commented Nov 12, 2022

6 answers

19

GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$

A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...

23.9k views

commented Nov 9, 2022

3 answers

20

GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock

When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock

10.1k views

commented Nov 4, 2022

2 answers

21

GATE CSE 1999 | Question: 1.11, UGCNET-Dec2015-II: 44
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction

System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction

12.1k views

commented Nov 2, 2022

2 answers

22

GATE CSE 1997 | Question: 3.7
I/O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting $2$ programs through a pipe None of the above

I/O redirectionimplies changing the name of a filecan be employed to use an existing file as input file for a programimplies connecting $2$ programs through a pipeNone of...

8.6k views

commented Oct 21, 2022

2 answers

23

GATE 1995
If the disk is rotating at 3600rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory. (Given the size of track = 512 bytes)?

If the disk is rotating at 3600rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second betweendisk and memory. (Giv...

3.6k views

commented Oct 21, 2022

6 answers

24

GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$

How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$

17.6k views

comment edited Oct 20, 2022

4 answers

25

GATE CSE 2013 | Question: 46
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is (A) 4 (B) 5 (C) 6 (D) 7

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...

27.7k views

commented Oct 20, 2022

5 answers

26

GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$

Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but dire...

29.0k views

commented Oct 20, 2022

4 answers

27

GATE CSE 2006 | Question: 75
Consider two cache organizations. First one is $32$ $kB$ $2$-way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an address is $32$ $bits$ in both cases . A $2$-to-$1$ multiplexer has latency of $0.6 ns$ while a $k-$ ... of direct mapped is $h_2$. The value of $h_2$ is: $2.4$ $ns$ $2.3$ $ns$ $1.8$ $ns$ $1.7$ $ns$

Consider two cache organizations. First one is $32$ $kB$ $2$-way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an...

11.3k views

comment edited Oct 20, 2022

3 answers

28

GATE CSE 2005 | Question: 67
Consider a direct mapped cache of size $32$ $KB$ with block size $32$ $bytes$. The $CPU$ generates $32$ $bit$ addresses. The number of bits needed for cache indexing and the number of tag bits are respectively, $10, 17$ $10, 22$ $15, 17$ $5, 17$

Consider a direct mapped cache of size $32$ $KB$ with block size $32$ $bytes$. The $CPU$ generates $32$ $bit$ addresses. The number of bits needed for cache indexing and ...

15.2k views

commented Oct 20, 2022

4 answers

29

GATE IT 2005 | Question: 9
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$

A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of t...

10.9k views

commented Oct 20, 2022

3 answers

30

GATE IT 2004 | Question: 47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... output of $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$

Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop:for (i = 1; i < = 1000; i++) {I1, I2, I3, I4}where the time taken (in ns...

12.5k views

commented Oct 17, 2022

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