Recent activity by Sanjay Sharma

1 answer

1

UGCNET-DEC2016-III-48
A software company needs to develop a project that is estimated as 1000 function points and is planning to use JAVA as the programming language whose approximate lines of code per function point is accepted as 50. Considering a=1.4 as multiplicative factor, b ... equation, approximately how long does the project take to complete? 11.2 months 12.2 months 13.2 months 10.2 months

edited 20 hours ago in Others | 2k views

1 answer

2

UGCNET-june2009-ii-41
Which one of the following ISO standard is used for software process? (A) ISO 9000 (B) ISO 9001 (C) ISO 9003 (D) ISO 9000-3

commented 4 days ago in Computer Networks | 194 views

2 answers

3

UGNET-NOV2017-III-45
A signal processor software is expected to operate for 91.25 days after repair, and the mean software repair time is expected to be 5 minutes. Then, the availability of the software is: (1) 96.9862% (2) 97.9862% (3) 98.9962% (4) 99.9962%

answer selected Dec 3 in Others | 244 views

2 answers

4

UGCNET-July-2018-II-14
A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to restart. Approximately, what was the software availability in that year? 96.9924% 97.9924% 98.9924% 99.9924%

commented Dec 3 in IS&Software Engineering | 178 views

1 answer

5

UGCNET-June2015-II-15
When the inheritance is private, the private methods in base class are _____ in the derived class (in C++) inaccessible accessible protected public

commented Dec 3 in Object Oriented Programming | 423 views

5 answers

6

can cadidate key may be null?

commented Nov 26 in Databases | 944 views

2 answers

7

UGCNET-Dec2015-III-12
Consider a subnet with 720 routers. If a three level hierarchy is choosen with 8 clusters, each containing9 regions of 10 routers, then total number of entries in the routing table is_______ 25 27 53 72

commented Nov 23 in Computer Networks | 2.3k views

0 answers

8

in how many ways 4 different balls can be placed in 5 different boxes so that no box contains all 4 balls

commented Nov 23 in Combinatory | 32 views

2 answers

9

ambiguous grammar
if following grammar ambiguous ? S->aSbS|bSaS|λ

commented Nov 23 in Theory of Computation | 251 views

1 answer

10

UGCNET-June2013-III-21
Which one of the following media is multidrop? Shielded Twisted pair cable Unshielded Twisted pair cable Thick Coaxial cable Fiber Optic cable

answer edited Oct 31 in Others | 721 views

3 answers

11

UGCNET-July-2018-II-28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450

comment edited Oct 27 in Others | 486 views

1 answer

12

UGCNET-Nov2017-iii-13
Which of the following is not a component of Memory tube display? A. Flooding gun B. Collector C. Ground D. Liquid Crystal

commented Oct 26 in Computer Graphics | 293 views

1 answer

13

UGCNET-June2012-III-59
The perspective projection matrix, on the view plan z=d where the centre of projection is the origin (0, 0, 0) shall be $\begin{bmatrix} 0 & 0 & 0 & d \\ 0 & 0 & d & 0 \\ 0 & d & 0 & 0 \\ d & 0 & 0 & 1 \end{bmatrix}$ ...

answer edited Oct 25 in Computer Graphics | 1k views

1 answer

14

UGCNET-June2013-III-13
In any n-element heap, the number of nodes of height h is, less than equal to $\biggl[ \frac{n}{2^h} \biggr]$ greater than $\biggl[ \frac{n}{2^h} \biggl]$ greater than $\biggl[ \frac{n}{2^h+1} \biggr]$ less than equal to $\biggl [ \frac{n}{2^h+1} \biggr]$

commented Oct 24 in Others | 249 views

0 answers

15

You are asked to sort 15 randomly generated numbers. You should prefer?

comment edited Oct 24 in Algorithms | 926 views

2 answers

16

fallacy , contradiction and invalid argument are same ?

answer selected Oct 24 in Mathematical Logic | 34 views

3 answers

17

ISRO2014-48
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)? Assume one bit storage per pixel and starting pixel location is at 0. 1016 1006 610 616

commented Oct 22 in Computer Graphics | 2.5k views

1 answer

18

Ugc net 2018 july - 89
89 Which of the following is an equivalence relation on the set of all functions from Z toZ ? (1) { (f, g) |f (x)−g (x)=1 for all x ∈ Z } (2) { (f, g) | f (0)=g (0) or f (1)=g (1) } (3) { (f, g) | f (0)=g (1) and f (1)=g (0) } (4) { (f, g) | f (x)−g (x)=k for some k ∈ Z }

edited Oct 21 in Mathematical Logic | 226 views

3 answers

19

UGCNET-July-2018-II-90
Which of the following statements is true? $(Z, \leq)$ is not totally ordered The set inclusion relation $\subseteq$ is a partial ordering on the power set of a set S $(Z, \neq)$ is a poset The directed graph is not a partial order

answer selected Oct 21 in Others | 101 views

2 answers

20

UGCNET-June2013-III-28
The refresh rate above which a picture stops flickering and fuses into a steady image is called ____ Crucial fusion frequency Current frequency fusion Critical fusion frequency Critically diffused frequency

answer selected Oct 17 in Others | 346 views

1 answer

21

UGCNET-June2013-III-12
The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is $O(n \log \log \log n)$ $O(n \log \log n)$ $O(\log \log n)$ $O(\log n \log \log n)$

commented Oct 10 in Others | 351 views

3 answers

22

UGCNET-June2014-III-35
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ ... respectively (without including initial page faults to fill available page frames with pages) : $9$ and $6$ $10$ and $7$ $9$ and $7$ $10$ and $6$

answer edited Oct 6 in Operating System | 2.2k views

1 answer

23

ugc net 2018 july-40
Consider the following statements(): S1: There exists no algorithm for deciding if any two Turing machine M1 and M2 accept the same language S2: The problem of determining wether a Turing machine halts on any input is undecidable. Which of the following option is correct? Both S1 and S2 are correct Both S1 and S2 are not correct Only S1 correct Only S2 correct

answer selected Oct 5 in Theory of Computation | 296 views

3 answers

24

UGCNET-DEC2016-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 1 and 2 are false Both 1 and 2 are true 1 is true, 2 is false 1 is false, 2 is true

commented Sep 26 in Others | 991 views

4 answers

25

regular exp[ression
Which of the following regular expression identities are true ? (A) (r + s)* = r* s* (B) (r + s)* = r* + s* (C) (r + s)* = (r*s*)* (D) r* s* = r* + s*

commented Sep 22 in Theory of Computation | 1.4k views

1 answer

26

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

commented Sep 20 in Programming | 2.2k views

2 answers

27

UGCNET-Dec2015-III-57
What will be the output of the following Unix command? $rm chap0\[1-3\] Remove file chap0[1-3] Remove file chap01, chap02, chap03 Remove file chap$\text{\[1-3\]}$ None of the above

answer edited Sep 19 in Others | 542 views

0 answers

28

pumping lemma peter linz EX
Let L={a^nb^m: n>=100 , m<=50} Can you use the pumping lemma to show that L is not regular? Explain your answers

comment edited Sep 18 in Theory of Computation | 35 views

2 answers

29

UGCNET-June2012-III-17
Let $Q(x,y)$ denote “x+y=0” and let there be two quantifications given as $\exists y \forall x Q(x,y)$ $\forall x \exists y Q(x,y)$ where $x$ and $y$ are real numbers. Then which of the following is valid? I is true and II is false I is false and II is true I is false and II is also false both I and II are true

answer edited Sep 15 in Discrete Mathematics | 523 views

1 answer

30

UGCNET-June2012-III-63
If a and b are the end points of a line, then which of the following is true? If both end points are left, right, above or below the window, the line is invisible. If both end points are left, right, above or below the window, the line ... the window, the line is trivially visible If both end points are left, right, above or below the window, the line is trivially invisible

commented Sep 13 in Computer Graphics | 733 views

1 answer

31

UGCNET-Dec2012-III-19
Identify the following activation function: $\Phi (V) = Z +\frac{1}{1+ exp(-x*V+Y)}$, Z, X, Y are parameters. Step function Ramp function Sigmoid function Gaussian function

commented Sep 9 in Discrete Mathematics | 618 views

1 answer

32

UGCNET-June2013-III-14
A data file of 1,00,000 characters contains only the characters g-1, with the frequencies as indicated in table: g h i j k i Frequency in thousand 45 13 12 16 9 5 using the variable-length code by Huffman codes, the file can be encoded with 2,52,000 bits 2,64,000 bits 2,46,000 bits 2,24,000 bits

answer edited Sep 8 in Others | 655 views

1 answer

33

UGCNET-June2013-III-32
Arrays in C language can have ____ with reference to memory representation. n-subscripts two-subscripts only one subscript three subscripts only

answer edited Sep 8 in Others | 531 views

1 answer

34

decimal to hexadecimal (any faster method)

answer selected Sep 6 in Digital Logic | 37 views

0 answers

35

Difference between Characteristic table , Excitation table , State table, Truth table

commented Sep 5 in Digital Logic | 268 views

5 answers

36

GATE2011-6, UGCNET-June2013-III-62
Let the time taken to switch from user mode to kernel mode of execution be $T1$ while time taken to switch between two user processes be $T2$. Which of the following is correct? $T1 > T2$ $T1 = T2$ $T1 < T2$ Nothing can be said about the relation between $T1$ and $T2$

commented Aug 31 in Operating System | 5.7k views

3 answers

37

UGC-net-july 2018 question no.52,
In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns. The average time required to access a page is ____ [A] 150 [B] 68 [C] 75 [D] 78

commented Aug 29 in Operating System | 206 views

2 answers

38

Deadlock
When a process is rolled back as a result of deadlock , the difficulty which arises is a) Starvation b)System Thoughput c)Low device utilization d) Cycle stealing

commented Aug 29 in Operating System | 494 views

2 answers

39

ISRO2009-17
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below: Process Priority Arrival Time (in ms) CPU Time Needed Priority P1 0 10 5 P2 0 5 2 P3 2 3 1 P4 5 20 4 P5 10 2 3 (smaller the number, higher the ... the CPU scheduling policy is priority scheduling without pre-emption, the average waiting time will be 12.8 ms 11.8 ms 10.8 ms 09,8 ms

commented Aug 24 in Operating System | 2.8k views

1 answer

40

UGCNET-Sep2013-III-71
Consider a main memory with three page frames for the following page reference string: 5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4 Assuming that the execution of process is initialized after loading page 5 in memory,, the number of page faults in FIFO and second chance replacement respectively are 8 and 9 10 and 11 7 and 9 9 and 8

commented Aug 23 in Operating System | 835 views