Time Left - 25:00 mins
UGC-NET 2018: MiniMock Quiz 1
Attempt now to get your rank among 325 students!
Question 1
Consider the following statements:
(a) Depth-first search is used to traverse a rooted tree.
(b) Pre-order, Post-order and In-order are used to list the vertices of an ordered rooted tree.
(c) Huffman’s algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true?
(a) Depth-first search is used to traverse a rooted tree.
(b) Pre-order, Post-order and In-order are used to list the vertices of an ordered rooted tree.
(c) Huffman’s algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true?
Question 2
A cryptarithmetic problem of the type
Can be solved efficiently using
Can be solved efficiently using
Question 3
As per the multiplier theory, an economy is always at:
Question 4
An example of a dictionary-based coding technique is
Question 5
For the transmission of the signal, Blue-tooth wireless technology uses
Question 6
On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks:
123, 874, 692, 475, 105, 376
(Assume SCAN algorithm)
123, 874, 692, 475, 105, 376
(Assume SCAN algorithm)
Question 7
The quantiser in an image-compression system is a
Question 8
The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system
Question 9
Which level of Abstraction describes how data are stored in the data base?
Question 10
Consider a full-adder with the following input values:
(a) and(carry input) = 0
(b) and
Compute the values of S(sum) and (carry output) for the above input values.
(a) and(carry input) = 0
(b) and
Compute the values of S(sum) and (carry output) for the above input values.
Question 11
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G)?
(a) for each vertex of G
(b) edges
(c) for every and not connected by an edge
(a) for each vertex of G
(b) edges
(c) for every and not connected by an edge
Question 12
Eco system is a Frame work for
Question 13
In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible number of basic solutions are
Question 14
Which of the following function has unit elasticity at P = 6?
Question 15
The redundancy in images stems from :
Question 16
A computer system supports 32 -bit virtual address as well as 32 -bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true?
Question 17
A deductive argument is invalid if:
Question 18
In a thesis, figures and tables are included in
Question 19
Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation:
Question 20
Match the following:
List - I
i. Regular Grammar
ii. Context free Grammar
iii. Unrestricted Grammar
iv. Context Sensitive Grammar
List – II
a. Pushdown automaton
b. Linear bounded automaton
c. Deterministic finite
d. Turing machine
List - I
i. Regular Grammar
ii. Context free Grammar
iii. Unrestricted Grammar
iv. Context Sensitive Grammar
List – II
a. Pushdown automaton
b. Linear bounded automaton
c. Deterministic finite
d. Turing machine
- 325 attempts
- 3 upvotes
- 3 comments
Tags :
GATE & PSU CSGeneralFeb 21GATE & PSU CS