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 _shashi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by _shashi
3
answers
1
GATE CSE 2010 | Question: 33
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ... $13$ $15$ $17$ $19$
commented
in
CO and Architecture
Jan 24, 2021
22.2k
views
gatecse-2010
co-and-architecture
pipelining
normal
7
answers
2
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
comment edited
in
Operating System
Dec 29, 2020
37.4k
views
gatecse-2013
operating-system
virtual-memory
normal
5
answers
3
GATE CSE 2009 | Question: 39
In quick-sort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time complexity of the quick sort? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
commented
in
Algorithms
Jan 17, 2020
21.2k
views
gatecse-2009
algorithms
sorting
normal
8
answers
4
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
commented
in
DS
Jan 14, 2020
23.1k
views
gatecse-2005
data-structures
tree
normal
19
answers
5
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
Jan 4, 2020
63.6k
views
gatecse-2004
co-and-architecture
virtual-memory
normal
3
answers
6
GATE CSE 2010 | Question: 8
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is $(C3D8)_{16}$ $(187B)_{16}$ $(F878)_{16}$ $(987B)_{16}$
commented
in
Digital Logic
Jan 3, 2020
16.3k
views
gatecse-2010
digital-logic
number-representation
normal
11
answers
7
GATE CSE 2015 Set 3 | Question: 26
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptr-p, **ptr); } The output of the program is _______.
commented
in
Programming in C
Dec 25, 2019
22.4k
views
gatecse-2015-set3
programming
programming-in-c
normal
numerical-answers
pointers
1
answer
8
SELF DOUBT
In Single Precision floating point number when E=0 and M not equals to 0 it represents a fractional form..(BiAS=+127) when writing the decimal form why do we right (-1)^S * (1.M) * 2^(-126) instead of (-1)^S * (1.M) * 2^(-127)??
answered
in
Digital Logic
Feb 11, 2019
483
views
digital-logic
number-representation
ieee-representation
floating-point-representation
self-doubt
9
answers
9
GATE CSE 2019 | Question: 27
Consider the following C program: #include <stdio.h> int r() { static int num=7; return num--; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; } Which one of the following values will be displayed on execution of the programs? $41$ $52$ $63$ $630$
commented
in
Programming in C
Feb 7, 2019
27.2k
views
gatecse-2019
programming-in-c
programming
2-marks
6
answers
10
GATE CSE 2019 | Question: 24
Consider the following C program: #include <stdio.h> int main() { int arr[]={1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5}, *ip=arr+4; printf(“%d\n”, ip[1]); return 0; } The number that will be displayed on execution of the program is _______
answered
in
Programming in C
Feb 7, 2019
13.4k
views
gatecse-2019
numerical-answers
programming-in-c
programming
array
easy
1-mark
0
answers
11
Gate 2019 C Programming
What will be the final output : #include <stdio.h> int r(){ static int num=7; return num--; } int main(){ for(r();r();r()) { printf("%d ",r()); } return 0; } A)63 B)41 C)52 D)630
asked
in
Programming in C
Feb 7, 2019
2.7k
views
programming-in-c
output
1
answer
12
Efficiency of Stop-and-Wait, Selective Reject and Go-Back-N ARQ when error probability is p
Hi Guys, Do you know formula for efficiency of Stop-and-Wait, Selective Reject and Go-Back-N ARQ when error probability is p ? PS: Although i am mentioning the link for answer but if you want to add some ... info.(or some more elegant proof for the formula) then it will be really helpful for all readers. :)
commented
in
CO and Architecture
Jan 5, 2019
2.3k
views
computer-networks
sliding-window
stop-and-wait
go-back-n
1
answer
13
what is the difference between *b[10] and (*b)[10]
what is the difference between *b[10] and (*b)[10] ?
commented
in
Programming in C
Jan 27, 2018
658
views
programming-in-c
4
answers
14
What is the difference between order and degree of a B-tree
What is the difference between order and degree of a B-tree are they same or different
commented
in
Programming in C
Jan 27, 2018
13.1k
views
2
answers
15
Co & Arch
comment edited
in
CO and Architecture
Jan 21, 2018
485
views
co-and-architecture
pipelining
0
answers
16
Kindly clear few queries regarding Automata theory !
I'm studying through Linz and Have few confusions : Let $\sum = {a, b} then \sum ^{\bigstar} = \epsilon ,a,b,aa,ab,ba,bb,aaa,aab,..... Here can we take ba ? I mean placing doesn't matter ?$ On page 74 second para its ... (v) = nb (v) , where v is any prefix of w } . I'm not getting this whole notation ,please explain thank you !
commented
in
Theory of Computation
Jan 17, 2018
388
views
theory-of-computation
context-free-grammar
0
answers
17
What will be the output of this C program
What will be the output of following programs : void fun1(struct node* head) { for(head == NULL) { return; } fun1(head->next); printf("%d ", head->data); } And this one ! void fun1(struct node* head) { while(head == NULL) { return; } fun1(head->next); printf("%d ", head->data); }
commented
in
Programming in C
Jan 16, 2018
1.8k
views
programming-in-c
linked-list
4
answers
18
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}$
comment edited
in
Programming in C
Dec 23, 2017
13.8k
views
gatecse-2012
programming
programming-in-c
normal
14
answers
19
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
commented
in
Operating System
Dec 12, 2017
76.2k
views
gatecse-2008
operating-system
virtual-memory
normal
1
answer
20
right and left quotient in regular language
how to find L1/L2 for some L1 and L2 (is diagram making must ) how to conclude that L1 is divisible or not divisible by L2
commented
in
Theory of Computation
Nov 14, 2017
14.9k
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:...