Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
girish13
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by girish13
1
answer
1
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)? Assume one bit storage per pixel and starting pixel location is at 0. 1) 1016 2)1006 3) 610 4)616
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)?...
447
views
commented
May 6, 2022
Programming in C
data-structures
array
+
–
0
answers
2
Got AIR 1012 in Gate cse 2022 but Gate Score is 640, what are the possibilities ?
432
views
commented
Mar 26, 2022
1
answer
3
Gate Applied Test Series
Question: Consider a system using a segmented paging architecture. The segment is divided into 8k pages each of size 2k words . The segment table is divided into 256 k pages each of size 512 words. The page table entry size requires 64 bits . The frame number requires 22 bits ... address (LA). Note: 1 Word = 1 Byte Options Are: A. 51 bits B. 61 bits C. 33 bits D. 64 bits
Question: Consider a system using a segmented paging architecture. The segment is divided into 8k pages each of size 2k words . The segment table is divided into 256 k p...
1.2k
views
commented
Feb 20, 2022
Operating System
operating-system
segmentation
memory-management
+
–
1
answer
4
Context Sensitive Grammars
Is the following CSG for a^n b^n c^n correct? S->aSbC|abc Cb->bC C->c If not please explain why?
Is the following CSG for a^n b^n c^n correct?S->aSbC|abcCb->bCC->cIf not please explain why?
1.6k
views
answered
Feb 1, 2022
Theory of Computation
theory-of-computation
context-sensitive
+
–
0
answers
5
Self made doubt
suppose we are given the congestion window 30KB and TO occurs than new th=15 and mss given =2 so when we start with slow start than sequence goes like:- 2 → 4 → 8 → 15 → 17 and so on or 2 → 4 → 8 → 14 → 16 → 18 and so on?
suppose we are given the congestion window 30KB and TO occurs than new th=15 and mss given =2 so when we start with slow start than sequence goes like:-2 → 4 → 8 → ...
252
views
commented
Jan 15, 2022
0
answers
6
DBMS ER Diagram from Made. Easy Test Series Gate 2022
What i got is 4 table of RDBMS is required but given answer is 2
What i got is 4 table of RDBMS is required but given answer is 2
352
views
commented
Jan 15, 2022
2
answers
7
Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
Question The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)
1.0k
views
answered
Jan 14, 2022
Programming in C
binary-heap
data-structures
heap-sort
time-complexity
+
–
1
answer
8
NIELIT 2021 Dec Scientist A - Section B: 49
In an $\text{ER}$ Diagram, a double ellipse is used to represent : Simple Attribute Composite Attribute Descriptive Attribute Multi-valued Attribute
In an $\text{ER}$ Diagram, a double ellipse is used to represent :Simple AttributeComposite AttributeDescriptive AttributeMulti-valued Attribute
402
views
answered
Jan 14, 2022
Others
nielit2021dec-scientista
+
–
2
answers
9
made easy test series - instruction format
Consider a hypothetical CPU which supports 16-bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instructions which use register references and 12 1-address memory reference instructions then how many 0-address instructions are possible?
Consider a hypothetical CPU which supports 16-bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instructions which use register references ...
601
views
answered
Jan 14, 2022
CO and Architecture
co-and-architecture
instruction-format
made-easy-test-series
+
–
1
answer
10
made easy test series - group theory
Let G be a group of 52 elements. The largest possible size of a subgroup of G other than G itself is ____.
Let G be a group of 52 elements. The largest possible size of a subgroup of G other than G itself is ____.
701
views
answered
Jan 12, 2022
Set Theory & Algebra
made-easy-test-series
group-theory
+
–
2
answers
11
made easy test series - deadlock - operating systems
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. The minimum value of ‘m’ that will ensure that deadlock will never occur is _____.
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. T...
949
views
answered
Jan 12, 2022
Operating System
operating-system
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
1
answer
12
Made easy test
i=10 j=1 a=i*j b=i+j if a<=b goto 3 else goto 8 a=a+1 i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the above code?
i=10j=1a=i*jb=i+jif a<=b goto 3else goto 8a=a+1i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the...
1.9k
views
commented
Dec 29, 2021
Compiler Design
compiler-design
intermediate-code
made-easy-test-series
+
–
2
answers
13
NPTEL Assignment Question
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}. What is the value of deg(v1)+ deg(v2) + · · · + deg(v30)? 300 600 900 None of these
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}.What is the value of deg(v1)+ de...
835
views
answered
Dec 9, 2021
Algorithms
nptel-quiz
graph-algorithm
+
–
1
answer
14
made easy
Which of the following is/are correct? Circuit Switching is Store and Forward technique. Packet Switching is faster than Circuit Switching. Packet Switching wastes less resource than Circuit Switching. Packet Switching is not a Store and Forward technique.
Which of the following is/are correct?Circuit Switching is Store and Forward technique.Packet Switching is faster than Circuit Switching.Packet Switching wastes less reso...
337
views
answered
Dec 6, 2021
1
answer
15
Demand Paging
Is this statement correct? " Demad paging can bring entire process into memory at load time" How it is correct? If it is, then anybody can explain it please.
Is this statement correct? " Demad paging can bring entire process into memory at load time"How it is correct? If it is, then anybody can explain it please.
1.2k
views
answered
Dec 6, 2021
Operating System
made-easy-test-series
+
–
1
answer
16
IITB Practice Set: 26
Consider a filesystem in which an inode of a file contains pointers to $12$ direct blocks, one single indirect block, and one double indirect block. The block size in the system is $64$ ... numbers (pointers) and no other metadata. What is the maximum size of a file (in blocks) that can be stored in this filesystem?
Consider a filesystem in which an inode of a file contains pointers to $12$ direct blocks, one single indirect block, and one double indirect block. The block size in the...
254
views
answer edited
Dec 5, 2021
Others
iitb-practice-set
+
–
1
answer
17
NPTEL Assignment
Assume that a read request takes 50 nsec on a cache miss and 5 nsec on a cache hit. While running a program, it is observed that 80% of the processor’s read requests result in a cache hit. The average read access time is ………….. nsec.
Assume that a read request takes 50 nsec on a cache miss and 5 nsec on a cache hit. While running a program, it is observed that 80% of the processor’s read requests re...
268
views
answered
Dec 5, 2021
CO and Architecture
nptel-quiz
co-and-architecture
effective-memory-access
+
–
1
answer
18
Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...
2.2k
views
commented
Dec 3, 2021
Theory of Computation
testbook-test-series
number-of-dfa
finite-automata
+
–
1
answer
19
UGC NET CSE | December 2019 | Part 2 | Question: 98
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functionality dependency set $F$ ... relation $R$ belong to $1 \text{ NF}$ $2 \text{ NF}$ $3 \text{ NF}$ $\text{BCNF}$
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functional...
1.1k
views
answered
May 29, 2021
Others
ugcnetcse-dec2019-paper2
+
–
2
answers
20
UGC NET CSE | December 2019 | Part 2 | Question: 11
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used ... The address space is of $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text...
1.5k
views
answered
May 28, 2021
Others
ugcnetcse-dec2019-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register