Questions by Sanjay Sharma

+1 vote

1 answer

1

Which activity is included in the first pass of two pass assemblers(UGC NET DEC 04)

asked 19 hours ago in Compiler Design | 12 views

0 votes

0 answers

2

Which activity is not included in the first pass of two pass assemblers (UGC NET Dec 04)

asked 19 hours ago in Compiler Design | 10 views

0 votes

1 answer

3

horn clause
Among the following which is not a Horn Clause ? (A) p (B) 7p V q (C) p -> q (D) p -> 7q

asked 2 days ago in Mathematical Logic | 25 views

+2 votes

0 answers

4

avg memory access time

asked 2 days ago in Operating System | 57 views

0 votes

1 answer

5

When inorder traversing a tree resulted in EACKFHDBG; the preorder traversal would return

asked 2 days ago in Programming | 23 views

+1 vote

1 answer

6

With interrupt driver I/O, if two or more devices request service at the same time

asked 3 days ago in CO & Architecture | 22 views

0 votes

0 answers

7

microprocessor
In the following program segment— Delay : L × I H, 0010H LOOP : DCXH MOV A, L ORA H XRA A JNZ LOOP RET Number of time loop will be executed is— (A) 16 (B) 10 (C) 1 (D) Infinite

asked 3 days ago in CO & Architecture | 13 views

+1 vote

1 answer

8

correct formula for not all sunny days are hot

asked 3 days ago in Mathematical Logic | 24 views

0 votes

0 answers

9

Data security in C programming language can be implemented using the data storage attribute

asked 3 days ago in Programming | 35 views

0 votes

1 answer

10

ethernet network
Station A and Station B attempt to transmit a frame and collide on an ethernet network, after collision, a wins and started transmission. At the end of this successful transmission, both A and B attempt to transmits & collide again. The probability that A wins the second is— (A) 0.5 (B) 0.625 (C) 0.75 (D) 0.33

asked 3 days ago in Computer Networks | 32 views

+1 vote

1 answer

11

subnet mask
Suppose computer A and B have IP address 143.105.1.113 and 143.105.1.91 respectively and they use the same subnet mask N. Which of the values of N given below should NOT be used if A & B belongs to the same network— (A) 255.255.255.0 (B) 255.255.255.128 (C) 255.255.255.192 (D) 255.255.255.224

asked 3 days ago in Computer Networks | 20 views

0 votes

1 answer

12

properties of languages
Which of the following statements is false ? (A) Every NFA can be converted to a equivalent DFA (B) Every non-deterministic turning machine can be converted to an equivalent deterministic turning machine (C) Every regular language is also a context for language (D) Every subset of a recursively enumerable set is recursive

asked 3 days ago in Theory of Computation | 34 views

0 votes

0 answers

13

about lex
Which of the following remarks about lex are true ? (A) It generates a ‘C’ program (B) It produces a C code that consumes more memory than a C program that can be written separately to accomplish the same task (C) It produces a C code that executes slower than a C program that can be written separately to accomplish the same task (D) All of these

asked 3 days ago in Compiler Design | 17 views

0 votes

0 answers

14

digital signature
A digital signature is required— (I) To tie an electronic message to the sender’s identity (II) For non repudiation of communication by a sender (III) To prove that a message was sent by the sender in a court of law (IV) In all e-mail transactions (A) I and II (B) I, II, III (C) I, II, III, IV (D) II, III, IV

asked 3 days ago in Computer Networks | 15 views

+1 vote

2 answers

15

If PEN – MEN = 87, then BOY – CAN =?

asked 6 days ago in Numerical Ability | 73 views

+1 vote

0 answers

16

Regular expresssion
My Lafter Machin (MLM) recognizes the following strings : (i) a (ii) aba (iii) abaabaaba (iv) abaabaabaabaabaabaabaabaaba Using this as an information, how would you compare the following regular expressions? (i) (aba)3x (ii) a.(baa)3x-1. ba (iii) ab.(aab).3x- ... are not same. (C) (i), (ii) and (iii) are different. (D) (i), (ii) and (iii) are same.

asked Oct 16 in Theory of Computation | 26 views

+2 votes

0 answers

17

schedule graph

asked Oct 12 in Graph Theory | 19 views

+2 votes

0 answers

18

boys and 4 girls have to sit in a row with all arrangements equally likely

asked Oct 12 in Combinatory | 22 views

+2 votes

1 answer

19

p'q'r is minterm of

asked Oct 10 in Mathematical Logic | 50 views

+3 votes

1 answer

20

printf(“%x”,-1>>4);
What is the output of the following ‘C’ program? main() { printf(“%x”,-1>>4); } (A) ffff (B) 0fff (C) 0000 (D) fff0

asked Oct 10 in Programming | 45 views

0 votes

2 answers

21

output

asked Sep 29 in Programming | 32 views

0 votes

1 answer

22

program output

asked Sep 29 in Programming | 21 views

0 votes

1 answer

23

output of C program

asked Sep 29 in Programming | 24 views

+2 votes

1 answer

24

Timothy (normal form)
Let R be a relation. Which options are correct a)R will necessarily have a composite key if R is in BCNF but not in 4NF b) If R is in 3NF and if every key of R is simple, then R is in BCNF c) If R is in BCNF and if R has at least one simple key , then R is in 4NF d) If R is in 3NF and if its every key is simple, then R is in 5NF

asked Sep 25 in Databases | 21 views

0 votes

0 answers

25

A circuit produces 1’s complement of the input word

asked Sep 20 in Digital Logic | 46 views

+1 vote

2 answers

26

DFA for language L = (111 + 111111)*

asked Sep 20 in Theory of Computation | 61 views

0 votes

0 answers

27

galvin excercise
12.8 Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is: 86,1470,913,1774, ... for each of the following disk-scheduling algorithms? a. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN f. C-LOOK

asked Aug 26 in Operating System | 29 views

0 votes

0 answers

28

NET AUG Paper-3 Q 56
Given a Turing Machine M = ({q0, q1}, {0, 1}, {0, 1, B}, d, B, {q1}) Where d is a transition function defined as d(q0, 0) = (q0, 0, R) d(q0, B) = (q1, B, R) The language L(M) accepted by Turing machine is given as : (1) 0* 1* (2) 00* (3) 10* (4) 1*0*

asked Aug 25 in Theory of Computation | 66 views

+2 votes

1 answer

29

NET Aug 16 paper-III Q 55

asked Aug 23 in Theory of Computation | 46 views

0 votes

0 answers

30

UGC NET Paper-1 DEC 14 (average annual growth rate)

asked Jul 1 in Numerical Ability | 132 views