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 papesh
5
answers
1
GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$
Consider the following C code. Assume that unsigned long int type length is $64$ bits.unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for(...
16.0k
views
commented
Feb 23, 2018
Programming in C
gatecse-2018
programming-in-c
normal
programming
2-marks
+
–
5
answers
2
GATE IT 2008 | Question: 38
Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the effective address is calculated; EA = −(X) is the effective address equal to the contents of location X, with X decremented by one word length before the ... back to the stack. ADD (X)−, (X) ADD (X), (X)− ADD −(X), (X)+ ADD −(X), (X)
Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the effective address is calculated; EA = ...
9.0k
views
commented
Jan 11, 2018
CO and Architecture
gateit-2008
co-and-architecture
machine-instruction
normal
+
–
2
answers
3
madeeasy theory book
a sorted array of n elements contains 0 and 1. to find out majority of 0 and 1 how much ime it will take? 1)O(1) 2)O(logn) 3)O(n) 4)O(n^2)
a sorted array of n elements contains 0 and 1. to find out majority of 0 and 1 how much ime it will take?1)O(1)2)O(logn)3)O(n)4)O(n^2)
390
views
commented
Sep 7, 2017
Programming in C
data
data-structures
+
–
2
answers
4
cache memory
what will be size of main memory. when 4-way set associative mapping of cache memory is done and cache size is 256 KB and Tag field has 7 bits( consider, memory is byte addresable )
what will be size of main memory. when 4-way set associative mapping of cache memory is done and cache size is 256 KB and Tag field has 7 bits( consider, memory is byte ...
1.1k
views
answered
Sep 4, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
2
answers
5
Please solve this Q
Q. An IPv4 packet has the first few hexadecimal digits as shown below. 0X4500005C000300005906…. How many hops can this packet take before being dropped? A. 30 B. 59 C. 89 D. 90
Q. An IPv4 packet has the first few hexadecimal digits as shown below.0X4500005C000300005906….How many hops can this packet take before being dropped?A. 30 B. 59 C. 89 ...
12.0k
views
answered
Sep 4, 2017
Computer Networks
computer-networks
+
–
1
answer
6
cache memory
In k-way set associative mapping , the tag field contains 8 bits and 64 no. of sets and propagation delay of a comparator is k/20 nsec and propagation delay of 2*1 multiplexer is k/10 nsec. then what will be the total delay? (let k=8)
In k-way set associative mapping , the tag field contains 8 bits and 64 no. of sets and propagation delay of a comparator is k/20 nsec and propagation delay of 2*1 multip...
611
views
commented
Sep 4, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
4
answers
7
cache memory
when 8-way set associative mapping of cache memory is done and main memory size is 32 GB and Tag field has 10 bits. what will be the cache size ( consider, memory is byte addresable )
when 8-way set associative mapping of cache memory is done and main memory size is 32 GB and Tag field has 10 bits. what will be the cache size ( consider, memory is byt...
3.1k
views
answered
Sep 4, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
2
answers
8
precedence
#include<stdio.h> int main() { int a=-1; int c = ++a + a++ + --a; printf("%d ",c); }
#include<stdio.h>int main() { int a=-1;int c = ++a + a++ + a; printf("%d ",c);}
488
views
commented
Sep 4, 2017
Programming in C
programming-in-c
+
–
0
answers
9
data communication and network
host a needs to send a payload size of 2400 bytes to host B across the network having MTU of 400 bytes if fragmentation takes place how many fragment will be there & what will be the data data length of each fragment?
host a needs to send a payload size of 2400 bytes to host B across the network having MTU of 400 bytes if fragmentation takes place how many fragment will be there & wha...
659
views
comment moved
Sep 3, 2017
1
answer
10
Test by Bikram | Computer Networks | Test 1 | Question: 23
The bandwidth in a Stop n Wait ARQ is $1$ Gbps and $1$ bit delay to make round trip time $30$ microseconds, if data frames are $2000$ bits in length then the link is utilized in __________ percentage.
The bandwidth in a Stop n Wait ARQ is $1$ Gbps and $1$ bit delay to make round trip time $30$ microseconds, if data frames are $2000$ bits in length then the link is util...
1.0k
views
commented
Sep 3, 2017
Computer Networks
tbb-cn-1
numerical-answers
+
–
14
answers
11
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
38.1k
views
commented
Sep 3, 2017
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
1
answer
12
datatype
{ signed int i =-13; unsigned int k= i%2; printf("%d\n",k); } a. -13 b.compilation error c.-1 d.1
{signed int i =-13;unsigned int k= i%2;printf("%d\n",k);}a. -13b.compilation errorc.-1d.1
452
views
commented
Sep 3, 2017
Programming in C
programming-in-c
+
–
1
answer
13
Gate 94
A ring oscillator consisting of 4 inverter is running at a frequency of 1 MHz. the propagation delay per gate is __________ ?
A ring oscillator consisting of 4 inverter is running at a frequency of 1 MHz. the propagation delay per gate is __________ ?
1.9k
views
commented
Sep 1, 2017
1
answer
14
self doubt
what is the meaning of "interrupts are asynchronous">
what is the meaning of "interrupts are asynchronous">
239
views
commented
Sep 1, 2017
1
answer
15
arun sharma
710
views
commented
Sep 1, 2017
Quantitative Aptitude
quantitative-aptitude
number
system
+
–
5
answers
16
Kenneth Rosen Edition 6th Exercise 5.5 Question 15 (Page No. 380)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
How many solutions are there to the equationx1 + x2 + x3 + x4 + x5 = 21,where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
10.0k
views
answer edited
Sep 1, 2017
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
2
answers
17
regular expressions
Consider a DFA with 1000000000000000000000000000 states, over the input alphabet consisting of all Greek alphabet letters. What can we say about it? a.It is not possible that it accepts the empty set. b.It is not possible that it accepts only empty string ... possible that it accepts strings of length 1 only. d.It is possible that it accepts all strings over the input alphabet.
Consider a DFA with 1000000000000000000000000000 states, over the input alphabet consisting of all Greek alphabet letters. What can we say about it?a.It is not possible t...
923
views
answered
Sep 1, 2017
Theory of Computation
theory-of-computation
regular-expression
regular-language
finite-automata
+
–
0
answers
18
logic function and minimization
the simultaneous equation on the boolean variables x,y,z,and w, x+y+z=1 xy=0 xz+w=1 xy+z'w'=0 have the following solution for x ,y,z and w a>0100 b>1101 c>1011 d>1000
the simultaneous equation on the boolean variables x,y,z,and w,x+y+z=1xy=0xz+w=1xy+z'w'=0have the following solution for x ,y,z and w a>0100b>1101c>1011d>1000
679
views
commented
Sep 1, 2017
Digital Logic
digital-logic
+
–
0
answers
19
#Finite Automata
How many finite automatas are there with 2 states x and y, where x is always initial state over alphabet a and b that accepts everything??
How many finite automatas are there with 2 states x and y, where x is always initial state over alphabet a and b that accepts everything??
231
views
commented
Sep 1, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
20
demand paging
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is ... is modified 70% of the time ? What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds?
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced pa...
1.2k
views
answered
Sep 1, 2017
Operating System
demand-paging
operating-system
+
–
1
answer
21
MADE EASY
A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?
A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?
1.7k
views
commented
Aug 29, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
22
UGC NET CSE | December 2015 | Part 2 | Question: 1
How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women 75240 52492 41800 9900
How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women7524052492418009900
3.8k
views
answer edited
Aug 28, 2017
Combinatory
combinatory
ugcnetcse-dec2015-paper2
+
–
2
answers
23
programming
void printnum(int a) { if(a>1) { printnum(a/2); printnum(a/2); } pf("*"); } how many astreiks for printnum(5)
void printnum(int a){if(a>1){printnum(a/2);printnum(a/2);}pf("*");}how many astreiks for printnum(5)
322
views
answered
Aug 19, 2017
13
answers
24
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...
15.0k
views
commented
Aug 5, 2017
CO and Architecture
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
+
–
5
answers
25
GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The roo...
15.0k
views
commented
May 10, 2017
Databases
gate1997
databases
b-tree
normal
descriptive
+
–
4
answers
26
ISRO2017-23
What is the minimum number of two-input $\text{NAND}$ gates used to perform the function of two-input $\text{OR}$ gate? One Two Three Four
What is the minimum number of two-input $\text{NAND}$ gates used to perform the function of two-input $\text{OR}$ gate?OneTwoThreeFour
9.1k
views
commented
May 10, 2017
Digital Logic
isro2017
digital-logic
min-no-gates
+
–
5
answers
27
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
3.5k
views
commented
May 9, 2017
Databases
gate1994
databases
b-tree
normal
descriptive
+
–
1
answer
28
Kurose-Ross 3rd edition chapter 1 problem 18
Suppose there is 10Mbps microwave link between a geostationary satellite and its base station on earth. Every minute the satellite takes a digital photo and send to the station.Assume a propagation speed of 2.4*108 m/s. What is the propagation delay of the link ?
Suppose there is 10Mbps microwave link between a geostationary satellite and its base station on earth. Every minute the satellite takes a digital photo and send to the s...
602
views
answered
May 9, 2017
Computer Networks
computer-networks
+
–
1
answer
29
Cutoff for ISRO
How much marks will be needed to qualify for ISRO 2017 interview?please give some rough idea based on ISRO 2016 experince...
How much marks will be needed to qualify for ISRO 2017 interview?please give some rough idea based on ISRO 2016 experince...
6.9k
views
commented
May 9, 2017
ISRO
isro-preparation
+
–
0
answers
30
#Database#B+Tree
A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of internal nodes in a B+ tree of order 4 with 52 leave??
A B+ tree of order 'd' is a tree in which each internal node has between 'd' and '2d' keys values. The root has between 1 and '2d' values. What is the maximum number of i...
347
views
closed
May 9, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register