Recent activity by Sanjay Sharma - GATE Overflow

1 answer

1

UGCNET-Nov2017-iii-5
Which of the following is correct statement? A. In memory - mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words. B. The isolated I/O method isolates memory and I/O addresses ... of data the two units share a common clock. D. In synchronous serial transmission of data the two units have different clocks.

commented 2 days ago in CO and Architecture | 532 views

2 answers

2

NTA NET DEC 2019 (Post-correspondence)
$\mathbf{Q57}$ Let $\mathrm{A={001,0011,11,101}}$ and $\mathrm{B={01,111,111,010}}$. Similarly , Let $\mathrm{C={00,001,1000}}$ and $\mathrm{B={0,11,011}}$. Which of the following pairs have a post correspondence solution? $\mathrm{1)\; Only \;pair \;(A,B) }$ ... $\mathrm{\; 4) \;Neither \;(A,B) \;nor\; (C,D) }$

recategorized 5 days ago in Theory of Computation | 310 views

2 answers

3

UGCNET-Jan2017-III: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is correct? Both (a) and ... Both (a) and (b) are true (a) is true, (b) is false (a) is false, (b) is true

commented May 14 in Theory of Computation | 23 views

1 answer

4

GATE1999-1.2
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above

commented May 6 in Set Theory & Algebra | 2.8k views

1 answer

5

Asymptotic time complexity to add a node at the end of singly linked list.
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? (a) O(1) (b) O(n) (c) θ (n) (d) θ (1) Confused between option (b) and (c) .

commented May 3 in Algorithms | 1.2k views

2 answers

6

UGCNET-DEC2016-II: 20
The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is _________ 16 63 64 65

commented Apr 27 in Others | 2.6k views

3 answers

7

NTA NET DEC 2019 (B-tree)
In a B- Tree, each node represents a disk block. Suppose one block holds 8192 bytes, each key uses 32 bytes. In a B-Tree of order M there are M-1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is (1) 32M – 32 (2) 36 M – 32 (3) 36 M – 36 (4) 32M -36

answer selected Apr 26 in Databases | 395 views

1 answer

8

UGCNET-June2015-III: 59
Match the following with respect to heuristic search techniques: List-I List-II a. Steepest accent Hill Climbing i. Keeps track of all partial paths which can be candidate for further exploration b. Branch - and - bound ii. Discover problem state(s) that satisfy a set of constraints c. Constraint ... -iv, b-i, c-ii, d-iii a-iii, b-iv, c-i, d-ii a-iv, b-ii, c-i, d-iii

answer edited Apr 24 in Artificial Intelligence | 641 views

4 answers

9

UGCNET-June-2019-II: 84
You need $500$ subnets, each with about $100$ usable host address per subnet. What network mask will you assign using a class B network address? $255.255.255.252$ $255.255.255.128$ $255.255.255.0$ $255.255.254.0$

commented Apr 22 in Computer Networks | 2k views

1 answer

10

UGCNET-June2015-III: 23
Which of the following is false for the programming language PROLOG? A PROLOG variable can only be assigned to a value once PROLOG is a strongly typed language The scope of a variable in PROLOG is a single clause or rule The scope of a variable in PROLOG is a single query

commented Apr 10 in Artificial Intelligence | 783 views

1 answer

11

optimal page size
average process size is 128KB per page entry requires 8 bytes, then optimal page size? 64B 128B 7254B none

comment edited Apr 4 in Operating System | 1.5k views

1 answer

12

NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehg abfhge afghbe Which are depth first traversals of the above graph? I,II and IV only. I and IV only. II,III and IV only. I,III and IV only.

commented Mar 31 in Graph Theory | 36 views

1 answer

13

UGCNET-Dec2006-II: 20
Two phase protocol in a database management system is : a concurrency mechanism that is not deadlock free. a recovery protocol used for restoring a database after a crash. Any update to the system log done in 2-phases. not effective in Database.

commented Mar 28 in Databases | 38 views

3 answers

14

UGCNET-Dec2006-II: 29
The subnet mask $255.255.255.192$ Extends the network portion to 16 bits. Extends the network portion to 26 bits. Extends the network portion to 36 bits. Has no effect on the network portion of an IP address.

answered Mar 28 in Computer Networks | 49 views

2 answers

15

UGCNET-Dec2006-II: 3
The number of edges in a complete graph with N vertices is equal to: $N (N−1)$ $2N−1$ $N−1$ $N(N−1)/2$

answered Mar 28 in Graph Theory | 42 views

2 answers

16

UGCNET-Dec2006-II: 1
Which of the regular expressions corresponds to this grammar ? $S → AB/AS, A → a/aA, B → b$ $aa^*b^+$ $aa^*b$ $(ab)^*$ $a(ab)^*$

answered Mar 28 in Theory of Computation | 61 views

2 answers

17

UGCNET-June2015-III: 30
The minimum payload of a TCP segment is 65,535 65,515 65,495 65,475

commented Mar 4 in Computer Networks | 1.6k views

1 answer

18

$\textbf{NTA NET DEC 2019 (group)}$
Consider the following statements: $\mathbf{S_1:}\;\;$If a group $\mathbf{(G,*)}$ is of order $\mathbf n$ and $\mathrm {a \in G}$ is such that $\mathrm {a^m=e}$ for some integer $\mathrm {m \le n}$ then $\mathbf m$ must divide $\mathbf n$ ... $(3)\;\;\;\text{Niether}\; \mathrm{S_1}\;\text{nor}\;\mathrm{S_2}$

edited Feb 18 in Set Theory & Algebra | 173 views

2 answers

19

BCD adder to add 2 decimal digits needs
The BCD adder to add two decimal digits needs minimum of 6 full adders, 2 half adders 5 full adders, 3 half adders 4 full adders, 3 half adders 5 full adders, 2 half adders

comment edited Feb 8 in Digital Logic | 5k views

2 answers

20

ISRO2014-23
The test suite (set of test input) used to perform unit testing on a module could cover 70% of the code. What is the reliability of the module if the probability of success is 0.95 during testing? 0.665 to 0.95 At the most 0.665 At the most 0.95 At least 0.665

commented Jan 3 in IS&Software Engineering | 3k views

4 answers

21

UGCNET-June2015-III: 7
Let $E_1$ and $E_2$ be two entities in E-R diagram with simple single valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$ where $R_1$ is one-many and $R_2$ is many-many. $R_1$ and $R_2$ do not have any attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model? 4 3 2 1

commented Jan 2 in Databases | 4.1k views

2 answers

22

ISRO2007-49
One approach to handling fuzzy logic data might be to design a computer using ternary (base-3) logic so that data could be stored as “true,” “false,” and “unknown.” If each ternary logic element is called a flit, how many flits are required to represent at least 256 different values? 4 5 6 7

commented Jan 2 in Digital Logic | 2k views

1 answer

23

NTA NET DEC 2019(Inherently ambiguous language)
Consider the following languages: L1 ={a^nb^nc^m } U {a^nb^mc^m} n, m ≥ 0 L2={wwR|w {a,b}*} Where R represents reversible operation Which one of the following is (are) inherently ambiguous language(s)? 1) Only L1 (2) only L2 3) Both L1 and L2 (4) neither L1 nor L2

edited Dec 31, 2019 in Theory of Computation | 257 views

0 answers

24

NTA NET DEC 2019 (microprocessor)

asked Dec 30, 2019 in CO and Architecture | 192 views

2 answers

25

$\textbf{NTA NET DEC 2019 (C-Program)}$
$\text{What is the output of the following C program?}$ #include <stdio.h> main() { int i, j ,x=0 ; for (i=0; i <5 ; ++ i) for (j=0;j <i ;++j) { x+ = (i+j-1); break ; } printf(“%d” ,x); } $1)6 \;\;\; 2)5 \;\;\; 3)4 \;\;\; 4) 3$

commented Dec 30, 2019 in Programming | 315 views

1 answer

26

NTA NET DEC 2019 (insert and extract min)
What is the worst case time of insert and extract- min in an implementation of a priority queue using an unsorted array? Assume that all insertions can be accommodated 1) θ(1) ,θ(n) 2) θ(n) ,θ(1) 3) θ(1) ,θ(1) 4) θ(n) ,θ(n)

answer selected Dec 30, 2019 in Algorithms | 220 views

1 answer

27

NTA NET DEC 2019 (DES)
The Data Encryption Standard (DES) has a function consists of four steps. Which of the following is correct order of these four steps? An expansion permutation, S boxes, an XOR operation, a straight permutation An expansion permutation, an XOR ... - boxes, an XOR operation, an expansion permutation A straight permutation, an XOR operation, S boxes, an expansion permutation

asked Dec 29, 2019 in Computer Networks | 180 views

1 answer

28

NTA NET DEC 2019 (sequence diagram)
In a system for a restaurant the main scenario for placing order is given below: Customer reads menu Customer places order Order is sent to kitchen for preparation Order items are served Customer request for a bill for the order Bill is prepared for this order Customer ... at least how many objects among whom the messages will be exchanged) 1) 3 (2) 4 (3) 5 (4) 6

asked Dec 29, 2019 in Object Oriented Programming | 219 views

1 answer

29

NTA NET DEC 2018 Q88
A full joint distribution for the Toothache, Cavity and Catch is given in the table below : What is the probability of Cavity, given evidence of Toothache ? (a) <0.2, 0.8> (b) <0.6, 0.4> (c) <0.6, 0.8> (d) <0.4, 0.8>

commented Dec 29, 2019 in Probability | 157 views

1 answer

30

NTA NET DEC 2019 (network security)
Consider the following statements with respect to network security a) Message confidentially means that the sender and the receiver expect privacy. b) Message integrity means that the data must arrive at the receiver exactly as they were sent . c) Message authentication means the receiver ensured ... 2) only (a) and (c) 3) only (b) and (c) 4) (a), (b) and (c)

answer selected Dec 28, 2019 in Computer Networks | 166 views

52,218 questions

59,876 answers

201,073 comments

118,119 users