Recent questions tagged numerical-answers

+1 vote

0 answers

1

Operating system madeeasy sheet
Plz some one give me os madeasy answers key of chapter virtual memory and disk scheduling Plz it is request

asked Aug 29 in Operating System by mobashshir (149 points) | 17 views

0 votes

2 answers

2

#c programming
#include<iostream> using namespace std; int main() { int a[] = {10,20,30,40,50}; cout<<(*(&a+1)-a); return 0; } how th o/p is 5 ??

asked Jul 18 in Programming by vijju532 (441 points) | 65 views

0 votes

1 answer

3

#C Recursion Question (A variance of Gate 2018) Question

asked Jun 28 in Programming by iarnav Loyal (8.1k points) | 104 views

+1 vote

1 answer

4

GATE Linear Algebra
For what values of $\lambda$ the system of equations will have $2$ linear independent solutions - $x + y + z = 0$ $(\lambda + 1) y + (\lambda + 1) z = 0$ ($\lambda^{2}- 1) z = 0$ Now the problem i'm facing is if there is ... rank of matrix will be $1$. Can anyone please explain in simple why the rank of matrix should be $1$ if we need $2$ Linear Independent solution. Thankyou.

asked Mar 2 in Linear Algebra by pilluverma123 (293 points) | 88 views

+14 votes

4 answers

5

GATE2018-55
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense the medium access protocol. A node that receives a packet to ... integer) that allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.

asked Feb 14 in Computer Networks by gatecse Boss (18.1k points) | 3.5k views

+17 votes

4 answers

6

GATE2018-52
Given a language $L$, define $L^i$ as follows: $$L^0 = \{ \varepsilon \}$$ $$L^i = L^{i-1} \bullet L \text{ for all } I >0$$ The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1$ (over alphabet O) accepted by the following automaton. The order of $L_1$ is ____

asked Feb 14 in Theory of Computation by gatecse Boss (18.1k points) | 2.7k views

+12 votes

1 answer

7

GATE2018-53
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk requests of the form [sector ... The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____

asked Feb 14 in Operating System by gatecse Boss (18.1k points) | 2.4k views

+9 votes

3 answers

8

GATE2018-54
Consider an IP packet with a length of $4,500$ $bytes$ that includes a $20-byte$ IPv4 header ans $40-byte$ TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of $600$ $bytes$. Assume that the ... the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is _____.

asked Feb 14 in Computer Networks by gatecse Boss (18.1k points) | 2.3k views

+14 votes

4 answers

9

GATE2018-51
A processor has $16$ integer registers $(R0, R1, \ldots , R15)$ and $64$ floating point registers $(F0, F1, \ldots , F63).$ It uses a $2- byte$ instruction format. There are four categories of instructions: $Type-1, Type-2, Type-3,$ and $Type-4. ... 1F).$ $Type-4$ category consists of $N$ instructions, each with a floating point register operand $(1F).$ The maximum value of $N$ is _____

asked Feb 14 in CO & Architecture by gatecse Boss (18.1k points) | 3k views

+7 votes

6 answers

10

GATE2018-49
Consider the minterm list form of a Boolean function $F$ given below. $$F(P, Q, R, S) = \Sigma m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)$$ Here, $m$ denotes a minterm and $d$ denotes a don't care term. The number of essential prime implicants of tte function $F$ is ___

asked Feb 14 in Digital Logic by gatecse Boss (18.1k points) | 2k views

+10 votes

6 answers

11

GATE2018-47
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.

asked Feb 14 in Algorithms by gatecse Boss (18.1k points) | 2.3k views

+12 votes

4 answers

12

GATE2018-50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ stages take $1$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.

asked Feb 14 in CO & Architecture by gatecse Boss (18.1k points) | 2.5k views

+9 votes

10 answers

13

GATE2018-46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

asked Feb 14 in Combinatory by gatecse Boss (18.1k points) | 3.6k views

+9 votes

4 answers

14

GATE2018-48
Consider the weights and values of items listed below. Note that there is only one unit of each item. Item number Weight (in Kgs) Value (in rupees) $1$ $10$ $60$ $2$ $7$ $28$ $3$ $4$ $20$ $4$ $2$ $24$ The task is to pick a subset of these items such that ... The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}-V_{greedy}$ is ____

asked Feb 14 in Algorithms by gatecse Boss (18.1k points) | 2.7k views

+11 votes

1 answer

15

GATE2018-43
Let $G$ be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2,.., 100. There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent numbers in the label ... . Let $y$ denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then,$y+10z$ = ____

asked Feb 14 in Algorithms by gatecse Boss (18.1k points) | 2.1k views

+10 votes

4 answers

16

GATE2018-45
Consider the following program written in pseudo-code. Assume that $x$ and $y$ are integers. Count (x, y) { if (y !=1 ) { if (x !=1) { print("*"); Count (x/2, y); } else { y=y-1; Count (1024, y); } } } The number of times that the $print$ statement is executed by the call $Count(1024, 1024)$ is _____

asked Feb 14 in Programming by gatecse Boss (18.1k points) | 2.2k views

+5 votes

3 answers

17

GATE2018-44
Consider Guwahati, (G) and Delhi (D) whose temperatures can be classified as high $(H)$, medium $(M)$ and low $(L)$. Let $P(H_G)$ denote the probability that Guwahati has high temperature. Similarly, $P(M_G)$ and $P(L_G)$ denotes the ... (L_G)=0.3$, then the probability (correct to two decimal places) that Guwahati has high temperature given that Delhi has high temperature is _____

asked Feb 14 in Probability by gatecse Boss (18.1k points) | 2k views

+6 votes

1 answer

18

GATE2018-24
Consider a system with $3$ processors that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___

asked Feb 14 in Operating System by gatecse Boss (18.1k points) | 1.9k views

+5 votes

3 answers

19

GATE2018-25
Consider a long-lived $TCP$ session with an end-to-end bandwidth of $1$ $\text{Gbps}$ (-$10^9$ bits-per-second). The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is ____

asked Feb 14 in Computer Networks by gatecse Boss (18.1k points) | 4k views

+5 votes

1 answer

20

GATE2018-23
A $32$-$bit$ wide main memory unit with a capacity of $1$ $GB$ is built using $256$$M$ $\times$ $4-bit$ DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The time taken to perform one refresh operation is $50$ ... percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is_____.

asked Feb 14 in CO & Architecture by gatecse Boss (18.1k points) | 2.4k views

+12 votes

3 answers

21

GATE2018-22
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____

asked Feb 14 in Digital Logic by gatecse Boss (18.1k points) | 2.2k views

+6 votes

6 answers

22

GATE2018-21
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.

asked Feb 14 in Programming by gatecse Boss (18.1k points) | 1.8k views

+7 votes

4 answers

23

GATE2018-20
The postorder traversal of a binary tree is $\text{8, 9, 6, 7, 4, 5, 2, 3, 1}$. The inorder traversal of the same tree is ${8, 6, 9, 4, 7, 2, 5, 1, 3}$. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____

asked Feb 14 in DS by gatecse Boss (18.1k points) | 1.6k views

+7 votes

4 answers

24

GATE2018-18
The chromatic number of the following graph is _____

asked Feb 14 in Graph Theory by gatecse Boss (18.1k points) | 1.6k views

+4 votes

4 answers

25

GATE2018-19
Let $G$ be a finite group on $84$ elements. The size of a largest possible proper subgroup of $G$ is _____

asked Feb 14 in Set Theory & Algebra by gatecse Boss (18.1k points) | 1.9k views

+6 votes

6 answers

26

GATE2018-16
The value of $\int^{\pi/4} _0 x \cos(x^2) dx$ correct to three decimal places (assuming that $\pi = 3.14$) is ____

asked Feb 14 in Calculus by gatecse Boss (18.1k points) | 2k views

+6 votes

4 answers

27

GATE2018-17
Consider a matrix $A= uv^T$ where $u=\begin{pmatrix}1 \\ 2 \end{pmatrix} , v = \begin{pmatrix}1 \\1 \end{pmatrix}$. Note that $v^T$ denotes the transpose of $v$. The largest eigenvalue of $A$ is ____

asked Feb 14 in Linear Algebra by gatecse Boss (18.1k points) | 1.5k views

+4 votes

5 answers

28

GATE2018-15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial as a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____

asked Feb 14 in Probability by gatecse Boss (18.1k points) | 1.7k views

+2 votes

0 answers

29

Mathematics for Algorithm and Systems Analysis By Edward A. Bender, Stanley Gill Williamson

asked Jan 22 in Numerical Ability by pankaj joshi 1 (319 points) | 51 views

+1 vote

0 answers

30

Mathematics for Algorithm and Systems Analysis By Edward A. Bender, Stanley Gill Williamson

asked Jan 22 in Numerical Ability by pankaj joshi 1 (319 points) | 35 views

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 questions tagged numerical-answers

Recent Posts

Recent Blog Comments