Recent questions and answers in Others

+2 votes

2 answers

1

UGCNET-Dec2014-III-56
An $A^{*}$ algorithm is a heuristic search technique which Is like a depth-first search where most promising child is selected for expansion Generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node ... path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion. None of the above

answered 3 days ago in Others by Nurzamal Islam (25 points) | 393 views

0 votes

1 answer

2

UGCNET-July-2018-II-53
In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ______ $e^{-15}$ $1-e^{-15}$ $1-e^{-20}$ $e^{-20}$

answered 5 days ago in Others by kmittal1908 (25 points) | 16 views

0 votes

1 answer

3

UGCNET-July-2018-II-16
Coupling is a measure of the strength of the interconnections between software modules. Which of the following are correct statements with respect to module coupling? P: Common coupling occurs when one module controls the flow of another module by passing it information on what to do Q: In ... only parts of it. Code: P and Q only P and R only Q and R only All of P, Q and R

answered Sep 17 in Others by Pratikshadoshi (11 points) | 27 views

0 votes

1 answer

4

GATE SELF
Hello every one . I am preparing for GATE 19 and want to get a good RAnk . what should be best strategy to follow to get rank under max two digit. I gave GATE 18 but cant able to secure good rank. please give yr suggestion Thanks in advance.

answered Sep 8 in Others by Shubham Aggarwal Junior (619 points) | 50 views

+1 vote

1 answer

5

UGCNET-Nov2017-iii-74

answered Sep 4 in Others by mohit jain (27 points) | 89 views

0 votes

1 answer

6

UGCNET-July-2018-II-65
Consider the following schedules involving two transactions. $S_1 : r_1(X) ; r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$ $S_2 : r_1(X) ; r_2(X); r_2(Y); w_2(Y); r_1(Y); w_1(X)$ Which one of the following statements is correct with respect to ... and $S_2$ is not conflict serializable $S_1$ is not conflict serializable and $S_2$ is conflict serializable

answered Aug 31 in Others by yuviabhi (231 points) | 10 views

0 votes

1 answer

7

UGCNET-July-2018-II-99
Simplify the following using K-map: $F(A, B, C, D) = \Sigma (0, 1, 2, 8, 9, 12, 13)$ $d(A, B, C, D) = \Sigma (10, 11, 14, 15)$ d stands for don't care condition $A+\bar{B} \bar{D} +BC$ $A+\bar{B} \bar{D} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C}$ $\bar{A} + \bar{B} \bar{C} + \bar{B} \bar{D}$

answered Aug 31 in Others by yuviabhi (231 points) | 17 views

0 votes

1 answer

8

UGCNET-July-2018-II-96
Perform the following operation for the binary equivalent of the decimal numbers $(-14)_{10}+(-15)_{10}$. The solution in 8 bit representation is 11100011 00011101 10011101 11110011

answered Aug 31 in Others by yuviabhi (231 points) | 19 views

0 votes

2 answers

9

UGCNET-July-2018-II-92
In RS flip-flop, the output of the flip-flop at time (t+1) same as the output at time t, after the occurance of a clock pulse if S=R=1 S=0, R=1 S=2, R=0 S=R=0

answered Aug 31 in Others by yuviabhi (231 points) | 47 views

0 votes

1 answer

10

UGCNET-July-2018-II-93
Match the terms in List-I with the options given in List-II List - I List - II a Decoder i 1 line to $2^n$ lines b Multiplexer ii n lines to $2^n$ lines c De multiplexer iii $2^n$ lines to 1 line iv $2^n$ lines to $2^{n-1}$ lines a-ii; b-i; c-iii a-ii; b-iii; c-i a-ii; b-i; c-iv a-iv; b-ii; c-i

answered Aug 30 in Others by yuviabhi (231 points) | 16 views

0 votes

1 answer

11

UGCNET-July-2018-II-91
CMOS is a computer chip on the motherboard, which is RAM ROM EPROM Auxillary storage

answered Aug 30 in Others by yuviabhi (231 points) | 14 views

0 votes

2 answers

12

UGCNET-July-2018-II-86
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^x A_i$ is Z Q R C

answered Aug 30 in Others by yuviabhi (231 points) | 26 views

0 votes

1 answer

13

UGCNET-July-2018-II-77
Consider the following English sentence: "Agra and Gwalior are both in India". A sudent has written a logical sentence for the above English sentence in First-Order Logic using predicate IN(x, y), which means x is in y, as ... but expresses the meaning of the English sentence It is syntactically invalid and does not express the meaning of the English sentence

answered Aug 30 in Others by yuviabhi (231 points) | 17 views

0 votes

1 answer

14

UGCNET-July-2018-II-68
Database systems that store each relation in a separate operating system file may use the operating system's authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false? The administrator ... file Operations on the database are speeded up as the authorization procedure is carried out at the operating system level

answered Aug 30 in Others by yuviabhi (231 points) | 30 views

0 votes

2 answers

15

UGCNET-July-2018-II-64
Relations produced from E-R Model will always be in _____ 1 NF 2 NF 3 NF 4 NF

answered Aug 30 in Others by yuviabhi (231 points) | 10 views

0 votes

1 answer

16

UGCNET-July-2018-II-63
In a Hierarchical database, a hashing function is used to locate the ____ Collision Root Foreign Key Records

answered Aug 30 in Others by yuviabhi (231 points) | 12 views

0 votes

1 answer

17

UGCNET-July-2018-II-40
Consider the following statements( ): $S_1$: There exist no algorithm for deciding if any two Turing machine $M_1$ and $M_2$ accept the same language $S_2$: The problem of determining whether a Turing machine halts on any input is undecidable Which one of ... ? Both $S_1$ and $S_2$ are correct Both $S_1$ and $S_2$ are not correct Only $S_1$ is correct Only $S_2$ is correct

answered Aug 29 in Others by yuviabhi (231 points) | 13 views

0 votes

2 answers

18

UGCNET-July-2018-II-37
Context sensitive language can be recognized by a Finite state machine Deterministic finite automata Non-deterministic finite automata Linear bounded automata

answered Aug 29 in Others by yuviabhi (231 points) | 18 views

0 votes

1 answer

19

UGCNET-July-2018-II-36
Consider the following two Grammars: $G_1 \: : \: S \rightarrow SbS \mid a$ $G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$ Which one of the folloeing options is correct? Only $G_1$ is ambiguous Only $G_2$ is ambiguous Both $G_1$ and $G_2$ are ambiguous Both $G_1$ and $G_2$ are not ambiguous

answered Aug 29 in Others by yuviabhi (231 points) | 13 views

0 votes

1 answer

20

UGCNET-July-2018-II-35
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is $2n-1$ $2n$ $n+1$ $n^2$

answered Aug 29 in Others by yuviabhi (231 points) | 36 views

0 votes

2 answers

21

UGCNET-July-2018-II-34
Pushdown automata can recognize language generated by _______ Only context free grammar Only regular grammar Context free grammar or regular grammar Only context sensitive grammar

answered Aug 29 in Others by yuviabhi (231 points) | 26 views

0 votes

1 answer

22

UGCNET-July-2018-II-32
The finite state machine given in figure below recognizes: anu string of odd number of a's anu string of odd number of b's any string of even number of a's and odd number of b's any string of odd number of a's and odd number of b's

answered Aug 29 in Others by yuviabhi (231 points) | 23 views

0 votes

2 answers

23

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

answered Aug 29 in Others by yuviabhi (231 points) | 41 views

0 votes

1 answer

24

UGCNET-July-2018-II-27
Match the following with respect to algorithm paradigms: List - I List - II (a) The 8-Queen's problem (i) Dynamic programming (b) Single-Source shortest paths (ii) Divide and conquer (c) STRASSEN's Matrix multiplication (iii) Greedy approach (d) Optimal binary search trees (iv) Backtracking a-iv; b-i ... -ii a-iv; b-iii, c-i, d-ii a-iii; b-iv, c-ii, d-i a-iv; b-iii, c-ii, d-i

answered Aug 29 in Others by yuviabhi (231 points) | 31 views

0 votes

1 answer

25

UGCNET-July-2018-II-29
A 5-ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be: 30 33 45 125

answered Aug 29 in Others by yuviabhi (231 points) | 44 views

0 votes

2 answers

26

UGCNET-July-2018-II-26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes

answered Aug 29 in Others by yuviabhi (231 points) | 18 views

0 votes

2 answers

27

UGCNET-July-2018-II-24
Which of the following algorithms solves the single-source shortest paths? Prim's algorithm Floys-Warshall algorithm Johnson's algorithm Dijkstra's algorithm

answered Aug 29 in Others by yuviabhi (231 points) | 26 views

0 votes

1 answer

28

UGCNET-July-2018-II-21
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\theta \: (lg \: m)$ $\theta \: (m)$ $\theta \: (mlg \: m)$ $\theta \: (lglg \: m)$

answered Aug 29 in Others by yuviabhi (231 points) | 26 views

0 votes

1 answer

29

UGCNET-July-2018-II-15
Match the 5 CMM Maturity levels/CMMI staged representations in List - I with their characterizations in List - II: List - I List - II Initial Processes are improved quantitatively and continually Repeatable The plan for a project comes from a template for plans Defined The plan uses processes that can be ... v; e-iii a-v; b-iv; c-ii; d-iii; e-i a-iv; b-v; c-ii; d-iii; e-i

answered Aug 29 in Others by yuviabhi (231 points) | 26 views

0 votes

2 answers

30

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%

answered Aug 29 in Others by yuviabhi (231 points) | 30 views

0 votes

1 answer

31

UGCNET-July-2018-II-13
Which one of the following is not typically provided by Source Code Management Software? Synchronization Versioning and Revision history Syntax highlighting Project forking

answered Aug 29 in Others by yuviabhi (231 points) | 21 views

0 votes

1 answer

32

UGCNET-July-2018-II-11
Assume the following regarding the development of a software system P: Estimated lines of codes P : 33, 480 LOC Average productivity for P : 620 LOC per person -month Number of software developers : 6 Average salary of a software developer : INR 50, 000 per month If E, D and C are the ... respectively, then (E, D, C) = ______ (48, 8, 24) (54, 9, 27) (60, 10, 30) (42, 7, 21)

answered Aug 29 in Others by yuviabhi (231 points) | 26 views

0 votes

4 answers

33

Ugc Net july 2018 paper 2
Can anyone solve the following recurrence relation problem which was asked in this year Ugc net paper 2

answered Aug 19 in Others by turendar (161 points) | 68 views

0 votes

2 answers

34

UGCNET-July-2018-II-3
What is the output of the following JAVA program? class simple { public static void main(String[ ] args) { simple obj = new simple(); obj.start(); } void start() { long [] P = {3, 4, 5}; long [] Q = method (P); System.out.print (P[0] + P[1] +P[2]+ : ); System.out.print ... + Q[2]); } long [ ] method (long [ ] R) { R[1] = 7; return R; } } //end of class 12:15 15:12 12:12 15:15

answered Aug 18 in Others by sanjeela.sagar (157 points) | 65 views

+2 votes

2 answers

35

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

answered Aug 17 in Others by Aditya Pai (21 points) | 500 views

0 votes

2 answers

36

ISRO2018-52
In $E-R$ model, $Y$ is the dominant entity and $X$ is subordinate entity If $X$ is deleted, then $Y$ is also deleted If $Y$ is deleted, then $X$ is also deleted If $Y$ is deleted, then $X$ is not deleted None of the above

answered Aug 11 in Others by Verma Ashish Active (1.3k points) | 408 views

0 votes

1 answer

37

UGCNET-July-2018-II-41
A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps bandwidth. Find the throughput of the system (all stations put together) produces 250 frames per second: 49 368 149 151

answered Aug 7 in Others by kamakshi Junior (675 points) | 33 views

0 votes

1 answer

38

UGCNET-june2008-ii-24
Files that are related to input/output and are used to model serial I/O devices such as terminals, printers and networks are called : (A) regular files (B) character special files (C) directories (D) block special files

answered Jul 31 in Others by Aakash_ Junior (949 points) | 62 views

0 votes

1 answer

39

UGCNET-July-2018-II-50
Encrypt the Message "HELLO MY DEARZ" using Transposition Cipher with $Key \begin{cases} \text{Plain Text} & 2 4 3 1 \\ \text{Cipher Text} &1 2 3 4 \end{cases}$ HLLEO YM AEDRZ EHOLL ZYM RAED ELHL MDOY AZER ELHL DOMY ZAER

answered Jul 31 in Others by Sayan Bose Active (3.1k points) | 32 views

0 votes

1 answer

40

UGCNET-July-2018-II-4
What is the output of the following C' program? (Assuming little - endian representation of multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.) #include<stdio.h> #include<stdlib.h> /* Assume short int occupies two bytes of storage */ int main () ... two[1], m.one); }/* end of main */ 5, 2, 1282 5, 2, 52 5, 2, 25 5, 2, 517

answered Jul 26 in Others by Dr. Veenu Saini (33 points) | 82 views

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 questions and answers in Others

Recent Posts

Recent Blog Comments