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 swettt871
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by swettt871
0
votes
1
GATE CSE 2021 Set 2 | Question: 38
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined: $\text{USE}(S)$ : the set of variables used in $S$ $\text{IN}(S)$ : the set of variables that are live at the entry of $S$ $\text{OUT}(S)$ : the set of variables ... S_2$) }\cup \text{ OUT ($S_2$)}$ $\text{OUT ($S_1$)} = \text{USE ($S_1$)} \cup \text{IN ($S_2$)}$
answered
in
Compiler Design
Feb 22, 2021
6.7k
views
gatecse-2021-set2
code-optimization
live-variable-analysis
compiler-design
2-marks
0
votes
2
GATE CSE 2014 Set 2 | Question: 20
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $4$ bytes in size. Given a $100 \times 10^6$ bytes disk on which the file system is stored and data block size is $10^3$ bytes, the maximum size of a file that can be stored on this disk in units of $10^6$ bytes is _________.
answered
in
Operating System
Feb 3, 2021
20.6k
views
gatecse-2014-set2
operating-system
disk
numerical-answers
normal
file-system
0
votes
3
GATE CSE 2016 Set 1 | Question: 09
A processor can support a maximum memory of $4\;\textsf{GB}$, where the memory is word-addressable (a word consists of two bytes). The size of address bus of the processor is at least _________bits.
answered
in
CO and Architecture
Feb 3, 2021
12.4k
views
gatecse-2016-set1
co-and-architecture
easy
numerical-answers
memory-interfacing
0
votes
4
GATE CSE 2018 | Question: 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$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.
answered
in
CO and Architecture
Feb 3, 2021
23.8k
views
gatecse-2018
co-and-architecture
pipelining
numerical-answers
2-marks
0
votes
5
GATE CSE 2018 | Question: 51
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{- byte}$ instruction format. There are four categories of ... $\text{(1F)}.$ The maximum value of $\text{N}$ is _________.
answered
in
CO and Architecture
Feb 3, 2021
24.2k
views
gatecse-2018
co-and-architecture
machine-instruction
instruction-format
numerical-answers
2-marks
0
votes
6
GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.
answered
in
CO and Architecture
Feb 3, 2021
20.4k
views
gatecse-2019
numerical-answers
co-and-architecture
cache-memory
2-marks
1
vote
7
GATE CSE 2019 | Question: 2
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has $16$ address lines denoted by $A_{15}$ to $A_0$. What is the range of address (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal? C800 to CFFF CA00 to CAFF C800 to C8FF DA00 to DFFF
answered
in
CO and Architecture
Feb 3, 2021
12.6k
views
gatecse-2019
co-and-architecture
dram
1-mark
0
votes
8
Fork (ACE)
main() { if(fork()>=0) { printf("*"); if(fork()==0) { printf("*"); } else{ //do nothing } printf("*"); } How many number of times “*” will be printed?
answered
in
Operating System
Feb 2, 2021
3.4k
views
fork-system-call
operating-system
0
votes
9
Transaction
answered
in
Databases
Feb 2, 2021
455
views
databases
transaction-and-concurrency
0
votes
10
DBMS transaction
Which of the following is used to get back all the transactions back after rollback? a)Rollback b)Commit c)undo d)Redo
answered
in
Databases
Feb 2, 2021
615
views
databases
transaction-and-concurrency
0
votes
11
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
answered
in
Algorithms
Feb 1, 2021
3.5k
views
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
1
vote
12
GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
answered
in
Algorithms
Feb 1, 2021
22.5k
views
gatecse-2016-set2
dynamic-programming
algorithms
matrix-chain-ordering
normal
numerical-answers
0
votes
13
GATE CSE 2010 | Question: 65
Given digits $ 2, 2, 3, 3, 3, 4, 4, 4, 4$ how many distinct $4$ digit numbers greater than $3000$ can be formed? $50$ $51$ $52$ $54$
answered
in
Quantitative Aptitude
Feb 1, 2021
17.3k
views
gatecse-2010
quantitative-aptitude
combinatory
normal
0
votes
14
LL(k) Grammar
Consider the grammar with the following productions. S→aaB/aaC B→b C→c Which of the following option is true ? (A) The grammar is LL(3) (B) The grammar is LL(1) (C) The grammar is LL(2) (D) It can’t be LL(k) grammar for any k, as it contains left factoring.
answered
in
Compiler Design
Feb 1, 2021
6.8k
views
compiler-design
grammar
ll-parser
parsing
0
votes
15
GATE CSE 2000 | Question: 2.22
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds
answered
in
Operating System
Feb 1, 2021
18.2k
views
gatecse-2000
operating-system
easy
virtual-memory
1
vote
16
GATE CSE 1993 | Question: 6.7
A certain moving arm disk storage, with one head, has the following specifications: Number of tracks/recording surface $= 200$ Disk rotation speed $= 2400$ rpm Track storage capacity $= 62,500$ bits The average latency of this device is $\text{P}$ ms and the data transfer rate is $\text{Q}$ bits/sec. Write the values of $\text{P}$ and $\text{Q}$.
answered
in
Operating System
Feb 1, 2021
20.2k
views
gate1993
operating-system
disk
normal
descriptive
0
votes
17
GATE CSE 2019 | Question: 3
Which one of the following kinds of derivation is used by LR parsers? Leftmost Leftmost in reverse Rightmost Rightmost in reverse
answered
in
Compiler Design
Jan 30, 2021
9.5k
views
gatecse-2019
compiler-design
parsing
1-mark
0
votes
18
GATE CSE 2010 | Question: 11
What does the following program print? #include<stdio.h> void f(int *p, int *q) { p=q; *p=2; } int i=0, j=1; int main() { f(&i, &j); printf("%d %d\n", i,j); return 0; } $2 \ 2$ $2 \ 1$ $0 \ 1$ $0 \ 2$
answered
in
Programming in C
Jan 29, 2021
9.6k
views
gatecse-2010
programming
programming-in-c
easy
parameter-passing
0
votes
19
GATE CSE 2012 | Question: 48
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += + ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$
answered
in
Programming in C
Jan 29, 2021
13.8k
views
gatecse-2012
programming
programming-in-c
normal
0
votes
20
GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.
answered
in
Compiler Design
Jan 29, 2021
19.2k
views
gatecse-2014-set3
compiler-design
numerical-answers
normal
code-optimization
0
votes
21
GATE CSE 2017 Set 2 | Question: 54
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n--; --n1; n-=n1; printf(“%d”, n); return 0; } The output of the program is ______
answered
in
Programming in C
Jan 28, 2021
11.8k
views
gatecse-2017-set2
programming-in-c
numerical-answers
easy
0
votes
22
Linear and Quadratic probing
1.Linear Probing suffers from both primary and secondary clustering. true or false? 2. Quadratic Probing suffers from both primary and secondary clustering. true or false?
answered
in
Programming in C
Jan 7, 2021
4.6k
views
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:...