MH SET 2013: 17 February, Paper II, Computer Science and Applications
Text of page 1
FEB - 37213/II
Computer Science and Applications
Paper II
Time Allowed : 75 Minutes] [Maximum Marks : 100
Note : This Paper contains Fifty (50) multiple-choice questions, each question
carrying Two (2) marks. Attempt All of them.
1. What is the least value of r that 4. The graph in the figure is a portion
can be used to represent any of the Shri Chakra.
non-negative integer n in radix-r
system ?
(A) 0
(B) 1
(C) 10
(D) n
2. In the absence of a comparator, the
Is it :
time complexity of a generate-and-
test type of algorithm to sort n (1) a Planar graph ?
numbers would be of the order : (2) a Hamiltonian graph ?
(A) log n (3) an Eulerian graph ?
(B) n2 (A) 1 and 2
(C) n (B) 2 and 3
(C) 1 and 3
(D) n!
(D) 1, 2 and 3
3. In CRC, which of the following could
be the polynomial, if the code is 5. Which of the following is a valid
11001 ? word of the language (1*(01*01*)*)
U (0*(10*10*)*) ?
(A) 100
(A) 10110010101
(B) 101
(B) 1010101010
(C) 110
(C) 000101010000
(D) 111 (D) 001010001010
1 [P.T.O.
Text of page 2
FEB - 37213/II
6. The number of 2-input NOR gates 10. The function f(x, y, z) = Σ(3, 5, 7) is :
required to produce a 2-input AND (A) xy + yz
(B) x’y + y’z
function is :
(C) xy’ + yz
(A) 1 (D) xz + yz
(B) 2 11. main ( )
{
(C) 3 static int var = 5;
(D) 4 printf(%d”, var--);
if (var)
7. Which of the following logic families
main( );
consumes the least power ? }
(A) TTL The output is :
(A) 43210
(B) DTL
(B) 54321
(C) ECL (C) 0
(D) 5
(D) MOS
12. main ( )
8. (121)5 + (121)4 = {
(A) 57 struct xx
{
(B) 59 int x = 3;
(C) 61 char name[ ] = “hello”
};
(D) 63 struct xx *s;
9. The largest decimal number that printf(“%d”, s->x);
can be represented by 12 bits is : printf(“%s”, s->name);
}
(A) 2047
The output is :
(B) 2048 (A) 3hello
(B) 104ello
(C) 4095
(C) 104hello
(D) 4096 (D) Compiler error
2
Text of page 3
FEB - 37213/II
13. The following is a built in data type 16. The purpose of the Entity-
in C++ : Relationship model is :
(A) struct (A) To provide a conceptual schema
(B) array for database programming
(C) void (B) To provide a conceptual schema
(D) enum for object oriented programming
14. Compile time polymorphism is also (C) To provide a conceptual schema
known as :
for object oriented databases
(A) late binding
(D) To provide a conceptual schema
(B) dynamic binding
for relational databases
(C) static binding
17. Which database normal form
(D) place holder
contains no repeating elements or
15. Which of the statements below are groups of elements ?
true ?
(A) 1 NF
(i) default constructor does not
accept a parameter (B) 2 NF
(ii) constructor can accept a (C) 3 NF
reference to its own class as
parameter (D) 4 NF
(iii) copy constructor is known as 18. CREATE TABLE table_1(id INT);
copy initialization The above SQL statement belongs
(iv) destructor accepts any type of to which of the following languages ?
value as parameter
(A) DDL
(A) i and iii
(B) DCL
(B) i, ii and iii
(C) ii and iii (C) DML
(D) All of the above (D) None of the above
3 [P.T.O.
Text of page 4
FEB - 37213/II
19. UPDATE statement in SQL is used 22. A mathematical model with a
to : collection of operations defined on
(A) Change the table parameters in that model is called :
a database (A) Data Structure
(B) Change the field parameters in
(B) Abstract Data Type
a table
(C) Change the field names in a (C) Primitive Data Type
table (D) Algorithm
(D) Change the field values in a
23. Minimum number of compansons for
table
merging 4 sorted files containing
20. Which of the following statements 50, 10, 25 and 15 records will be :
is not applicable to VIEW in a
database ? (A) 100
(A) A VIEW is a stored query (B) 200
(B) A VIEW is another name for a (C) 175
table in a database
(D) 125
(C) A VIEW can represent subset
of a table 24. A binary tree of depth “d” is an
(D) A VIEW can represent a join almost complete binary tree, if :
of multiple tables. (A) Each leaf in the tree is either
21. If h is any hashing function and is at level “d” or at level “d–1”
used to hash n keys into a table of
(B) For any node “n” in the tree
size m, where n<=m, the expected
number of collisions involving a with a right descendant at level
particular key x is : “d”, all the left descendants of
(A) less than 1 “n” that are leaves, are also at
level “d”
(B) less than n
(C) less than m (C) Both (A) and (B)
(D) less than n/2 (D) None of the above
4
Text of page 5
FEB - 37213/II
25. Which of the following operations 27. Which method increases the signal
for spread spectrum radio by
is performed more efficiently by
transmitting data over several
doubly linked lists than by singly frequencies simultaneously ?
linked lists ? (A) Frequency hopping
(A) Deleting a node whose location (B) Infrared sequencing
is given (C) Direct sequencing
(D) Latent sequencing
(B) Searching an unsorted list for
28. Which of the following is not a
a given item
physical layer encoding scheme ?
(C) Inserting a node after a given (A) Manchester encoding
node (B) X.210
(D) Traversing a list to process each (C) 4B5B
node (D) NRZI (non-return to zero with
invert to ones)
26. Which of the following is used to
29. If there are 10 nodes on a token ring
establish the source-to-destination with a message transmit time of 15
virtual circuit in a connection- milliseconds, and a token passing
time of 5 milliseconds, what is the
oriented packet network ?
maximum time a token ring station
(A) Virtual set up packet must wait to transmit a message ?
(A) 20 milliseconds
(B) Call set up packet
(B) 15 milliseconds
(C) Wireless set up packet
(C) 180 milliseconds
(D) Optical set up packet (D) 200 milliseconds
5 [P.T.O.
Text of page 6
FEB - 37213/II
30. Which of the following is used to 33. The table which is created in pass
trick intruders into thinking that
2 of an assembler is :
they have reached a real network
resource ? (A) Literal table
(A) Honeypots
(B) Base table
(B) Trapper
(C) Symbol table
(C) Eradication
(D) Server authentication (D) None of the above
31. Real time systems are :
34. Macro-operations enable :
(A) primarily used on main-frame
(A) Standardization
computers
(B) used to monitor the events as (B) Object code generation
they occur
(C) (A) and (B)
(C) used for program analysis
(D) used for real-time interactive (D) None of the above
users
35. Which of the following is not an
32. Assembler language :
entry in Symbol table ?
(A) is usually the primary user
interface (A) Symbol
(B) requires fixed format command (B) Value
(C) is a mnemonic form of machine
(C) Length
language
(D) none of the above (D) None of the above
6
Text of page 7
FEB - 37213/II
36. The turnaround time for computer 37. Suppose a workstation has a clock
work is intuitively defined as the cycle of 750 MHz. What is the time
time from when the work is given duration of one cycle ?
to the computer to the time the work
(A) 1.33 microseconds
is completed. In a batch system, the
turnaround time is : (B) 1.33 nanoseconds
(A) The time from when the job is (C) 750 microseconds
submitted, until the time the
(D) 750 nanoseconds
first command in the job
38. Let n be the number of general
specification is completed
registers in a CPU, m be the number
(B) The time from when the medium
of status registers, b be the number
term scheduler allocates
of store operations to save a single
memory until the time the job
register, and K be the amount of
vacates memory
time to perform a store instruction.
(C) The time from when the job is
How long does it take to perform a
submitted, until the time the
context switch ?
results of the job are returned
to the user (A) (n+mb)K
(D) The time from when the job is (B) (n+m)b*K
submitted, until the time the
(C) K + nb + mb
processor is allocated to the first
(D) Knb + m
job
7 [P.T.O.
Text of page 8
FEB - 37213/II
39. The wait time for a process is : 41. Most modern software applications
enable you to customize and
(A) The amount of time a process
automate various features using
needs to be in the running state
small custom built “miniprograms”
before it is completed
called :
(B) The amount of time the process
(A) Macros
spends waiting in the ready
state before its first transition (B) Code
to the running state (C) Routines
(C) The amount of time between the (D) Subroutines
moment a process first enters 42. The make or buy decision is
the ready state and the moment associated with the ..........................
the process exits the running step in the SDLC.
state for the last time
(A) Problem identification
(D) The time the process waits for
(B) Design
all resources to be allocated to
(C) Analysis
it.
(D) Development and Documen-
40. Which symbol will be used with grep
tation
command to match the pattern pat
43. Coding is done during the
at the beginning of a line ?
..................... step in the SDLC.
(A) ^pat
(A) Maintenance
(B) $pat
(B) Design
(C) pat$
(C) Analysis
(D) pat^
(D) Implementation
8
Text of page 9
FEB - 37213/II
44. The model that can be used when 47. Which of the following is relatively
new Operating System in mobile
staffing is unavailable for complete domain ?
implementation by the established (A) Android
dead line is : (B) Symbian
(C) MeeGo
(A) Sequential model
(D) Chrome
(B) Spiral model 48. Consider the following attributes of
electronic payment systems :
(C) Prototype model
(1) Strict security policies
(D) Incremental model (2) Customers’ online accounts
45. One of the drawbacks of waterfall (3) Transactions over secure
servers.
model is :
Which of the attributes above are
(A) Customer gets opportunity to mandatory ?
review the product very late (A) 1 and 2
(B) 1 and 3
(B) It does not help the project
(C) 2 and 3
manager for proper planning
(D) 1, 2 and 3
(C) Partial product is built in the 49. A Data Warehouse contains :
initial stages (A) Transactional Data
(B) Operational Data
(D) Poor documentation
(C) Summary Data
46. Parallel Virtual Machine is a tool (D) Real Time Data
to perform : 50. A message in Windows
programming is actually in the form
(A) Parallel Computing of :
(B) Virtual Computing (A) A character string
(B) A character constant
(C) Cloud Computing
(C) An integer constant
(D) None of the above (D) A float constant.
9 [P.T.O.
Text of page 10
FEB - 37213/II
ROUGH WORK
10Official key not published for this paper.
Page 1 of 10
Source: Savitribai Phule Pune University. Question paper published by Savitribai Phule Pune University.