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 Souvik33
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Souvik33
0
votes
1
GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
answered
in
Probability
Apr 7, 2023
19.7k
views
gatecse-2013
probability
expectation
normal
0
votes
2
GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First
answered
in
Operating System
Mar 31, 2023
14.2k
views
gatecse-2023
operating-system
process-scheduling
multiple-selects
1-mark
10
votes
3
GATE CSE 2023 | Question: 17
Which one or more of the following $\text{CPU}$ scheduling algorithms can potentially cause starvation? First-in First-Out Round Robin Priority Scheduling Shortest Job First
answered
in
Operating System
Mar 31, 2023
14.2k
views
gatecse-2023
operating-system
process-scheduling
multiple-selects
1-mark
2
votes
4
GATE CSE 2023 | Question: 2
Which one of the following sequences when stored in an array at locations $A[1], \ldots, A[10]$ forms a max-heap? $23,17,10,6,13,14,1,5,7,12$ $23,17,14,7,13,10,1,5,6,12$ $23,17,14,6,13,10,1,5,7,15$ $23,14,17,1,10,13,16,12,7,5$
answered
in
DS
Mar 30, 2023
6.5k
views
gatecse-2023
data-structures
binary-heap
1-mark
0
votes
5
GATE CSE 2014 Set 2 | Question: 4
If the matrix $A$ is such that $A= \begin{bmatrix} 2\\ −4\\7\end{bmatrix}\begin{bmatrix}1& 9& 5\end{bmatrix}$ then the determinant of $A$ is equal to ______.
answered
in
Linear Algebra
Mar 29, 2023
12.7k
views
gatecse-2014-set2
linear-algebra
numerical-answers
easy
determinant
0
votes
6
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
answered
in
Graph Theory
Mar 29, 2023
34.7k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
0
votes
7
GATE CSE 2023 | GA Question: 5
Looking at the surface of a smooth $3$-dimensional object from the outside, which one of the following options is $\text{TRUE}?$ The surface of the object must be concave everywhere. The surface of the object must be convex everywhere. The surface of the object may be concave in some places and convex in other places. The object can have edges, but no corners.
answered
in
Spatial Aptitude
Feb 9, 2023
10.9k
views
gatecse-2023
spatial-aptitude
three-dimensional-figure
1-mark
0
votes
8
Programming and Data Structure | Static int | Made Easy Test series (Modified)
Consider the following C code snippets, labeled as P1, P2 and P3, the output of P1 is X , of P2 is Y and of P3 as Z . What is the value of X+Y+Z P1 #include <stdio.h> int f(int n) { static int r=40; if (n==0 | ... 1,r)-r; } else return f(n-1,r)+(2*r); } int main() { printf("%d",f(6,40)); return 0; }
answered
in
Programming in C
Jan 29, 2023
453
views
data-structures
programming-in-c
0
votes
9
GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
answered
in
DS
Jan 25, 2023
16.4k
views
gatecse-2014-set3
data-structures
tree
easy
0
votes
10
Made Easy Test Series | HTTP & TCP
Assume that we are retrieving a HTML file with 10 embedded objects. To retrieve the base file and the objects under non-persistent HTTP with no parallel connections, X' number of round trip time is required. Y' number of round trip time is required to retrieve the base file and the objects under ... 14) X=22, Y=6, Z= 56 (∵ X+Y = 28) X=21, Y=5, Z= 26 (∵ X+Y = 26)
answered
in
Computer Networks
Jan 20, 2023
468
views
http
made-easy-test-series
computer-networks
tcp
1
vote
11
GATE CSE 2014 Set 2 | Question: 10 | Modified
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(-435) is: 6 9 Will loop forever Depends on computer architecture
answered
in
Programming in C
Jan 15, 2023
1.1k
views
algorithms
identify-function
numerical-answers
easy
0
votes
12
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
answered
in
Databases
Jan 14, 2023
522
views
made-easy-test-series
databases
true-false
1
vote
13
Made Easy Test Series | Prog And DS | Linked List
The following C function rearranges the members of a single-linked list of integers that is passed as a parameter. The list of numbers 1, 2, 3, 4, 5, 6, and 7 in the specified order is passed to the function when it is called. How many components will move about in the list once the function is finished running?
answered
in
Programming in C
Jan 11, 2023
751
views
programming-in-c
made-easy-test-series
data-structures
linked-list
0
votes
14
GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
answered
in
Linear Algebra
Jan 8, 2023
20.2k
views
gatecse-2017-set1
linear-algebra
system-of-equations
normal
0
votes
15
Made Easy Test Series | Discrete Maths | POSET | Chain length
50 51 52 53
answered
in
Graph Theory
Jan 5, 2023
508
views
made-easy-test-series
discrete-mathematics
1
vote
16
Self Doubt
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
answered
in
Operating System
Jan 1, 2023
675
views
operating-system
deadlock-prevention-avoidance-detection
0
votes
17
Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions: X → X+Y | Y Y→ Y*Z | Z Z → (X) Z → id If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?
answered
in
Compiler Design
Jan 1, 2023
845
views
compiler-design
made-easy-test-series
parsing
made-easy-booklet
lr-parser
2
votes
18
Number Of Substrings | Made Easy Test Series
The number of subwords for w=’SCALABLE” is equal to: 34 35 37
answered
in
Combinatory
Dec 21, 2022
845
views
combinatory
counting
made-easy-test-series
2
votes
19
Database Relations | Heighest normal form
MSQ A relation R(A,B,C,D) has only trivial functional dependencies of the form ( A→A, AB→AB,ABC→A, etc) Then consider the following options: The relation is surely in BCNF The relation is surely in 3NF The relation is surely in 2NF None of the above
answered
in
Databases
Dec 17, 2022
753
views
database-normalization
databases
bcnf
normal-forms
multiple-selects
0
votes
20
GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
answered
in
Theory of Computation
Dec 17, 2022
37.5k
views
gateit-2004
theory-of-computation
pushdown-automata
normal
1
vote
21
CO and Arcitecture | RISC | Instruction pipelining
MSQ Which among the following statements is/are TRUE for a pipelined RISC computer. PC is usually incremented during Instruction Cycle (IF,ID) PC may be incremented during Execution Cycle (EX,MA,WB) Filling the Accumulator ... during the Instruction Cycle (IF,ID) All non-register memory fetching operations are done in Load instructions only.
answered
in
CO and Architecture
Dec 16, 2022
787
views
pipelining
multiple-selects
co-and-architecture
machine-instruction
instruction-execution
1
vote
22
Logical and Physical Address Generation | OS
MSQ Consider execution of the following C code for different cases: printf( %d ,&a); Consider the following statements. Which among these are TRUE: Will print Logical Address in case of Local Variables, as they are static ... runtime, like malloc() Will print Logical Address in case of variables Dynamically allocated during the runtime, like malloc()
answered
in
Operating System
Dec 3, 2022
491
views
memory-management
paging
co-and-architecture
operating-system
multiple-selects
0
votes
23
Malloc | Free | Dangling Pointer | Prog. & DS
MSQ Consider the following C snippet: #include <stdio.h> int main() { int *ptr = (int*) malloc(100*sizeof(int)); *ptr=33; printf("%d %d\n",ptr,*ptr); // Line X free(ptr); *ptr=37; printf("%d %d\n",ptr,* ... *ptr) is 0 as in Line Y, the allocated heap is freed, and we cannot update it anymore, as ptr is now a dangling pointer
answered
in
Programming in C
Nov 28, 2022
630
views
data-structures
pointers
programming-in-c
1
vote
24
GATE CSE 2004 | Question: 11
Consider the following statements with respect to user-level threads and kernel-supported threads context switch is faster with kernel-supported threads for user-level threads, a system call can block the entire process Kernel supported threads can be scheduled independently User level threads ... ) and (IV) only (II) and (III) only (I) and (III) only (I) and (II) only
answered
in
Operating System
Nov 24, 2022
27.5k
views
gatecse-2004
operating-system
threads
normal
0
votes
25
Made Esy Test Series 2022 | COA | Subject wise Q.no 17
** MSQ ** Consider the following sequence of micro-operations (μO) on a system used for instruction fetch: Where MAR is memory address register, PC is program counter, MBR is memory buffer register and IR is instruction register. And ... the following μO's can execute parallely without conflict. μO2 and μO3 μO1 and μO3 μO4 and μO3 μO2 and μO4
answered
in
CO and Architecture
Nov 23, 2022
564
views
co-and-architecture
made-easy-test-series
multiple-selects
test-series
instruction-execution
0
votes
26
GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______
answered
in
Operating System
Nov 20, 2022
15.7k
views
gatecse-2016-set2
operating-system
semaphore
normal
numerical-answers
0
votes
27
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
answered
in
CO and Architecture
Nov 20, 2022
17.9k
views
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
2
votes
28
Modified GATE CSE 2017 Set 2 | Question: 33 (MSQ Version)
** MSQ ** A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below: Which of the following best describes the system? Safe state P3 → P2 → P1 and P3 ... never possible as safe states are present Deadlock is possible in future, even tough we have safe state as of now
answered
in
Operating System
Nov 19, 2022
874
views
operating-system
resource-allocation
normal
multiple-selects
0
votes
29
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
answered
in
Operating System
Nov 17, 2022
30.1k
views
gatecse-2013
operating-system
disk
normal
Page:
1
2
next »
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:...