# Recent questions and answers in Others

1
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$
2
The cost of a parallel processing is primarily determined by : Time complexity Switching complexity Circuit complexity None of the above
1 vote
3
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$
4
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
5
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
6
A Top - down Parse generates Left most derivation Right - most derivation in reverse Right most derivation Left most derivation in reverse
7
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
8
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
1 vote
9
(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
10
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
11
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
12
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 .
13
Analysis of large database to retrive information is called : $OLTP$ $LAP$ $OLDP$ $TLPP$
14
The testing of software against $SRS$ is called : Acceptance testing Integration testing Regression testing Series testing
15
Bluetooth technology uses the transmission media. Radio links Microwave links $VSAT$ communication Optical fibre links
16
Which of the following is not collision Resolution Technique : Hash addressing​​​​​​​ Chainning Indexing None of these
17
_______synchronize critical resources to prevent deadlock. $P$- operator $V$- operator Semaphores Hard disk
18
The dynamic binding occurs during the: Compile time Run time Linking time Pre-processing time
19
$YACC$ builds up _____parsing table. $LALR$ $LR$ $SLR$ $LLR$
20
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
21
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$
22
Amongst the logic families $DTL, TTL, ECL$ and $CMOS$, the family with the least power dissipation is : $CMOS$ $DTL$ $TTL$ $ECL$
23
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)$
24
25
An Entity-relationship diagram is a tool to represent : Data model Process model Event model Customer model
26
The data hiding is taken care by : Abstraction Encapsulation Modularity Inheritance
27
Moving Process from main memory to disk is called : Caching Termination Swapping Interruption
28
The principle of Locality of reference justifies the use of : Virtual memory Interrupts Cache memory Secondary memory
29
Which of the following binary number is the same as its $2's$ complement : $1010$ $0101$ $1000$ $1001$
30
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$
31
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
32
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)$
33
Multi-valued dependency among attribute is checked at which level ? $2$ $NF$ $3$ $NF$ $4$ $NF$ $5$ $NF$
34
The logic expression $\overline{x}y\overline{z}+\overline{x}yz+xy\overline{z}+xyz$ reduces to : $\overline{x}z$ $xyz$ $y$ $yz$
35
Encryption and decryption are the functions of the _________ layer of $OSI$ model : transport session router presentation
36
Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph
37
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
$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
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 )$
Which of the following is divisible by $4$? $100101100$ $1110001110001$ $11110011$ $10101010101010$