Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User rajoramanoj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rajoramanoj
3
answers
1
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$
commented
in
CO and Architecture
Jan 27, 2019
12.7k
views
gatecse-2005
co-and-architecture
cache-memory
easy
4
answers
2
TIFR CSE 2012 | Part B | Question: 6
Let $n$ be a large integer. Which of the following statements is TRUE? $2^{\sqrt{2\log n}}< \frac{n}{\log n}< n^{1/3}$ $\frac{n}{\log n}< n^{1/3}< 2^{\sqrt{2\log n}}$ $2^\sqrt{{2\log n}}< n^{1/3}< \frac{n}{\log n}$ $n^{1/3}< 2^\sqrt{{2\log n}}<\frac{n}{\log n}$ $\frac{n}{\log n}< 2^\sqrt{{2\log n}}<n^{1/3}$
commented
in
Algorithms
Nov 10, 2018
3.4k
views
tifr2012
algorithms
asymptotic-notations
6
answers
3
ISRO2007-11, GATE CSE 2001 | Question: 1.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
commented
in
Operating System
Mar 6, 2018
10.4k
views
isro2007
operating-system
process-scheduling
gatecse-2001
0
answers
4
turing machine
which of the following turing recognizable..????? L1 = {⟨M⟩∣ TM M accepts more than 2 distinct inputs} L2 = {⟨M⟩∣ TM M accepts at most 2 distinct inputs}
asked
in
Theory of Computation
Feb 1, 2018
168
views
turing-machine
7
answers
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
commented
in
Theory of Computation
Feb 1, 2018
28.7k
views
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
2
answers
6
GATE CSE 1998 | Question: 1.16
In serial communication employing $8$ data bits, a parity bit and $2$ stop bits, the minimum band rate required to sustain a transfer rate of $300$ characters per second is $2400$ band $19200$ band $4800$ band $1200$ band
commented
in
Computer Networks
Jan 30, 2018
6.7k
views
gate1998
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
10
answers
7
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
commented
in
Computer Networks
Jan 30, 2018
25.5k
views
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
1
answer
8
self doubt
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
commented
in
Computer Networks
Jan 30, 2018
834
views
1
answer
9
computer-networks csma-cd
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum and other overhead. The first bit slot after a successful ... . The effective data rate of the network is ________ (in Mbps). (Excluding overhead, assuming that there are no collisions)
asked
in
Computer Networks
Jan 17, 2018
697
views
computer-networks
csma-cd
0
answers
10
combination
The number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only are
asked
in
Mathematical Logic
Jan 17, 2018
146
views
combinatory
0
answers
11
max heap
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are
asked
in
Algorithms
Jan 17, 2018
599
views
0
answers
12
hashing
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions
asked
in
DS
Jan 17, 2018
526
views
hashing
probability
0
answers
13
ccombination
An entrepreneur needs to assign 5 different tasks to three of his employees. If every employee is assigned atleast 1 task, how many ways can the entrepreneur assign those tasks to his employees? explain in detail....
asked
in
Mathematical Logic
Jan 14, 2018
212
views
discrete-mathematics
combinatory
0
answers
14
chaining
commented
in
Programming
Jan 11, 2018
154
views
0
answers
15
round robin
commented
in
Operating System
Jan 11, 2018
233
views
2
answers
16
probability
The probability of a man hitting a target in one fire is 1/4 The number of times at least he must fire at the target in order that his chance of hitting the target at least once will exceed 2/3 will be _______.
answer selected
in
Probability
Jan 8, 2018
447
views
1
answer
17
conflict serializable schedules
How many concurrent schedules are conflict serializable of given transactions T1 and T2 :
commented
in
Databases
Jan 8, 2018
410
views
0
answers
18
DAG representation
Consider the basic block given below: u=u+v v=u-v w=u+x x=w/v The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
edited
in
Compiler Design
Jan 6, 2018
610
views
0
answers
19
B/B+ TREE
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. (A) B tree index has more levels than B+ tree index for large number of keys. (B) B+ tree index has more levels than B tree index ... C) Both B tree B+ tree best for sequential access of records. (D) B tree index nodes more than B+ tree for large number of keys.
commented
in
Databases
Jan 2, 2018
391
views
b-tree
0
answers
20
B+ tree
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes both block pointer and record pointer sizes 12 bytes each. How many maximum index blocks required if node order P is defined as between ⎡P/2⎤ to P pointers per node?
asked
in
Databases
Jan 2, 2018
202
views
1
answer
21
no. of functions
The number of function from set {1, 2, 3, 4, 5, 6, 7, 8} to set {0, 1} such that assign 1 to exactly one of given number less than 8 are .......................
commented
in
Combinatory
Dec 23, 2017
231
views
4
answers
22
TIFR CSE 2017 | Part B | Question: 1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph. How many vertex colouring with three colours does this graph have? $3^9$ $6^3$ $3 \times 2^8$ $27$ $24$
answered
in
Graph Theory
Dec 23, 2017
3.2k
views
tifr2017
graph-theory
graph-coloring
1
answer
23
recurrence relation
Which recurrence relation satisfy the sequence: 2, 3, 4, . . ., for n ≥ 1. A ) T(N) = 2 T(N-1) - T(N-2) B)T(N) = T(N-1) + T(N-2) C)T(N) = N+1 D) None of these
commented
in
Mathematical Logic
Dec 22, 2017
1.8k
views
recurrence-relation
7
answers
24
GATE CSE 2002 | Question: 13
In how many ways can a given positive integer $n \geq 2$ be expressed as the sum of $2$ positive integers (which are not necessarily distinct). For example, for $n=3$, the number of ways is $2$, i.e., $1+2, 2+1$. Give only ... $n \geq k$ be expressed as the sum of $k$ positive integers (which are not necessarily distinct). Give only the answer without explanation.
commented
in
Combinatory
Dec 8, 2017
5.4k
views
gatecse-2002
combinatory
normal
descriptive
balls-in-bins
3
answers
25
GATE CSE 1998 | Question: 16
Design a synchronous counter to go through the following states:$1, 4, 2, 3, 1, 4, 2, 3, 1, 4 \dots $
commented
in
Digital Logic
Dec 7, 2017
3.4k
views
gate1998
digital-logic
normal
descriptive
synchronous-asynchronous-circuits
18
answers
26
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
commented
in
Digital Logic
Dec 6, 2017
23.9k
views
gatecse-2004
digital-logic
normal
adder
1
answer
27
GATE CSE 2010 | Question: 7
The main memory unit with a capacity of $4$ $\text{megabytes}$ is built using $1\text{M} \times \text{1-bit}$ DRAM chips. Each DRAM chip has $1\text{K}$ rows of cells with $1\text{K}$ cells in each row. The time taken for a single ... in the memory unit is $100$ nanoseconds $100\times 2^{10}$ nanoseconds $100\times 2^{20}$ nanoseconds $3200\times 2^{20}$ nanoseconds
commented
in
Digital Logic
Dec 6, 2017
16.1k
views
gatecse-2010
digital-logic
memory-interfacing
normal
2
answers
28
GATE CSE 2002 | Question: 2.2
Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is $xyz'$ $xy + z$ $x + y$ None of the above
commented
in
Digital Logic
Nov 27, 2017
10.1k
views
gatecse-2002
digital-logic
circuit-output
normal
1
answer
29
GATE CSE 1998 | Question: 2.7
The function represented by the Karnaugh map given below is $A.B$ $AB+BC+CA$ $\overline{B \oplus C}$ $A.BC$
commented
in
Digital Logic
Nov 26, 2017
6.2k
views
gate1998
digital-logic
k-map
normal
1
answer
30
GATE CSE 1997 | Question: 72
Following floating point number format is given $f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ ... addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?
commented
in
Digital Logic
Nov 25, 2017
2.2k
views
gate1997
digital-logic
floating-point-representation
normal
descriptive
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...