menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Others
(1.1k)
Study Resources
(143)
GATE Application
(40)
Revision
(40)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent questions and answers in Others
Recent Blog Comments
yeah right!
@atulbrk IISc is mentioned only...
@nephron Please share the link of the PDF of the...
I think The JEST website rercently updated the...
hi this pdf have gate prevoius year questions or...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent questions and answers in Others
0
votes
1
answer
1
UGCNET-June2007-II: 27
Which of the following techniques are used to control data flow? Windowing Routing RPCs Buffering $1,4$ $2,3,4$ $1,3,4$ $1,2,3,4$
Which of the following techniques are used to control data flow? Windowing Routing RPCs Buffering $1,4$ $2,3,4$ $1,3,4$ $1,2,3,4$
answered
Dec 8, 2020
in
Others
wander
48
views
ugcnetjune2007ii
0
votes
1
answer
2
UGCNET-Dec2004-II: 48
The cost of a parallel processing is primarily determined by : Time complexity Switching complexity Circuit complexity None of the above
The cost of a parallel processing is primarily determined by : Time complexity Switching complexity Circuit complexity None of the above
answered
Dec 1, 2020
in
Others
Prince Verma 1
88
views
ugcnetdec2004ii
1
vote
1
answer
3
TIFR2020-B-14
The figure below describes the network of streets in a city where Motabhai sells $\text{pakoras}$ from his cart. The number next to an edge is the time (in minutes) taken to traverse the corresponding street. At present, the cart is required to start at point $s$ and, after visiting ... $s, t, b$ and $f$ are the only odd degree nodes in the figure above. $430$ $440$ $460$ $470$ $480$
The figure below describes the network of streets in a city where Motabhai sells $\text{pakoras}$ from his cart. The number next to an edge is the time (in minutes) taken to traverse the corresponding street. At present, the cart is required to start at point $s$ and, after visiting each street ... : $s, t, b$ and $f$ are the only odd degree nodes in the figure above. $430$ $440$ $460$ $470$ $480$
answered
Nov 24, 2020
in
Others
Deepakk Poonia (Dee)
231
views
tifr2020
0
votes
1
answer
4
UGCNET-June2006-II: 16
A relation $R=${${A,B,C,D,E,F}$} is given with following set of functional dependencies: $F=${${A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E}$} Which of the following is candidate key? $A$ $AC$ $AD$ None of these
A relation $R=${${A,B,C,D,E,F}$} is given with following set of functional dependencies: $F=${${A\rightarrow B, AD\rightarrow C,B\rightarrow F,A\rightarrow E}$} Which of the following is candidate key? $A$ $AC$ $AD$ None of these
answered
Nov 14, 2020
in
Others
Bhargav D Dave 6
27
views
ugcnetjune2006ii
0
votes
1
answer
5
UGCNET-Dec2005-II: 38
Which of the following checks cannot be carried out on the input data to a system ? Consistency check Syntax check Range check All the above
Which of the following checks cannot be carried out on the input data to a system ? Consistency check Syntax check Range check All the above
answered
Nov 14, 2020
in
Others
Bhargav D Dave 6
32
views
ugcnetdec2005ii
0
votes
1
answer
6
UGCNET-Dec2005-II: 32
A Top - down Parse generates Left most derivation Right - most derivation in reverse Right most derivation Left most derivation in reverse
A Top - down Parse generates Left most derivation Right - most derivation in reverse Right most derivation Left most derivation in reverse
answered
Nov 14, 2020
in
Others
Bhargav D Dave 6
43
views
ugcnetdec2005ii
0
votes
1
answer
7
UGCNET-June-2019-I-4
Which of the following statements explains the concepts of inclusive teaching? Teacher facilitates the learning of the gifted students Teacher facilitates the learning of the weak students Teacher takes support of parents of the students to make them learn Teacher makes the students of different backgrounds to learn together in the same class
Which of the following statements explains the concepts of inclusive teaching? Teacher facilitates the learning of the gifted students Teacher facilitates the learning of the weak students Teacher takes support of parents of the students to make them learn Teacher makes the students of different backgrounds to learn together in the same class
answered
Nov 9, 2020
in
Others
praveenjan1990
132
views
ugcnetjune2019-i
general-awareness
2
votes
3
answers
8
UGCNET-June2013-II: 42
A Boolean operator $\ominus$ is defined as follows: 1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1 What will be the truth value of the expression (x $\ominus$ y ) $\ominus$ z = x $\ominus$ (y $\ominus$ z)? Always true Always false Sometimes true True when x,y, z are all true
A Boolean operator $\ominus$ is defined as follows: 1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1 What will be the truth value of the expression (x $\ominus$ y ) $\ominus$ z = x $\ominus$ (y $\ominus$ z)? Always true Always false Sometimes true True when x,y, z are all true
answered
Nov 5, 2020
in
Others
Lakshman Patel RJIT
1.4k
views
ugcnetjune2013ii
1
vote
1
answer
9
UGCNET-dec2008-ii-50
(I) Each object in the active directory of windows 2000 has an access control list. (II) The scheme is a blueprint of all objects in the domain of windows 2000. Which of the following is true? only (I) only (II) both (I) and (II) None of the above
(I) Each object in the active directory of windows 2000 has an access control list. (II) The scheme is a blueprint of all objects in the domain of windows 2000. Which of the following is true? only (I) only (II) both (I) and (II) None of the above
answered
Oct 24, 2020
in
Others
VIDYADHAR SHELKE 1
240
views
ugcnetdec2008ii
windows
0
votes
2
answers
10
UGCNET-June2007-II: 16
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$ locking Protocol donot. None of these
Which of the following statements is wrong? $2-$ phase Locking Protocols suffer from dead locks. Time-Stamp Protocols suffer from more aborts. Time-Stamp Protocols suffer from cascading roll back where as $2-$ locking Protocol donot. None of these
answered
Oct 21, 2020
in
Others
VIDYADHAR SHELKE 1
188
views
ugcnetjune2007ii
0
votes
1
answer
11
UGCNET-June2006-II: 23
Which of the following statement is false? Every tree is a bipartite graph A tree contains a cycle A tree with $n$ nodes contains $(n-1)$ edges A tree is connected graph
Which of the following statement is false? Every tree is a bipartite graph A tree contains a cycle A tree with $n$ nodes contains $(n-1)$ edges A tree is connected graph
answered
Oct 1, 2020
in
Others
VIDYADHAR SHELKE 1
97
views
ugcnetjune2006ii
14
votes
1
answer
12
READ IT ONCE
Hi everyone. I kindly request all the people who don't find this relevant please ignore this post and follow yourself just read it once it may be helpful. It's 4 and we all are going to appear for the GATE paper on 6, so i felt to talk something about what i ... AGE JEET HAI " And we all are going to win our fear this time only. revise hard and just go, WIsh YoU BEst Of Luck .
Hi everyone. I kindly request all the people who don't find this relevant please ignore this post and follow yourself just read it once it may be helpful. It's 4 and we all are going to appear for the GATE paper on 6, so i felt to talk something about what i felt is ... KE AGE JEET HAI " And we all are going to win our fear this time only. revise hard and just go, WIsh YoU BEst Of Luck .
answered
Aug 28, 2020
in
Others
nocturnal123
416
views
study-resources
0
votes
1
answer
13
UGCNET-Dec2005-II: 48
Analysis of large database to retrive information is called : $OLTP$ $LAP$ $OLDP$ $TLPP$
Analysis of large database to retrive information is called : $OLTP$ $LAP$ $OLDP$ $TLPP$
answered
Aug 23, 2020
in
Others
nocturnal123
55
views
ugcnetdec2005ii
0
votes
1
answer
14
UGCNET-Dec2005-II: 41
The testing of software against $SRS$ is called : Acceptance testing Integration testing Regression testing Series testing
The testing of software against $SRS$ is called : Acceptance testing Integration testing Regression testing Series testing
answered
Aug 23, 2020
in
Others
nocturnal123
52
views
ugcnetdec2005ii
0
votes
1
answer
15
UGCNET-June2006-II: 47
Bluetooth technology uses the transmission media. Radio links Microwave links $VSAT$ communication Optical fibre links
Bluetooth technology uses the transmission media. Radio links Microwave links $VSAT$ communication Optical fibre links
answered
Aug 23, 2020
in
Others
nocturnal123
86
views
ugcnetjune2006ii
0
votes
1
answer
16
UGCNET-Dec2005-II: 34
Which of the following is not collision Resolution Technique : Hash addressing Chainning Indexing None of these
Which of the following is not collision Resolution Technique : Hash addressing Chainning Indexing None of these
answered
Aug 23, 2020
in
Others
nocturnal123
59
views
ugcnetdec2005ii
0
votes
1
answer
17
UGCNET-June2006-II: 39
_______synchronize critical resources to prevent deadlock. $P$- operator $V$- operator Semaphores Hard disk
_______synchronize critical resources to prevent deadlock. $P$- operator $V$- operator Semaphores Hard disk
answered
Aug 23, 2020
in
Others
nocturnal123
57
views
ugcnetjune2006ii
0
votes
1
answer
18
UGCNET-June2006-II: 35
The dynamic binding occurs during the: Compile time Run time Linking time Pre-processing time
The dynamic binding occurs during the: Compile time Run time Linking time Pre-processing time
answered
Aug 23, 2020
in
Others
nocturnal123
214
views
ugcnetjune2006ii
0
votes
1
answer
19
UGCNET-June2006-II: 33
$YACC$ builds up _____parsing table. $LALR$ $LR$ $SLR$ $LLR$
$YACC$ builds up _____parsing table. $LALR$ $LR$ $SLR$ $LLR$
answered
Aug 23, 2020
in
Others
nocturnal123
59
views
ugcnetjune2006ii
0
votes
1
answer
20
UGCNET-June2006-II: 31
Which statements is wrong If linked origin $\neq$ translated origin, relocation must be performed by the linker If load $\neq$ linked origin, the loader must perform relocation A linker always perform relocation, whereas some loaders do not None of these
Which statements is wrong If linked origin $\neq$ translated origin, relocation must be performed by the linker If load $\neq$ linked origin, the loader must perform relocation A linker always perform relocation, whereas some loaders do not None of these
answered
Aug 23, 2020
in
Others
nocturnal123
482
views
ugcnetjune2006ii
0
votes
1
answer
21
UGCNET-June2007-II: 44
Problems with waterfall model are: Real projects rarely follow this model proposes It is often difficult for the customer Working model is available only in the end Developers are delayed unnecessarily Which of the following is true: $1$ and $4$ only $2$ and $3$ only $1$,$2$ and $3$ only $1$,$2$,$3$ and $4$
Problems with waterfall model are: Real projects rarely follow this model proposes It is often difficult for the customer Working model is available only in the end Developers are delayed unnecessarily Which of the following is true: $1$ and $4$ only $2$ and $3$ only $1$,$2$ and $3$ only $1$,$2$,$3$ and $4$
answered
Aug 23, 2020
in
Others
nocturnal123
50
views
ugcnetjune2007ii
0
votes
1
answer
22
UGCNET-Dec2007-II: 10
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is : $CMOS$ $DTL$ $TTL$ $ECL$
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is : $CMOS$ $DTL$ $TTL$ $ECL$
answered
Aug 23, 2020
in
Others
nocturnal123
57
views
ugcnetdec2007ii
0
votes
1
answer
23
KPGCET-CSE-2019-66
The running time of using two-way merge-sort technique to sort a file of $n>1$ record is $2T (n/2) + \theta (n)$ $\text{lg}(n) + \theta(n)$ $\theta (n)$ $O(n)$
The running time of using two-way merge-sort technique to sort a file of $n>1$ record is $2T (n/2) + \theta (n)$ $\text{lg}(n) + \theta(n)$ $\theta (n)$ $O(n)$
answered
Aug 21, 2020
in
Others
nocturnal123
39
views
kpgcet-cse-2019
0
votes
1
answer
24
UGCNET-June2005-II: 38
Banker's algorithm is for Dead lock Prevention Dead lock Avoidance Dead lock Detection Dead lock creation
Banker's algorithm is for Dead lock Prevention Dead lock Avoidance Dead lock Detection Dead lock creation
answered
Aug 21, 2020
in
Others
nocturnal123
50
views
ugcnetjune2005ii
0
votes
1
answer
25
UGCNET-June2005-II: 16
An Entity-relationship diagram is a tool to represent : Data model Process model Event model Customer model
An Entity-relationship diagram is a tool to represent : Data model Process model Event model Customer model
answered
Aug 21, 2020
in
Others
nocturnal123
50
views
ugcnetjune2005ii
0
votes
1
answer
26
UGCNET-June2005-II: 13
The data hiding is taken care by : Abstraction Encapsulation Modularity Inheritance
The data hiding is taken care by : Abstraction Encapsulation Modularity Inheritance
answered
Aug 21, 2020
in
Others
nocturnal123
98
views
ugcnetjune2005ii
0
votes
1
answer
27
UGCNET-June2005-II: 36
Moving Process from main memory to disk is called : Caching Termination Swapping Interruption
Moving Process from main memory to disk is called : Caching Termination Swapping Interruption
answered
Aug 21, 2020
in
Others
nocturnal123
73
views
ugcnetjune2005ii
0
votes
1
answer
28
UGCNET-June2005-II: 37
The principle of Locality of reference justifies the use of : Virtual memory Interrupts Cache memory Secondary memory
The principle of Locality of reference justifies the use of : Virtual memory Interrupts Cache memory Secondary memory
answered
Aug 21, 2020
in
Others
nocturnal123
71
views
ugcnetjune2005ii
0
votes
1
answer
29
UGCNET-June2005-II: 9
Which of the following binary number is the same as its $2's$ complement : $1010$ $0101$ $1000$ $1001$
Which of the following binary number is the same as its $2's$ complement : $1010$ $0101$ $1000$ $1001$
answered
Aug 21, 2020
in
Others
nocturnal123
70
views
ugcnetjune2005ii
0
votes
1
answer
30
UGCNET-June2005-II: 23
In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node “$g$” ? $1$ $3$ $7$ $8$
In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node “$g$” ? $1$ $3$ $7$ $8$
answered
Aug 21, 2020
in
Others
nocturnal123
80
views
ugcnetjune2005ii
0
votes
1
answer
31
UGCNET-June2005-II: 22
Which of the following statement is false ? Every tree is a bipertite graph A tree contains a cycle A tree with n nodes contains $n-1$ edges A tree is a connected graph
Which of the following statement is false ? Every tree is a bipertite graph A tree contains a cycle A tree with n nodes contains $n-1$ edges A tree is a connected graph
answered
Aug 21, 2020
in
Others
nocturnal123
41
views
ugcnetjune2005ii
0
votes
1
answer
32
UGCNET-June2005-II: 21
What is the time required to insert an element in a stack with linked implementation? $O \left(\log_{2}n \right)$ $O \left(n \right)$ $O \left(n \log_{2}n \right)$ $O \left(1 \right)$
What is the time required to insert an element in a stack with linked implementation? $O \left(\log_{2}n \right)$ $O \left(n \right)$ $O \left(n \log_{2}n \right)$ $O \left(1 \right)$
answered
Aug 21, 2020
in
Others
nocturnal123
44
views
ugcnetjune2005ii
0
votes
1
answer
33
UGCNET-June2005-II: 19
Multi-valued dependency among attribute is checked at which level ? $2$ $NF$ $3$ $NF$ $4$ $NF$ $5$ $NF$
Multi-valued dependency among attribute is checked at which level ? $2$ $NF$ $3$ $NF$ $4$ $NF$ $5$ $NF$
answered
Aug 21, 2020
in
Others
nocturnal123
32
views
ugcnetjune2005ii
0
votes
1
answer
34
UGCNET-June2005-II: 7
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to : $\overline{x}z$ $xyz$ $y$ $yz$
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to : $\overline{x}z$ $xyz$ $y$ $yz$
answered
Aug 21, 2020
in
Others
nocturnal123
47
views
ugcnetjune2005ii
0
votes
1
answer
35
UGCNET-Dec2005-II: 30
Encryption and decryption are the functions of the _________ layer of $OSI$ model : transport session router presentation
Encryption and decryption are the functions of the _________ layer of $OSI$ model : transport session router presentation
answered
Aug 21, 2020
in
Others
nocturnal123
332
views
ugcnetdec2005ii
0
votes
1
answer
36
UGCNET-June2006-II: 25
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
answered
Aug 21, 2020
in
Others
nocturnal123
48
views
ugcnetjune2006ii
0
votes
1
answer
37
UGCNET-June2006-II: 28
What is the difference between the Ethernet frame preamble field and the $IEEE$ $802.3$ preamble and start of frame frame Delimiter fields? $1$ byte $1$ bit $4$ bits $16$ bits
What is the difference between the Ethernet frame preamble field and the $IEEE$ $802.3$ preamble and start of frame frame Delimiter fields? $1$ byte $1$ bit $4$ bits $16$ bits
answered
Aug 21, 2020
in
Others
nocturnal123
56
views
ugcnetjune2006ii
0
votes
1
answer
38
UGCNET-Dec2005-II: 1
$T$ is a graph with n vertices. $T$ is connected and has exactly $n-1$ edges, then : $T$ is a tree $T$ contains no cycles Every pairs of vertices in $T$ is connected by exactly one path All of these
$T$ is a graph with n vertices. $T$ is connected and has exactly $n-1$ edges, then : $T$ is a tree $T$ contains no cycles Every pairs of vertices in $T$ is connected by exactly one path All of these
answered
Aug 21, 2020
in
Others
nocturnal123
38
views
ugcnetdec2005ii
0
votes
1
answer
39
UGCNET-Dec2005-II: 3
Let $A$ and $B$ be two arbitrary events, then : $P\left ( A\cap B \right )= P\left ( A \right )P\left ( B \right )$ $P\left ( P\cup B \right )= P\left ( A \right ) + P\left ( B \right )$ $P\left ( P\cup B \right )\leq P\left ( A \right ) + P\left ( B \right )$ $P\left ( A/ B \right )=P\left ( A\cap B \right )+P\left ( B \right )$
Let $A$ and $B$ be two arbitrary events, then : $P\left ( A\cap B \right )= P\left ( A \right )P\left ( B \right )$ $P\left ( P\cup B \right )= P\left ( A \right ) + P\left ( B \right )$ $P\left ( P\cup B \right )\leq P\left ( A \right ) + P\left ( B \right )$ $P\left ( A/ B \right )=P\left ( A\cap B \right )+P\left ( B \right )$
answered
Aug 21, 2020
in
Others
nocturnal123
50
views
ugcnetdec2005ii
0
votes
1
answer
40
UGCNET-Dec2005-II: 6
Which of the following is divisible by $4$? $100101100$ $1110001110001$ $11110011$ $10101010101010$
Which of the following is divisible by $4$? $100101100$ $1110001110001$ $11110011$ $10101010101010$
answered
Aug 21, 2020
in
Others
nocturnal123
65
views
ugcnetdec2005ii
To see more, click for all the
questions in this category
.
...