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 Bikram
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Bikram
0
answers
1
doubt
Is a null matrix also a diagonal matrix? i read somewhere atleast one element in diagonal should be non zero to be a diagonal matrix //provided null matrix will be square and can a null square matrix be a scalar matrix ?
commented
in
Mathematical Logic
Sep 20, 2019
754
views
2
answers
2
GATE CSE 2009 | Question: 35
The running time of an algorithm is represented by the following recurrence relation: $T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$ Which one of the following represents the time complexity of the algorithm? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
commented
in
Algorithms
Sep 20, 2019
12.2k
views
gatecse-2009
algorithms
recurrence-relation
time-complexity
normal
7
answers
3
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
commented
in
Operating System
Sep 19, 2019
11.0k
views
gateit-2005
operating-system
os-protection
normal
ugcnetcse-june2012-paper3
7
answers
4
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
commented
in
Operating System
Sep 19, 2019
33.1k
views
gatecse-2017-set1
operating-system
process-synchronization
normal
10
answers
5
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
commented
in
DS
Sep 18, 2019
31.8k
views
gatecse-2003
data-structures
binary-heap
1
answer
6
Test by Bikram | Compiler Design | Test 1 | Question: 23
Which one of the following statements is TRUE? SLR parser has more states than LALR parser. LALR parser has more states than Canonical LR. Canonical LR has fewer states than SLR parser. Both SLR and LALR parsers have the same number of states.
answer selected
in
Compiler Design
Sep 18, 2019
302
views
tbb-cd-1
compiler-design
parsing
4
answers
7
GATE CSE 2008 | Question: 71
Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtual addresses and the page size is $4\text{Kbytes}$. A program to be run on this ... total size of the tags in the cache directory is: $32\text{Kbits}$ $34\text{Kbits}$ $64\text{Kbits}$ $68\text{Kbits}$
commented
in
CO and Architecture
Sep 17, 2019
18.6k
views
gatecse-2008
co-and-architecture
cache-memory
normal
12
answers
8
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
commented
in
Algorithms
Sep 16, 2019
20.9k
views
gatecse-2006
algorithms
graph-algorithms
normal
1
answer
9
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 8
A link between the CPU and the user is provided by: Peripheral Devices Storage Control Unit Software
commented
in
CO and Architecture
Sep 16, 2019
328
views
tbb-coa-1
co-and-architecture
1
answer
10
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 3
A hard disk system has the following parameters: Rotation speed - $6000$ rpm. Size of each sector - $1$ KB. Average number of sectors per track - $128$. Based on these parameters, which of the following statements is/are CORRECT? The ... per track is larger than $1$ MB. I only I and III only I and II only I, II, and III
commented
in
CO and Architecture
Sep 16, 2019
451
views
tbb-coa-1
co-and-architecture
2
answers
11
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 17
The fastest mode of data transfer is: Programmable I/O Interrupt I/O DMA Both A and B
commented
in
CO and Architecture
Sep 16, 2019
453
views
tbb-coa-1
co-and-architecture
io-handling
interrupts
dma
1
answer
12
Test by Bikram | Databases | Test 1 | Question: 1
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$ $2$ $3$ $4$ $5$
commented
in
Databases
Sep 14, 2019
1.2k
views
tbb-dbms-1
11
answers
13
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
commented
in
Operating System
Sep 14, 2019
23.7k
views
gateit-2005
operating-system
process-synchronization
normal
6
answers
14
GATE CSE 2019 | Question: GA-6
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
commented
in
Verbal Aptitude
Sep 13, 2019
12.3k
views
gatecse-2019
verbal-aptitude
verbal-reasoning
2-marks
1
answer
15
i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?
answered
in
Programming in C
Sep 13, 2019
3.4k
views
data-structures
3
answers
16
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
commented
in
Operating System
Sep 12, 2019
19.5k
views
gatecse-2003
operating-system
process-scheduling
normal
2
answers
17
GATE CSE 1995 | Question: 14
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector, Compute the unformatted capacity of the disk for the following parameters: Number of surfaces: $8$ Outer diameter of the disk: $12$ cm Inner diameter of ... rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
commented
in
Operating System
Sep 12, 2019
12.8k
views
gate1995
operating-system
disk
normal
descriptive
2
answers
18
Gate Practice
Q.1 VAS = 46 bit , Page size = 4KB , Page table entry = 4B ,3 level paging used ,1st level =12bits, 2nd level = 12bits,3rd level=10 bits(from right to left) Page table size for 4MB process.?? Q.2 Program size = 32MB , Page size = 1KB, VAS=46 bit ,Page table entry = 4B 3 level paging 1st = 12 bit ,2nd = 12 bit , 3rd = 10 bit Page table size.??
answered
in
Operating System
Sep 10, 2019
606
views
memory-management
3
answers
19
AN INTRODUCTION TO OPERATING SYSTEMS CONCEPTS AND PRACTICE (GNU/LINUX)
Suppose UNIX disk block will hold 2048 disk addresses. What is the maximum sized file using only the direct pointers? Single-indirection capability? Double indirection capability? Triple-indirection capability?
answered
in
Operating System
Sep 10, 2019
820
views
operating-system
memory-management
1
answer
20
Complete Matching
Consider the Bipartite graph shown. If four edges are chosen at random, what is the probability that they form a complete matching from V1 to V2 ? A. 0.039 B. 0.052 C. 0.071 D. 0.083
commented
in
Mathematical Logic
Sep 10, 2019
1.7k
views
graph-matching
graph-theory
discrete-mathematics
19
answers
21
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
commented
in
CO and Architecture
Sep 10, 2019
63.1k
views
gatecse-2004
co-and-architecture
virtual-memory
normal
1
answer
22
Test by Bikram | Mock GATE | Test 3 | Question: 4
There are coloured pens in a box. $10$ black ones, $8$ blue, $8$ green, $4$ red. With closed eyes, a person picks up some number of pens from the box. The least number of pens that person needs to pick up to ensure they get at least $4$ pens of the same color is _____.
answer selected
in
GATE
Sep 9, 2019
283
views
tbb-mockgate-3
discrete-mathematics
combinatory
pigeonhole-principle
numerical-answers
1
answer
23
Test by Bikram | Mock GATE | Test 3 | Question: 11
Consider the grammar: $S\rightarrow$ $PQ | SQ | PS$ $P\rightarrow k$ $Q\rightarrow m$ To get a set of $n$ terminals, the number of productions to be used are ______. $n^{2}$ $n + 1$ $2n - 1$ $2n$
answer selected
in
GATE
Sep 9, 2019
315
views
tbb-mockgate-3
theory-of-computation
context-free-grammar
grammar
1
answer
24
Test by Bikram | Mock GATE | Test 3 | Question: 14
We write a new algorithm by considering the fact that number of comparisons required by Selection Sort can be reduced by considering elements in pairs and finding the minimum and maximum element at the same time. What will be the time complexity of the new algorithm for comparisons of Selection Sort? $O/2$ $O(n)/4$ $O(n)$ $O$(\log n)$
answer selected
in
GATE
Sep 9, 2019
610
views
tbb-mockgate-3
algorithms
sorting
algorithm-design
1
answer
25
Test by Bikram | Mock GATE | Test 3 | Question: 17
Relative mode addressing is most relevant to writing a/an __________: Co-routine Position independent code Shareable code Interrupt handler
answer selected
in
GATE
Sep 9, 2019
258
views
tbb-mockgate-3
co-and-architecture
addressing-modes
4
answers
26
GATE CSE 1992 | Question: 01-vi
In an $11$-bit computer instruction format, the size of address field is $4$-bits. The computer uses expanding OP code technique and has $5$ two-address instructions and $32$ one-address instructions. The number of zero-address instructions it can support is ________
commented
in
CO and Architecture
Sep 8, 2019
13.1k
views
gate1992
co-and-architecture
machine-instruction
instruction-format
normal
numerical-answers
3
answers
27
Test by Bikram | Mock GATE | Test 3 | Question: 23
Partitioning and Merging are the two main parts of $Quick Sort$. Which of the following is TRUE? Partitioning is the key step while Merging is trivial. Partitioning is trivial while Merging is the key step. Both Partitioning and Merging are trivial. Both Partitioning and Merging are key steps.
answer selected
in
GATE
Sep 8, 2019
405
views
tbb-mockgate-3
algorithms
divide-and-conquer
sorting
quick-sort
1
answer
28
Test by Bikram | Mock GATE | Test 3 | Question: 24
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are available in both complemented and uncompleted forms. The delay ... using two-level $AND-OR$ logic. Thus, the overall propagation delay of the adder is ______ in terms of time units.
answer selected
in
GATE
Sep 8, 2019
571
views
tbb-mockgate-3
digital-logic
numerical-answers
adder
digital-circuits
1
answer
29
Test by Bikram | Mock GATE | Test 3 | Question: 27
Let $A$ be the set of non-zero integers. Let $R$ be the relation on $K × K$ defined as $\left ( a,b \right )$R$ $\left ( c,d \right )$ if $ad = bc$. The relation $K$ is a/an: Equivalence Relation Poset Antisymmetric Reflexive and symmetric, but not transitive
answer selected
in
GATE
Sep 8, 2019
352
views
tbb-mockgate-3
discrete-mathematics
set-theory&algebra
relations
1
answer
30
Test by Bikram | Mock GATE | Test 3 | Question: 26
The following function finds the $GCD$ recursively. int GCD(int k, int u) { if( u = = 0 ) return k ; else return GCD( u , ____); } Fill in the blank with the most appropriate function: $k/u$ $u/k$ $u \% k$ $k \% u$
answer selected
in
GATE
Sep 8, 2019
354
views
tbb-mockgate-3
programming
programming-in-c
identify-function
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...