MH SET 2013: 1 December, Paper II, Computer Science and Applications
Text of page 2
DEC-37213/II 2
Text of page 3
DEC-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
carries Two (2) marks. Attempt All questions.
1. Rook is a piece in chess which travels 3. For which languages given below,
in straight line either vertically or L + = L * ?
horizontally. In how many ways a (i) Null language
rook can go from south-east to north- (ii) Empty language
west corner of 8 × 8 chess board if (iii) L = a*
it travels only upwards or to the (iv) L = aa*
left ? (A) (i) and (ii)
(B) (i) and (iii)
(A) 14P 7 (C) (i), (ii) and (iii)
(B) 14C 7 (D) All of the above
4. The language accepted by the
(C) 27
following DFA where Σ = {0, 1}
(D) 14! is :
2. There are two sections in a question 1 0
paper, each containing 5 questions. 0 1
q0 q1 q2 0, 1
A student is required to answer 6
questions with at least two from
each. In how many ways he/she can (A) Strings containing substring 01
select the questions ? (B) Strings not containing
substring 01
(A) 50
(C) Strings starting with 0 and
(B) 100 ending with 1
(C) 120 (D) Strings starting with 0 and not
ending with 1
(D) 200
3 [P.T.O.
Text of page 4
DEC-37213/II
5. If a planar graph has v vertices, e 8. Simplify : F(A, B,C) = Σ (0, 2, 4, 5, 6)
edges and f faces, then which of the Result would be :
following is true ? (A) f = C' + AB'
(A) v + e = f + 2 (B) f = C + A'B
(C) f = BC + AC'
(B) e + f = v – 2 (D) f = AB' + AB'
(C) e – v + f = 2 9. (201)10 + (101)3 =
(D) v + f = e + 2 (A) 211
(B) 210
6. Given—Ex : x is an earth-like planet (C) 402
Lx : x supports life (D) 1102
10. A 9-bit binary number is converted
Which of the following is equivalent
into its octal equivalent. How many
of “Everything is an earth-like digits the octal number will
planet or nothing is an earth-like have ?
(A) 5
planet.”
(B) 4
(A) ∀x [E x ∨ ~ E x ] (C) 3
(B) ∀x [E x ] ∨ [E x ] (D) 9
11. Predict the output of the following
(C) ~ (∀x) [E x ∨ ~ E x ]
C program :
(D) (A) and (B) but not (C) # include <stdio.h>
7. PMOS transistors in parallel have union A {
char a;
corresponding NMOS transistors in
char b;
series. While PMOS transistors in };
series have corresponding NMOS int main()
{
transistors in parallel. union A a;
This is due to.............................. . a.a = 65;
(A) Moore’s law printf ("%c, %c", a.a, a.b);
return 0;
(B) Amzalde’s law }
(C) De Morgan’s law (A) 65, <garbage value>
(D) Thevenin’s equivalence in the (B) A, A
(C) A, <garbage value>
circuit. (D) syntax error
4
Text of page 5
DEC-37213/II
12. Predict the output of the following 13. Predict the output of the following
C program : C code snippet :
# include <stdio.h>
int nVal1, nVal2;
void foo(int nVal)
float fResult;
{ int i;
if (nVal) nVal1 = 5; nVal2 =2;
{ nVal---- fResult = nVal1/nVal2;
foo(nVal); printf("%F", fResult);
for (i = 0; i<nVal; i ++) printf ("*");
(A) 2.5
} printf(“\n”);
(B) Compilation Error
}
int main() (C) Runtime Error
{ (D) 2
foo(4); 14. With respect to C++ language,
return0; which of the following statement(s)
}
is/ are true for a pointer but not for
(A) *
a reference ?
* *
* * * (i) can be declared without
(B) * * * initialization
* * (ii) can be reassigned
*
(iii) can contain a null value
(C) *
Choose the correct option :
* * *
(A) (i)
* *
(D) * * * (B) (i) and (ii)
* (C) (ii) and (iii)
* * (D) (i), (ii) and (iii)
5 [P.T.O.
Text of page 6
DEC-37213/II
15. Pair the following C++ exceptions 18. The query
with their appropriate purposes : SELECT * FROM EMPLOYEE
Exception Purposes WHERE SALARY > ALL (SELECT
(i) domain_error (a) violation of a SALARY FROM EMPLOYEE
precondition WHERE DNO = 5)
(ii) range_error (b) invalid range generates records from employee
request table which :
(iii) bad_typeid (c) null pointer in (A) may also have few records from
an expression DNO = 5
(iv) out_of_range (d) violation of a (B) also have all records from DNO
postcondition = 5
Choose the correct option : (C) will also have records from
(i) (ii) (iii) (iv) DNO = 5 whose salary is
(A) (a) (d) (c) (b) greater than any other
(B) (a) (b) (c) (d) employees from other
(C) (d) (a) (b) (c) departments
(D) (d) (c) (b) (a) (D) will not have any records from
16. A weak entity type always has : DNO = 5
(A) Partial participation constraint 19. The cascade option for the referential
(B) No participation constraint triggered action of an SQL
(C) Total participation constraint statement can be used with :
(D) Either partial or total (A) CREATE
participation constraint (B) DELETE
17. An attribute Y may be functionally (C) UPDATE
dependent on : (D) Both (B) and (C)
(i) a single attribute X (≠Y) 20. If a data dictionary system is used
(ii) a composite attribute X, Y only by designers, users and
(iii) a composite of many attributes administrators and not by the
Choose the correct option : DBMS, software, it is called as :
(A) (i) (A) active data dictionary
(B) (i) and (ii) (B) passive data dictionary
(C) (i) and (iii) (C) static data dictionary
(D) (i), (ii) and (iii) (D) dynamic data dictionary
6
Text of page 7
DEC-37213/II
21. What is the postfix form of the 24. Statement of purpose (SOP) that is
following prefix expression ?
limited to 150 words in the case of
—A/B * C $ D E
(A) A B C D E $ * / – each student is to be maintained in a
(B) A – B C D E $ * / – file. 1 million students have been
(C) A B C $ E D * / – enrolled in a course. Administrator
(D) A – B C D E $ * /
22. The pre-order and post-order may require accessing an individual’s
traversal of a Binary tree generates record, given a student’s id (i.e. roll
the same output. The tree can have no.). Which of the following
maximum :
organizations will prove better ?
(A) Three nodes
(B) Two nodes (A) Hash table
(C) One node (B) Directly addressed array
(D) Any number of nodes
(C) Binary search tree
23. Step 1 : A circulary linked list C has
been created and initialized with a (D) Sequential file
comma separated list L1 of elements 25. Partially vacant blocks in B+ tree :
<, x, +, y, >, –, <, x, +, y, >, – (A) Cause space inefficiency in the
Step 2 : The nodes with the values
either ‘<’ or ‘>’ are deleted structure
Step 3 : The expression as read from (B) Expedite insertion and deletion
C is evaluated with the conventional in the tree
meanings of the operators ‘+’
(C) Reduce the speed of deletion in
and ‘–’. Which of the following is
true ? the tree
(A) Evaluation in step 3 results in (D) Expedite insertion but reduce
2y – 2x irrespective of the node
the speed of deletion in the tree
from which you start reading of
the data in C 26. The UDP is a.................... and
(B) The expression in C gets ................... protocol.
evaluated to –2y (A) Reliable, connection oriented
(C) The answer remains unchanged
even if I alter the sequence L1 (B) Reliable, connectionless
to L2 : <, x, +, y, >, –, <, x, +, (C) Unreliable, connection oriented
y, <, – (D) Unreliable, connectionless
(D) A and C but not B
7 [P.T.O.
Text of page 8
DEC-37213/II
27. In which of the following 30. As per public key cryptography,
multiplexing the users get turns in
which of the following is not true for
a round-robin fashion, each one
periodically getting the entire the encryption algorithm E and the
bandwidth for a little burst of decryption algorithm D ?
time ? (A) D(E(P)) = P
(A) Frequency division (B) It is highly difficult to deduce
multiplexing
D from E
(B) Time division multiplexing
(C) Amplitude division (C) E cannot be broken by a chosen
multiplexing plain text
(D) Both (A) and (B) (D) E can be deduced using D
28. A packet containing 12 databytes, 31. Nested Macro calls are expanded
where each elementary data size is
using the :
1 byte, gets fragmented after
passing through a network with (A) FIFO rule (first in first out)
maximum packet size of 8 payload (B) LIFO rule (last in first out)
bytes and header. The further (C) FILO rule (first in last out)
fragment after passing through (D) Priority
another network with maximum
32. Resolution of externally defined
packet size of 3 payload bytes and
header. How many fragments are symbols is performed by :
found at the end of both of these (A) Linker
networks ? (B) Loader
(A) 2 (C) Compiler
(B) 4
(D) Editor
(C) 5
(D) 8 33. Which of the following is most
29. In datagram subnet : general phase structured
(A) circuit setup is needed grammar ?
(B) routers hold state information (A) Context-Sensitive
about connections
(B) Regular
(C) congestion control is difficult
(D) quality of service can be (C) Context-Free
ensured (D) Non-regular
8
Text of page 9
DEC-37213/II
34. Which of the following statements 37. The enter_CS() and leave_CS()
is not true for top-down parsers ? functions to implement critical
(A) Grammars containing left section of a process are realized
recursion are unfit for top-down
using test–and–set instruction as
parsing
follows :
(B) Left factoring is essential in
void enter_CS(X)
case of top-down parsers to
avoid backtracking {
(C) Top-down parsers use a parsing ()
table while test–and–set(X);
(D) Top-down parsers make use of }
stack void leave_CS(X)
35. Which of the following rule is not {
required in the shift-reduce parsing X = 0;
of the expression : X = 5 * 7 ?
}
(A) Product ← Product * Value
In the above solution, X is a memory
(B) Product ← Value
location associated with the CS and
(C) Value ← id
(D) Value ← int is initialized to 0. Now consider the
36. Consider a magnetic disk with 100 following statements :
cylinders. The requests to access the (i) The above solution to CS
cylinders occur in the following problem is deadlock-free
sequence : (ii) The solution is starvation free
4, 34, 10, 7, 19, 73, 2, 15, 6, 20 (iii) The processes enter CS in FIFO
Assuming that the head is currently order
at cylinder 50, what is the time
(iv) More than one process can enter
taken to satisfy all requests if it
CS at the same time
takes 1 m to move from one cylinder
Which of the above statements is
to adjacent one and shortest seek
time first policy is used ? true ?
(A) 95 ms (A) (i) only
(B) 119 ms (B) (i) and (ii)
(C) 233 ms (C) (ii) and (iii)
(D) 276 ms (D) (iv) only
9 [P.T.O.
Text of page 10
DEC-37213/II
38. A process executes the following code 40. With respect to system calls in
UNIX, which of the following
for (i = 0; i < n; i + +) fork( );
statement(s) is/are true ?
The total number of child processes
(i) close() frees a file descriptor for
created is : use with some other file.
(A) n (ii) unlink() removes a file name
(B) 2n–1 from the file system
(C) 2 n (A) (i)
(B) (ii)
(D) 2n+1–1
(C) (i) and (ii)
39. Pair the following UNIX commands
(D) Both the statements are false
with their appropriate usage :
41. Coding phase of software product
UNIX Usages development life cycle essentially
Commands involves :
(i) top (a) Rename a file (A) Integration of hardware and
(ii) df (b) Print system software
(B) Integration of feasibility study
usage and
(C) Integration of maintenance
resource log
stage
(iii) mv (c) Estimate free (D) Integration of system
disk space engineering stage
(iv) chmod (d) Change file 42. Customer’s responsibility during the
permissions software development process
includes :
Choose the correct option :
(A) Planning, monitoring and
(i) (ii) (iii) (iv)
control
(A) (a) (b) (c) (d) (B) Providing functional
(B) (b) (c) (a) (d) requirements
(C) (c) (b) (a) (d) (C) Providing the product design
(D) (d) (c) (b) (a) (D) (A), (B) and (C)
10
Text of page 11
DEC-37213/II
43. In a software project management, 48. Which of the following data mining
product life cycle is : application is related to outlier
(A) related to business plan
analysis ?
(B) related to monitoring plan
(A) Market Basket Analysis
(C) related to control plan
(D) related to execution plan (B) Target Marketing
44. Spiral model for software (C) Fraud Detection
development life cycle encourages : (D) Gross Market Analysis
(A) Software reuse 49. Which of the following libraries is
(B) Prototyping
more preferable to develop
(C) Prototyping & software reuse
(D) Combination of parallel and applications for the internet ?
sequential phases (A) Standard C library
45. Which of the following is a tool for (B) STL
data flow analysis ? (C) ATL
(A) Decision table
(D) MFC
(B) Decision tree
(C) Flow chart 50. What is the sequence of message
(D) Data dictionary travel through the following
46. SONET sends.......................frames per components involved in windows
second. environment ?
(A) 1000
(i) WinMain
(B) 2000
(ii) Applications Message Queue
(C) 4000
(D) 8000 (iii) System Level Message Queue
47. At any given time parallel virtual (iv) Windows Procedure
machine (PVM) has ........................ (v) System Level Window
send buffer(s) and ..................receive
Procedure
buffer(s).
(A) (iii) (v) (ii) (i) (iv)
(A) one, one
(B) one, two (B) (i) (iii) (v) (ii) (iv)
(C) two, two (C) (i) (ii) (iii) (iv) (v)
(D) two, one (D) (iii) (ii) (i) (iv) (v)
11 [P.T.O.
Text of page 12
DEC-37213/II
ROUGH WORK
12Official key not published for this paper.
Page 1 of 12
Source: Savitribai Phule Pune University. Question paper published by Savitribai Phule Pune University.