MH SET 2011: 27 November, Paper II, Computer Science and Applications
Text of page 1
NOV - 37211/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. In a transmission of binary digits 0 3. A graph is strongly connected if
and 1, the probability of a bit being for all v i, v j ε G, both the (i, j)
in error is 1/4. If three digits are and (j, i)th cell in the path matrix
transmitted, then the probability of
are :
error-free transmission is :
(A) (0, 0)
(A) 27/64
(B) (1, 0)
(B) 1/64
(C) (0, 1)
(C) 3/4
(D) (1, 1)
(D) 1/4
4. The type-1 grammar corresponds
2. If A and B are subsets of universal
to :
set S, A is a subset of B and
A ≠ B, then : (A) Regular grammar
(A) BC ∩ A = Φ (B) Context free grammar
(B) A ∩ B = B (C) Context sensitive grammar
(C) B ∩ AC = Φ
(D) A general phase structure
(D) B ⊂ (A ∩ B) grammar
1 [P.T.O.
Text of page 2
NOV - 37211/II
5. A non-empty subset S of G is a 8. What is the output of the following
subgroup of <G, *> iff : circuit ?
(A) For all a, b ε S, a * b–1 ε S
(B) For all a, b ε S, a–1 * b ε S
(C) For all a, b ε S, a–1 * b–1 ε S
(A) 0
(D) For all a, b ε S, a * b ε S (B) 1
6. Which of the following logic has the (C) X
maximum Fanout ? (D) X
9. The range of 8 bit 2’s complement
(A) RTL
number expressed in decimal is :
(B) ECL
(A) –127 to +128
(C) NMOS (B) –128 to +127
(D) CMOS (C) –127 to +127
7. Which of the following is a weighted (D) –128 to +128
code ? 10. Which of the following is divisible
by 4 ?
(A) 8421 code
(A) 1001011
(B) Excess-3 code
(B) 1110001
(C) 1248 code (C) 1111001
(D) 5211 code (D) 1010100
2
Text of page 3
NOV - 37211/II
11. Choose the correct output in a typical 13. What will be the output for following
DOS environment :
code ?
void main()
main()
{
{
int c = --2;
printf(“c=%d”, c); static int var = 5;
} printf(“%d”, var--);
(A) 1
if(var)
(B) –2
main();
(C) 2
(D) Compilation Error }
12. Choose the correct output : (A) Compilation Error
#include<stdio.h>
(B) Execution Error
#define a 10
(C) 5 4 3 2 1
main()
{ (D) Stack Overflow
#define a 50 14. Which of the following operators
printf(“%d”, a); cannot be overloaded in C++ ?
} (A) /
(A) Execution error
(B) •
(B) Compilation error
(C) >>
(C) 10
(D) 50 (D) &
3 [P.T.O.
Text of page 4
NOV - 37211/II
15. What will be the output for following 16. In DBMS which normal form
code ?
class base requires multi-valued dependency ?
{
public: (A) 3NF
virtual void baseFun()
{cout<<“from base”<<endl;} (B) BCNF
};
(C) 4NF
class deri:public base
{
(D) 5NF
public:
void baseFun() 17. Which data management language
{cout<<“from derived”<<endl;}
}; component enables the DBA to
void SomeFunc(base *baseObj)
define the schema components ?
{
baseObj->baseFun();
(A) Subschema DLL
}
int main() (B) DML
{
base baseObject; (C) Schema DLL
SomeFunc(&baseObject);
deri deriObject; (D) CREATE
SomeFunc(&deriObject);
18. Non-catastrophic failure is :
}
(A) from base
from derived (A) System crash
(B) from derived
from base (B) Disk failure
(C) from base
from base (C) Physical problem
(D) from derived
from derived (D) Logical error
4
Text of page 5
NOV - 37211/II
19. The physical location of a record is 22. Consider the algorithm :
determined by a mathematical
Guess(A[0....n–1], k){
formula that transforms a record-
A(n–1)=k
key into a record location is :
i=0
(A) A B-tree file
while(A[i]!=k)
(B) A hash file
{
(C) An index file
i=i+1
(D) A sequential file
}
20. In DBMS “SQL%FOUND, SQL%
NOTFOUND, SQL%ROWCOUNT, If(i<n–1)
SQL%ISOPEN” are called as : return i
(A) Implicit cursor attributes else
(B) Explicit cursor attributes return –1
(C) Cursor attributes }
(D) Cursor value The algorithm returns –1, if
21. The value of the expression
(A) k is the first element of the
ABC*+DE*F+G/-, when all variables
array
assume the value 1 (one), is :
(B) k is the last element of the
(A) 0
array
(B) 1
(C) k is the middle element of the
(C) –1 array
(D) 3 (D) k is not in the array
5 [P.T.O.
Text of page 6
NOV - 37211/II
23. If a heap with 11 elements is
25. Merge sort is an example of :
implemented as an array having
(A) Divide and conquer algorithm
subscripts ranging from 1 to 11, the
position of right child of the node at
(B) Dynamic programming algorithm
position three is :
(C) Greedy algorithm
(A) 1
(B) 2 (D) Branch and bound algorithm
(C) 6
26. The ....................... field in the SNMP
(D) 7
PUD, reports an error in a response
24. The in-degrees of the vertices can
message.
be computed from the adjacency
matrix of a directed graph as : (A) Error index
(A) Sum of the diagonal elements
(B) Error status
(B) Sum of the columns
(C) Set request
(C) Sum of the rows
(D) Agent index
(D) Sum of all the elements
6
Text of page 7
NOV - 37211/II
27. Device on one network can 29. The mapping of IP address
communicate with a device on by Ethernet address is done by
...................... protocol.
another network via a :
(A) RIP
(A) Switch
(B) ARP
(B) Utility server
(C) USPF
(C) File server
(D) UDP
(D) Gateway
30. What is the maximum operating
28. The data rate of a ISDN-Basic-
rate of a wireless LAN using infrared
Access-B-Channel is :
communication ?
(A) 32 kbps
(A) 1 mbps
(B) 64 kbps (B) 2 mbps
(C) 144 kbps (C) 5 mbps
(D) 192 kbps (D) 11 mbps
7 [P.T.O.
Text of page 8
NOV - 37211/II
31. Assembler is a/an ........................ 33. ............................ is created in pass 2
of the assembler.
(A) Interpreter
(A) Literal table
(B) Compiler
(B) Symbol table
(C) Preprocessor
(C) Base table
(D) Linker
(D) Top table
32. Which languages are recognized by
34. Which of the following tables is not
the finite state automaton ?
created during Lexical Analysis ?
(A) Regular
(A) Literal table
(B) Context sensitive
(B) Identifier table
(C) Context free
(C) Symbol table
(D) Syntax free (D) Value table
8
Text of page 9
NOV - 37211/II
35. LR parser will generate : 37. The memory allocation schema
(A) Left most derivation subjected to “external” fragmentation
is :
(B) Right most derivation
(A) Segmentation
(C) Left most derivation in
reverse (B) Swapping
(D) Right most derivation in (C) Demand paging
reverse (D) Paged segmentation
36. The main function of dispatcher in 38. “Locality of reference” in memory
the portion of the process scheduler management is :
is :
(A) Page used in the previous page
(A) Swapping a process to disk reference
(B) Assigning ready process to CPU (B) Page used in last few page
(C) Suspending some of the references
processes (C) One of the page existing in
(D) Bring process from the disk to memory
the main memory (D) A page fault
9 [P.T.O.
Text of page 10
NOV - 37211/II
41. Reliability of a software is dependent
39. Distributed system should :
upon :
(A) Meet prescribed time (A) Number of errors present in the
software
constraints
(B) Documentation
(B) Aim better resource sharing (C) Testing suites
(D) Development processes
(C) Aim better system utilization
42. In software metrics, McCABE’S
(D) Aim low system overhead cyclomatic number is given by
following formula :
40. The scheduling policy which is well Note :—
suited for a time-shared operating C = McCABE’S cyclomatic number
e = Number of edges
system is :
n = Number of nodes
(A) Shortest job first p = Number of strongly connected
components
(B) FIFO
(A) C = e – n + 2p
(C) Round robin (B) C = e – n – p
(C) C = e + n + 2p
(D) Last in first out
(D) C = e – n * 2p
10
Text of page 11
NOV - 37211/II
43. Sliding windows concept of software 45. In the software testing process,
project management is :
when is validation testing
(A) Preparation of comprehensible performed ?
plan
(A) during coding
(B) Preparation of the various
(B) during unit testing
stages of development
(C) during module testing
(C) Ad-hoc planning
(D) Requirement analysis (D) during integration testing
44. Software ........................ is work done 46. MPI library cannot be used from one
to enhance software functionality,
of the following C programming
correct errors and improve the
environments :
performance of software.
(A) Visual C++ 6.0
(A) re-design
(B) Turbo C++ 3.0
(B) maintenance
(C) GCC 4.0 for Windows
(C) corrections
(D) re-engineering (D) GCC 4.0 for Linux
11 [P.T.O.
Text of page 12
NOV - 37211/II
47. What is the minimum number 49. Which of the following technology
solution a bank may use to transfer
of fixed-location transceivers
an e-cheque ?
required to be in a cell in a cellular
(A) XML
network ?
(B) EDI
(A) 1
(C) Encrypted e-Mail
(B) 4
(D) WML
(C) 6
50. In MFC programming, an
(D) 8 application’s EXE in ‘Debug’
directory will be ........................ than
48. Internet classifieds follow which
its counterpart in ‘Release’ directory.
e-commerce business model ?
(A) Smaller
(A) B2B
(B) Bigger
(B) B2C
(C) Same size
(C) C2C
(D) Depends upon the nature of
(D) G2B application
12
Text of page 13
NOV - 37211/II
ROUGH WORK
13 [P.T.O.
Text of page 14
NOV - 37211/II
ROUGH WORK
14
Official key not published for this paper.
Page 1 of 15
Source: Savitribai Phule Pune University. Question paper published by Savitribai Phule Pune University.