Objective Questions Series 2(11-20)

11) what does 'B' in B tree stands for:                          its "balanced tree"........

12) One can convert a binary tree into its mirror image by traversing it in
(1) postorder
(2) inorder
(3) preorder
(4)any order

post order..inorder gives nodes in ascendng order..., preorder gives depth first ordering...

13) Given the following expressions of a
grammar
E --> E * F / F + E / F
F --> F – F / id
Which of the following is true ?
(A) * has higher precedence than +
(B) – has higher precedence than *
(C) + and – have same precedence
(D) + has higher precedence than *

lower priority operator is alwayas comes at first level and then higher priority and so on .since * and + comes at first level and then - is at next level .hence - is having higher priority then *.

14) The amount of uncertainty in a system of symbol is called
1.Bandwidth
2.Entropy
3.Loss
4.Quantum

15) A 10Base-2 network is limited to
1.20 bytes per data field
2.30 stations per segment
3.40 segments
4.50 feet of cable

16) 76% like UGC exam and 63% like Gate exam; how many like both

76+63-100=39

17) RAID stands for
(1) rapid action in disaster
(2) random access internal disks
(3) rapid application interface design
(4) redundant arrays of independent disks

 

18) Which of the following statements is/are true ?
1 Cache Memories are bigger than RAM
2 Cache Memories are smaller than RAM
3 ROM are faster than RAM
4 Information in ROM can be written by users

19) The graphic method of LP uses
a. Objective function equation
b. Constraint equation
c. linear equations.
d. all of the above

20) In a high resolution mode, the number of dots in a line will usually be ----
1 320
2 640
3 760
4 900

Objective Questions Series 2 (1-10)

1) Partial order set is:
a. Reflexive, Transitive
b. Anti Symmetric
c. Symmetric
d. a and b
e. a and c
f. None

if you consider option e then it will become equivalence set..

 2) The Relation R={(1,2),(2,2),(2,3),(3,3),(3,2),(4,4),(4,2)} is Reflexive (True / False)

false a relation will be reflexive if for all x,(x,x) is present here in R there are (2,2)(3,3)(4,4) but no (1,1) so the relation R is not reflexive

3)A B-tree of minimum degree t has maximum pointer in a node
(1) t-1
(2) 2t-1
(3) 2t
(4)t

4) Unix operating system is an example of
(a) batch os
(b) multi user os
(c) partially multi user os
(d) single user os

5) Which of the following allows a simple email service and is responsible for moving messages from one mail server to another?
A. IMAP B. DHCP
C. SMTP D. FTP
E. POP3

6) Device on one network can communicate with devices in another network via a
1. Hub/Switch
2.utility Server
3. File Server
4. Gateway

7) Congestion control is done by:
1.Network layer
2.Physical Layer
3.Transport Layer
4.Application Layer

8) Which storage device is mounted on 'reels'?
1 Floppy Disk
2 Hard Disk
3 Magnetic Tapes
4 CDROM

9) Consider a relation (A,B,C,D,E,F,G,H).And its Functional Dependencies are ABC ->DE, F->FG, H->G, G->H,ABCD->EF.Here the answer is it is in 2nf.

as you see abc is the candidate key and E,F,G,H are the non prime attributes. so no partial dependency is present here as no proper subset of ABC points to any non prime attribute.and here non key points to another non key(condition of 2nf)and transitive dependency also present F--G , G---H SO ANS IS 2NF

10)which type of links are used for a connection between two DTE devices
1. X.21
2. Frame relay
3. ATM
4. Modem

Objective Questions(121-128)

121. Which combination of the following features will suffice to characterize an OS as a multi-programmed OS ? (A)More than one program may be loaded into main memory at the same time for execution.

(B) If a program waits for certain events such as I/O, another program is immediately scheduled for execution.

(C) If the execution of a program terminates, another program is immediately scheduled for execution.
(A) A (B) A and B
(C) A and C (D) A, B and C

122. Consider a machine with 64 MB physical memory and a 32-bit virtual
address space. If the page size is 4 KB, what is the approximate size
of the page table ?
(A) 16 MB
(B) 8 MB
(C) 2 MB
(D) 24 MB

Size of main memory = 64 MB
Size of virtual memory = 2^32 Bit

No. of pages = 2^32/2^12

= 2^20 pages
Required 1 M enteries.
But each entry has both a virtual address & corresponding physical
address.
Total bits in each entry = 32 + 26 (Physical)
= 58
= 58/8 = 8 Bytes.

So total memory = 8 * 1 MB
= 8 MB

123. An Application Program Interface (API) language is used for

(A) Network Management

(B) Graphical user Interface

(C) Relational Interface in Data Base Management

(D) Database Management System

124. The portion of Windows 2000 operating
system which is not portable is
(A) processor management
(B) user interface
(C) device management
(D) virtual memory management

125. which operator is used for making range checks in queries..?
a. like
b. in
c. between
d. to

126. Consider a set of n tasks with known runtimes r1, r2, ........rn to be
run on a uniprocessor machine. Which of the following processor
scheduling algorithms will result in the maximum throughput ?
(A) Round-Robin
(B) Shortest-Job-First
(C) Highest-Response-Ratio-Next
(D) First-come-First-Served

Here the running times r1 ....rn are already known, single processor
system. In this scenario, throughput i.e. CPU is maximum utilized in
shortest job first scheduling. B is correct

127.page shift keying method is use to modulate digital signal at 9600 bps using 16 level. find the line signals and speed ?
a) 2400 bauds
b) 1200 bauds
c) 4800 bauds
d) 9600 bauds

9600/4 bauds

because in 16PSK, 4 bits can be represented in a single signal so baudrate=bitrate/4

 

128. If there are 10 nodes on a token ring
with a message transmit time of 15
milliseconds, and a token passing
time of 5 milliseconds, what is the
maximum time a token ring station
must wait to transmit a message ?
(A) 20 milliseconds
(B) 15 milliseconds
(C) 180 milliseconds
(D) 200 milliseconds

Objective Questions(111-120)

111. Every Language accepted by TM M2 is also accepted my M1 if
a. M1 head never move left of its initial position
b. M1 never write a blank
c. a and b both

112. Let G is a grammar to ge CNF form we need ________ much time.
a. O(n)
b.(n^2)
c. nLogn
d. None of the above

113. Unix operating system is an example of
(a) batch os
(b) multi user os
(c) partially multi user os
(d) single user os

114. Remote computing services involves the use of time sharing and
(A) Multiprocessing
(b) interactive processing
(c) batch procesing
(d) real time processing

115. Shift reduction parsing using _____ datastructure
a. Array
b. link list
c. Heap
d. stack

116. At a particular time of computation the value of a counting semaphore is 7. Then 20P operationd and 15 V operations were completed on this semaphore. The resulting value of the semaphore is:
(a)42
(b)2
(c)7
(d)1

7-20+15=2......becoz p for - and v for +

117. Where does the swap space reside ?
(A) RAM (B) Disk
(C) ROM (D) On-chip cache

118. What is the maximum length of
CAT-5 UTP cable in Fast Ethernet
network ?
(A) 100 meters (B) 200 meters
(C) 1000 meters (D) 2000 meters

119. Shift reduce parsers are:
a. Bottom up parsers
b. Top down parsers
c. Bottom up for shift and top down for reduce
d. Bottom up for reduce and top down for shift

120. The optimal page replacement algorithm will select the page that
(A) Has not been used for the longest time in the past.
(B) Will not be used for the longest time in the future.
(C) Has been used least number of times.
(D) Has been used most number of times

DBMS Questions(81-90)

81. Which date function is used to find the difference between two dates?

datediff

for Eg: select datediff (dd,'2-06-2007','7-06-2007') output is 5

82..What are the different phases of transaction?

Different phases are

Analysisphase

RedoPhase

Undophase

83. What do you mean by flat file database?

It is a database in which there are no programs or user access languages. It has no cross-filed capabilities but is user-friendly and provides user-interface management.

84... What is a query?

A query with respect to DBMS relates to user commands that are used to interact with a data base. The query language can be classified into data definition language and data manipulation language.

85. What do you mean by Correlated subquery?

Sub queries, or nested queries, are used to bring back a set of rows to be used by the parent query. Depending on how the subquery is written, it can be executed once for the parent query or it can be executed once for each row returned by the parent query. If the subquery is executed for each row of the parent, this is called a correlated subquery. A correlated subquery can be easily identified if it contains any references to the parent

subquery columns in its WHERE clause. Columns from the subquery cannot be referenced anywhere else in the parent query. The following example demonstrates a non-correlated subquery.

E.g. Select * From CUST Where '10/03/1990' IN (Select ODATE From ORDER Where CUST.CNUM = ORDER.CNUM)

86. What are the primitive operations common to all record management systems?

Addition,

deletion

modification.

87. Name the buffer in which all the commands that are typed in are stored

‘Edit’ Buffer

88. What are the unary operations in Relational Algebra?

PROJECTION

SELECTION.

89. Are the resulting relations of PRODUCT and JOIN operation the same?

No.

PRODUCT: Concatenation of every row in one relation with every row in another.

JOIN: Concatenation of rows from one relation and related rows from another.

90.What is RDBMS KERNEL?

Two important pieces of RDBMS architecture are the kernel, which is the software, and the data dictionary, which consists of the system-level data structures used by the kernel to manage the database You might think of an RDBMS as an operating system (or set of subsystems), designed specifically for controlling data access; its primary functions are storing, retrieving, and securing data. An RDBMS maintains its own list of authorized users and their associated privileges; manages memory caches and paging; controls locking for concurrent resource usage; dispatches and schedules user requests; and manages space usage within its table-space structures