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 Shimpy Goyal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Shimpy Goyal
2
answers
1
what should b lower bound if not given i consider (0 ,0) but no option then how to procedd here?
Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575
commented
in
DS
Jun 27, 2015
904
views
1
answer
2
how to find without edge?
A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph ? (A) 5 (B) n – 3 (C) 20 (D) 11
answer selected
in
Graph Theory
Jun 27, 2015
1.8k
views
2
answers
3
y not a? many time confuse in this kind of questions
Manager’s salary details are hidden from the employee. This is called as (A) Conceptual level data hiding (B) Physical level data hiding (C) External level data hiding (D) Local level data hiding
commented
in
Databases
Jun 27, 2015
634
views
databases
1
answer
4
plz dont say google it i already did but sm tech prob in my system it only downloading eco subject not computer science
commented
in
Others
Jun 27, 2015
391
views
4
answers
5
UGC NET CSE | June 2014 | Part 2 | Question: 33
Consider a system with five processes $P_{0}$ through $P_{4}$ and three resource types $R_{1}$, $R_{2}$ and $R_{3}$ . Resource type $R_{1}$ has $10$ instances, $R_{2}$ has $5$ instances and $R_{3}$ has ... $R_{3}$. The state resulting after this allocation will be Ready state Safe state Blocked state Unsafe state
commented
in
Operating System
Jun 27, 2015
4.3k
views
ugcnetcse-june2014-paper2
operating-system
resource-allocation
1
answer
6
UGC NET CSE | June 2013 | Part 2 | Question: 33
Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE BUTAEEZ SUZANNE XYZABCD ABCDXYZ
commented
in
Computer Networks
Jun 27, 2015
9.6k
views
computer-networks
network-security
rsa
ugcnetcse-june2013-paper2
1
answer
7
wts shortcut to solve this kind of question
Consider a set A = {1, 2, 3, …….., 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5 ? (A) 533 (B) 599 (C) 467 (D) 66
answer selected
in
Probability
Jun 27, 2015
3.2k
views
1
answer
8
wts mean of this statement??
In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
commented
in
Digital Logic
Jun 27, 2015
603
views
2
answers
9
UGC NET CSE | December 2012 | Part 3 | Question: 39
When a programming language has the capacity to produce new datatype, it is called as, Overloaded Language Extensible Language Encapsulated Language Abstraction Language
asked
in
Programming
Jun 27, 2015
1.2k
views
programming
ugcnetcse-dec2012-paper3
3
answers
10
UGC NET CSE | June 2014 | Part 2 | Question: 48
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order
commented
in
Databases
Jun 27, 2015
3.4k
views
ugcnetcse-june2014-paper2
databases
indexing
3
answers
11
UGC NET CSE | June 2014 | Part 2 | Question: 40
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by $( ( ) \; ( ( ) ) \; ( ( ) ) )$ $2$ $3$ $4$ $5$
asked
in
DS
Jun 27, 2015
7.1k
views
ugcnetcse-june2014-paper2
data-structures
stack
6
answers
12
UGC NET CSE | December 2013 | Part 2 | Question: 49
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size? 332.8 KB 83.6 KB 266.2 KB 256.6 KB
commented
in
Operating System
Jun 27, 2015
4.9k
views
operating-system
disk
ugcnetcse-dec2013-paper2
3
answers
13
UGC NET CSE | December 2013 | Part 2 | Question: 43
Which of the following is widely used inside the telephone system for long-haul data traffic? ISDN ATM Frame Relay ISTN
asked
in
Computer Networks
Jun 26, 2015
2.5k
views
ugcnetcse-dec2013-paper2
computer-networks
1
answer
14
UGC NET CSE | December 2013 | Part 2 | Question: 36
How many edges are there in a forest of t-trees containing a total of n vertices ? n + t n – t n ∗ t nt
asked
in
Graph Theory
Jun 26, 2015
3.1k
views
ugcnetcse-dec2013-paper2
data-structures
tree
1
answer
15
UGC NET CSE | December 2013 | Part 2 | Question: 11
The student marks should not be greater than 100. This is Integrity constraint Referential constraint Over-defined constraint Feasible constraint
asked
in
Databases
Jun 26, 2015
2.5k
views
databases
database-constraints
ugcnetcse-dec2013-paper2
2
answers
16
UGC NET CSE | June 2013 | Part 2 | Question: 39
Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise? ... $(p \vee r \wedge q) \vee (p \wedge q \wedge r) \vee (\rceil p \wedge q \wedge r)$
commented
in
Mathematical Logic
Jun 26, 2015
3.1k
views
ugcnetcse-june2013-paper2
1
answer
17
kindly reply soon
Q-> what will the cipher text produced by the following cipher function for the plain test ISRO with key =7.[consider 'A'=0,'B'=1...'Z'=25] CK(M)=(kM+13)mod26 a)RJCH b)QIBG c)GQPM d) XPIN
commented
in
Computer Networks
Jun 26, 2015
618
views
network-security
2
answers
18
ISRO2015-21
If $\text{D}_1,\text{D}_2, \dots \text{D}_n$ are domains in a relational model, then the relation is a table, which is a subset of $\text{D}_1 \oplus \text{D}_2 \oplus \dots \oplus \text{D}_n$ $\text{D}_1 \times \text{D}_2 \times \dots \times \text{D}_n$ $\text{D}_1 \cup \text{D}_2 \cup \dots \cup \text{D}_n$ $\text{D}_1 \cap \text{D}_2 \cap \dots \cap \text{D}_n$
commented
in
Databases
Jun 26, 2015
4.0k
views
databases
isro2015
relational-model
5
answers
19
UGC NET CSE | December 2012 | Part 2 | Question: 18
Given the following expressions of a grammar $E \rightarrow E * F / F + E / F$ $F \rightarrow F – F / id$ Which of the following is true? $*$ has the higher precedence than + - has the higher precedence than $*$ + and – have same precedence + has the higher precedence than $*$
commented
in
Compiler Design
Jun 24, 2015
1.4k
views
ugcnetcse-dec2012-paper2
compiler-design
parsing
1
answer
20
how to solve it
Q> How much speed do we gain by using the cache,when cache is used 80% of the time? assume cache is faster than main memory. a)5.27 b)2.00 c)4.16 d)6.09
commented
in
CO and Architecture
Jun 24, 2015
597
views
9
answers
21
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
commented
in
Computer Networks
Jun 24, 2015
18.6k
views
gatecse-2015-set2
computer-networks
ip-packet
normal
3
answers
22
UGC NET CSE | December 2012 | Part 2 | Question: 50
Given a Relation POSITION (Posting-No, Skill), then the query to retrieve all distinct pairs of posting-nos. requiring skill is Select p.posting-No, p.posting-No from position p where p.skill=p.skill and p.posting-No < p.posting-No Select p$_1$. ... p$_1$, position p$_2$ where p$_1$.skill=p$_2$.skill and p$_1$.posting.No = p$_2$.posting-No
commented
in
Databases
Jun 24, 2015
2.4k
views
ugcnetcse-dec2012-paper2
databases
sql
4
answers
23
UGC NET CSE | December 2012 | Part 2 | Question: 25
Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to $4$ other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if none ... out the letter? $122$ & $22$ $111$ & $11$ $133$ & $33$ $144$ & $44$
asked
in
DS
Jun 23, 2015
5.3k
views
ugcnetcse-dec2012-paper2
tree
6
answers
24
GATE IT 2008 | Question: 41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
commented
in
Operating System
Jun 22, 2015
16.2k
views
gateit-2008
operating-system
page-replacement
normal
3
answers
25
UGC NET CSE | December 2012 | Part 2 | Question: 1
Consider the circuit shown below. IN a certain steady state, ‘Y’ is at logical ‘l’. What are the possible values of A, B, C? A=0, B=0, C=1 A=0, B=C=1 A=1, B=C=0 A= B=1, C=1
commented
in
Digital Logic
Jun 21, 2015
3.1k
views
ugcnetcse-dec2012-paper2
digital-logic
circuit-output
11
answers
26
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
commented
in
Digital Logic
Jun 21, 2015
36.1k
views
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
2
answers
27
GATE IT 2006 | Question: 42
A cache line is $64$ bytes. The main memory has latency $32$ $ns$ and bandwidth $1$ $GBytes/s$. The time required to fetch the entire cache line from the main memory is: $32$ $ns$ $64$ $ns$ $96$ $ns$ $128$ $ns$
commented
in
CO and Architecture
Jun 21, 2015
9.5k
views
gateit-2006
co-and-architecture
cache-memory
normal
10
answers
28
GATE CSE 2007 | Question: 80
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50 \times 50$ two-dimensional array of bytes is stored in the main ... data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$
commented
in
CO and Architecture
Jun 21, 2015
24.2k
views
gatecse-2007
co-and-architecture
cache-memory
normal
3
answers
29
GATE IT 2007 | Question: 37
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order $3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24.$ Which of the following memory blocks will not be in the cache at the end of the sequence ? $3$ $18$ $20$ $30$
commented
in
CO and Architecture
Jun 20, 2015
6.0k
views
gateit-2007
co-and-architecture
cache-memory
normal
12
answers
30
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
commented
in
Operating System
Jun 20, 2015
18.7k
views
gate1997
operating-system
process-synchronization
normal
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2