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 chinmay_rajpurohit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by chinmay_rajpurohit
9
answers
1
GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$
answered
in
Operating System
Nov 10, 2023
19.3k
views
gate1998
operating-system
virtual-memory
easy
ugcnetcse-june2012-paper3
2
answers
2
Find total Subnet and hosts
If the IP is 193.1.2.3 and Subnet Mask is 255.255.255.240. How many numbers of subnets and hosts possible in each subnet are: 14,16 14,14 16,14 16,16
commented
in
Computer Networks
Oct 23, 2023
2.6k
views
computer-networks
subnetting
11
answers
3
GATE IT 2004 | Question: 50
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by $\text{20%}$ and the speed of a fixed point unit has been increased by $\text{10%}$. What is the overall speedup achieved if the ratio of the number of ... to take twice the time taken by the fixed point operation in the original design? $1.155$ $1.185$ $1.255$ $1.285$
commented
in
CO and Architecture
Oct 3, 2023
18.9k
views
gateit-2004
normal
co-and-architecture
speedup
1
answer
4
Rice theorem
s Rice theorem says any non-trivial property of a language is Undecidable. Then how is above one REL. Does it mean we cannot say anything for a trivial property?
commented
in
Theory of Computation
May 5, 2023
2.0k
views
theory-of-computation
rice-theorem
4
answers
5
GATE CSE 2006 | Question: 5
For which one of the following reasons does internet protocol(IP) use the time-to-live(TTL) field in IP datagram header? Ensure packets reach destination within that time Discard packets that reach later than that time Prevent packets from looping indefinitely Limit the time for which a packet gets queued in intermediate routers
commented
in
Computer Networks
May 4, 2023
11.3k
views
gatecse-2006
computer-networks
ip-addressing
ip-packet
easy
6
answers
6
GATE CSE 2003 | Question: 83
A $2$ $km$ long broadcast LAN has $10^7$ bps bandwidth and uses CSMA/CD. The signal travels along the wire at $2 \times 10^8$ m/s. What is the minimum packet size that can be used on this network? $50$ $\text{bytes}$ $100$ $\text{bytes}$ $200$ $\text{bytes}$ None of the above
commented
in
Computer Networks
May 4, 2023
13.5k
views
gatecse-2003
computer-networks
lan-technologies
normal
8
answers
7
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$
commented
in
Computer Networks
Apr 22, 2023
15.4k
views
gateit-2008
computer-networks
normal
error-detection
1
answer
8
#Memory Management #Paging #GATE
Consider a system which has LAS = PAS = ‘s’ bytes, page size is p bytes,Page table entry size is ‘e’ bytes Memory is byte addressable. Then what is the optimal value of page size by minimizing the memory overhead of maintaining the page table and internal fragmentation in paging?
answered
in
Operating System
Apr 3, 2023
454
views
paging
1
answer
9
Fork() system call.
main(){ int i,n; for(int i=0;i<n;i++){ fork(); printf("*"); } } How many times ‘*’ will be printed? The answer is not 2^n ? why?
commented
in
Operating System
Mar 23, 2023
476
views
programming-in-c
operating-system
1
answer
10
#Operating system question #cpu scheduling
Consider arrival time and execution time for the following process:- P.id A.T B.T 1 2 5 2 7 9 3 8 3 4 10 4 Assume, each context switch requires 1ms time (excluding first and last context switch).then solve it using SRTF(shortest remaining time first)
commented
in
Operating System
Mar 20, 2023
1.7k
views
operating-system
process-scheduling
context-switch
1
answer
11
functional dependency
given an instance of relation R(ABC). find all non-trivial FDsare AB->C, AC->B, BC→ A true ??
answered
in
Databases
Mar 18, 2023
650
views
database-normalization
1
answer
12
#dbms #normalisation
2NF , 3NF, BCNF decomposition allowed if lossless and dependency preserving , both conditions must preserve. Otherwise given decomposition wrong for normal forms. Is this statement correct????
commented
in
Databases
Mar 6, 2023
621
views
databases
0
answers
13
Ace workbook dbms
commented
in
Databases
Feb 28, 2023
306
views
databases
rdbms
ace-booklet
2
answers
14
When is a group of attributes prime?
Given the candidate keys CD and DE and the functional dependency AB->CDE. Is CDE considered prime because all attributes (C, D and E) are prime? Or is it non-prime because CDE is not found in a candidate key as a whole? Therefore, my question is if a group of prime attributes is also prime due to its attributes or it has to be part of a candidate key as well.
answered
in
Databases
Feb 26, 2023
692
views
functional-dependency
databases
10
answers
15
GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
commented
in
Databases
Dec 20, 2022
8.1k
views
gate1998
databases
relational-algebra
normal
descriptive
4
answers
16
GATE CSE 2005 | Question: 75
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-to-many and $R_2$ is many-to-many. $R_1$ and $R_2$ do not have ... of their own. What is the minimum number of tables required to represent this situation in the relational model? $2$ $3$ $4$ $5$
commented
in
Databases
Dec 20, 2022
18.3k
views
gatecse-2005
databases
er-diagram
normal
4
answers
17
GATE CSE 2003 | Question: 58
Consider the translation scheme shown below. $S \rightarrow T\;R$ $R \rightarrow + T \{\text{print}( +');\} R\mid \varepsilon$ $T \rightarrow$ num $\{\text{print}$(num.val)$;\}$ Here num is a token that represents an integer and num.val represents the corresponding integer value. For an ... scheme will print $9 + 5 + 2$ $9 \ 5 + 2 +$ $9 \ 5 \ 2 + +$ $+ + 9 \ 5 \ 2$
commented
in
Compiler Design
Dec 17, 2022
12.6k
views
gatecse-2003
compiler-design
grammar
normal
2
answers
18
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$
commented
in
Theory of Computation
Dec 2, 2022
2.9k
views
gate1988
descriptive
theory-of-computation
finite-automata
difficult
3
answers
19
GATE IT 2007 | Question: 78
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
commented
in
Digital Logic
Nov 29, 2022
4.7k
views
gateit-2007
digital-logic
k-map
normal
9
answers
20
GATE CSE 2019 | Question: 25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
answered
in
Algorithms
Oct 20, 2022
19.2k
views
gatecse-2019
numerical-answers
algorithms
algorithm-design
1-mark
3
answers
21
GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
commented
in
Operating System
Jun 22, 2021
10.9k
views
gatecse-2001
operating-system
disk
normal
descriptive
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:...