HSST Computer Science Solved Paper
Date of Exam : 19.09.2012
Category No. : 111.2010
Alpha Code : C
1. A document preparation software:
(A) FOXPRO (B) ORACLE
(C) LATEX (D) MATLAB
Answer: C
2. A technique in which system resources are shared among multiple users:
(A) Multiplexing (B) Demultiplexing
(C) Modulation (D) Demodulation
Answer: A
3. Interaction modeling cannot be done using:
(A) State Diagrams (B) Use-Cases
(C) Sequence Diagrams (D) Activity Diagrams
Answer: A
4. The number of bits that can be transmitted over a network in a certain period of time:
(A) Latency (B) Delay
(C) Bandwidth (D) Baud
Answer: C
5. Which of these not a markup language?
(A) HTML (B) XML
(C) SGML (D) XGML
Answer: D
6. A network topology that combines features of linear bus and star topology:
(A) Mesh (B) Ring
(C) Tree (D) Cube
Answer: C
7. If language L={0,1}*, then the reversed language LR =
(A) {0,1}* (B) {}
(C) {0}* (D) {1}*
Answer: A
8. In Linux, the subdirectory that contains system configuration files including user passwords:
(A) /boot (B) /usr
(C) /etc (D) /proc
Answer: C
9. SQL command to delete a column from an existing table:
(A) Alter table (B) Drop table
(C) Delete table (D) Delete column
Answer: A
10. A technique not associated with data mining:
(A) Predictive Modeling (B) Link Analysis
(C) Database Segmentation (D) Dimensionality Modeling
Answer: D
11. Memory bank experiencing too much contention from processor:
(A) Fan-in (B) Hot-spot
(C) Thrash (D) Fan-out
Answer: C
12. The number of nodes in a complete binary tree of height n:
(A) 2n-1-1 (B) 2n-1+1
(C) 2n+1-1 (D) 2n+1+1
Answer: C
13. The science and art of breaking ciphers.
(A) Cryptography (B) Steganography
(C) Cryptanalysis (D) Steganalysis
Answer: C
14. A raster scan display system with 24 bits per pixel and a screen resolution of 1024x1024 requires a frame buffer size.
(A) 1 Mega Bytes (B) 3 Mega Bytes
(C) 8 Mega Bytes (D) 24 Mega Bytes
Answer: B
15. Not a parallel programming language.
(A) C* (B) SEQUENT C
(C) nCube C (D) C++
Answer: D
16. Process of mapping a network interface IP address to its hardware address:
(A) ARP (B) RARP
(C) ICMP (D) IGMP
Answer: A
17. For the following sample database table staff:
Staff no
|
Name
|
Designation
|
Branch
|
Salary
|
SL21
|
John
|
Assistant
|
B003
|
30000
|
SG37
|
Ann
|
Supervisor
|
B007
|
42000
|
SL25
|
Julie
|
Assistant
|
B007
|
32000
|
SL52
|
Susan
|
Manager
|
B003
|
51000
|
SG10
|
David
|
Manager
|
B004
|
47000
|
The SQL query: SELECT COUNT(Staff no) AS mycount, SUM(Salary) AS mysum FROM Staff WHERE Designation=’Manager’
Returns the result
(A) mycount=2, mysal=47000
(B) mycount=2, mysal=98000
(C) mycount=5, mysal=47000
(D) mycount=5, mysal=98000
Answer: B
18. Linux partitions are created using the file system:
(A) FAT (B) FAT32
(C) EXT3 (D) NTFS
Answer: C
19. The local area network technology used in Ethernet.
(A) CSMA (B) CSMA/CD
(C) CSMA/CA (D) ALOHA
Answer: B
20. Data abstraction means:
(A) Objects of one class acquire properties of object of another class
(B) Insulation of data from direct access by programs
(C) Code associated with a procedure call is not known until run time
(D) Putting together essential features without including background details
Answer: D
21. A hardware interface that allows for the connection of several peripheral devices to a single PCI board.
(A) SCSI (B) SATA
(C) ATA (D) PCI
Answer: A
22. If n represents the dimension of cube and K, the radix (no. of nodes along each dimensions) then the number of nodes N of a k-ary n-cube network is:
(A) N=nk (B) N=logk n
(C) N=logn k (D) N=kn
Answer: D
23. The output generated by the following C program:
#include<stdio.h>
main()
{
int v=3;
int *pv;
pv=&v;
*pv=0;
printf(“*pv=%d v=%d”,*pv,v);
}
(A) *pv=0 v=0 (B) *pv=0 v=3
(C) *pv=3 v=3 (D) *pv=3 v=0
Answer: A
24. A famous technique used in data warehousing:
(A) OODM (B) OLTP
(C) OLAP (D) ODBC
Answer: C
25. The environment variable in Linux, that contain a list of directories the shell automatically recognizes.
(A) $PATH (B) $ENV
(C) $USER (D) $GREP
Answer: A
26. Not an Anti-virus software:
(A) McAfee (B) Norton
(C) AVG (D) TROJAN
Answer: D
27. The following IP address format refers to:
D31
|
D30
|
D29
|
D28-D8
|
D7-D0
|
1
|
1
|
0
|
NETWORK
|
HOST
|
(A) Class A Addresses (B) Class B Addresses
(C) Class C Addresses (D) Class D Addresses
Answer: C
28. In C++, a pointer that is automatically being passed to a member function during its invocation is:
(A) Base pointer (B) Derived pointer
(C) Virtual pointer (D) this pointer
Answer: D
29. With QBE, inserting records from one or more source tables into a single target table can be achieved by:
(A) Append action query (B) Update action query
(C) Insert action query (D) Make table action query
Answer: A
30. Not an example of a network debugging utility:
(A) ping (B) nslookup
(C) traceroute (D) telnet
Answer: D
31. A secure protocol for personal emails:
(A) SSL (B) PGP
(C) RSA (D) Kerberos
Answer: B
32. If f and g are functions, then f(n)=q(g(n)) if:
(A) f(n)=O(g(n))
(B) f(n)=W(g(n))
(C) f(n)=O(g(n)) or f(n)=W(g(n))
(D) f(n)=O(g(n)) and f(n)=W(g(n))
Answer: D
33. Simplified form of the Boolean expression Y=A’BC’D’+ABC’D’+A’BCD’+ABCD’ is:
(A) C’D’ (B) CD’
(C) BD’ (D) BC’
Answer: C
Explanation:
Y= A’BC’D’+ABC’D’+A’BCD’+ABCD’
=(A’+A)BC’D’+(A’+A)BCD’=BC’D’+BCD’=BD’(C’+C)=BD’
34. The postfix form of the expression (A+B)*C-D/E is:
(A) AB+C*DE/- (B) ABC*+DE/-
(C) ABCDE+*-/ (D) AB+C*DE-/
Answer: A
35. When a process is accessing shared modifiable data, the process is said to be in:
(A) Dead lock (B) Critical Section
(C) Multitasking (D) Context Switching
Answer: B
36. The first MPI function call made by every MPI process is the call to:
(A) MPI_Main() (B) MPI_Wtick()
(C) MPI_Init() (D) MPI_Bcast()
Answer: C
37. The output generated by the following C program does not include the value:
#include<stdio.h>
main()
{
int n=3;
while(n>1)
{
if((n%2)!=1)
n=n/2;
else
n=3*n+1;
printf(“%d\n”,n);
}
}
(A) 5 (B) 6
(C) 8 (D) 16
Answer: B
38. Boundary value analysis is a method for:
(A) White box testing (B) Black box testing
(C) Structural testing (D) Mutation testing
Answer: B
39. Dijkstra’s Banker’s algorithm is used for:
(A) Deadlock Prevention (B) Deadlock Detection
(C) Deadlock Recovery (D) Deadlock Avoidance
Answer: D
40.
(A) Euclidian Law (B) Karnaugh Law
(C) Turing’s Law (D) De Morgan’s Law
Answer: D
41. The language accepted by a Push down Automata:
(A) Type0 (B) Type1
(C) Type2 (D) Type3
Answer: C
42. In parallel algorithm design, the process of grouping tasks into larger tasks in order to improve performance:
(A) Agglomeration (B) Domain Decomposition
(C) Mapping (D) None of these
Answer: A
43. A system call in Linux operating system to create a new child process, which is a copy of the parent process:
(A) access (B) fork
(C) flock (D) exec
Answer: B
44. A preemptive type of process scheduling strategy:
(A) Highest Response Ratio Next Scheduling
(B) Shortest Job First Scheduling
(C) First in First out Scheduling
(D) Shortest Remaining Time Next Scheduling
Answer: D
45. The type of geometric transformation applied to an object for repositioning it along a straight line path from one location to another:
(A) Scaling (B) Rotation
(C) Translation (D) Reflection
Answer: C
46. Vigenere Cipher is a kind of:
(A) Stream Cipher (B) Mono alphabetic Cipher
(C) Poly alphabetic Cipher (D) Block Cipher
Answer: C
47. Recursive Descent Parsers are a type of:
(A) LL parsers (B) LR parsers
(C) LALR parsers (D) SLR parsers
Answer: A
48. The approach used for requirements elicitation in software design and development process:
(A) View Points (B) Interview
(C) Use-Cases (D) All of these
Answer: D
49. The output generated by the following C program
#include<stdio.h>
int Update(int x)
{
static int y=10;
y+=x;
return(y);
}
main()
{
int a,count;
for(count=0;count<3;++count)
{
a=Update(count);
printf(“%d”,a);
}
}
(A) 10 11 12 (B) 10 11 13
(C) 0 1 3 (D) Compilation Error
Answer: B
50. Area on earth where signals of a satellite can be received:
(A) Foot-print (B) Coverage
(C) Range (D) Vicinity
Answer: A
51. A point to point link that supports data flowing in only one direction at a time
(A) Simplex link (B) Half Duplex link
(C) Full Duplex link (D) Leased Line
Answer: B
52. A networking device used to connect similar types of LANs.
(A) Bridge (B) Repeater
(C) Hub (D) Medem
Answer: A
53. A SIM card contain:
(A) Personal Identification Number
(B) International Mobile Subscriber Identity
(C) Authentication key
(D) All of these
Answer: D
54. In the given tree, in what order does the vertices are processed if in-order traversal is used:
(A) ABCDEFGHIJ (B) CBDEAFIHJG
(C) CEDBIJHGFA (D) CBEDAFGIHJ
Answer: B
55. IC 74 LS 138 is a:
(A) NOR gate (B) Decoder
(C) Latch (D) Tri-state Buffer
Answer: B
56. Binary search algorithm employs the strategy of.
(A) Divide and Conquer technique
(B) Dynamic Programming
(C) Branch & Bound technique
(D) Greedy Strategy
Answer: A
57. Dangling-else ambiguity can be eliminated by.
(A) Matching else with nearest if
(B) Matching else with unmatched if
(C) Removing last occurrence of else
(D) Matching else with nearest unmatched if
Answer: D
58. Among the following, a representation that can be used for designing a system as a collection of procedures or modules:
(A) Data flow diagrams (B) Activity Chart
(C) Flow chart (D) ER Modeling
Answer: A
59. In C++, the following statements causes.
#include<iostream.h>
int main()
{
int x=10,y=5;
int* p=&x;
int* q=&y;
p=q;
delete(p);
return (0);
}
(A) p-a dangling reference
(B) q-a dangling reference
(C) Both p and q as dangling references
(D) None of these
Answer: C
60. Conversion from one data type to another data type, inserted automatically by a programming language.
(A) Polymorphism (B) Coercion
(C) Auto Binding (D) Dynamic Binding
Answer: B
61. The process of testing individual components in a software.
(A) Interface Testing (B) Partition Testing
(C) Unit Testing (D) Structural Testing
Answer: C
62. In C++, the operator which cannot be overloaded.
(A) Bitwise & operator (B) Assignment operator
(C) == operator (D) :: operator
Answer: D
63. A solution to external fragmentation.
(A) Segmentation (B) Compaction
(C) Swapping (D) Thrashing
Answer: B
64. A type of inheritance in which the property of one class is inherited by more than one class.
(A) Hybrid Inheritance (B) Hierarchical Inheritance
(C) Multilevel Inheritance (D) Multiple Inheritance
Answer: B
65. The worst case time complexity of merge sort algorithm for input size n.
(A) q(n) (B) q(n2)
(C) q(log n) (D) q(nlog n)
Answer: D
66. A full adder circuit with x, y and z as input bits produces an output, the binary sum represented by.
(A) x+y+z (B) xÅyÅz
(C) xyÅxzÅyz (D) xy+xz+yz
Answer: B
67. If a variable is declared as register type, then the operator that cannot be applied to it.
(A) Unary & (B) Unary -
(C) Binary & (D) Binary -
Answer: A
68. If grammar G=(N,å,P,S) with non terminal N={S}, terminals å={0,1} and production rules.
S®0S, S®S1, S®0, then L(G)=
(A) 0*01* (B) 0*1*
(C) 0*11* (D) 0*1*0
Answer: A
69. What would be the output of the following C program.
#include<stdio.h>
main()
{
int x=1;
while(x<=1);
{
printf(“Good Morning”);
--x;
}
}
(A) Good Morning (B) Good Morning infinite times
(C) Blank Display (D) Syntax Error
Answer: C
70. In a compiler, the task of scanning the source code, to recognize and classify various elements is known as.
(A) Code Optimization (B) Syntactic Analysis
(C) Lexical Analysis (D) Semantic Analysis
Answer: C
71. Time complexity of Prim’s minimum spanning tree algorithm is:
(A) q(n) (B) q(log n)
(C) q(nlog n) (D) q(n2)
Answer: D
72. A fact in prolog is a special case of a:
(A) Query (B) Rule
(C) Term (D) Goal
Answer: B
73. Grammars that can be translated to DFAs:
(A) Left linear grammar (B) Right linear grammar
(C) Generic grammar (D) All of these
Answer: B
74. An example of a compiler-compiler is:
(A) JAVA (B) LEX
(C) YACC (D) MATLAB
Answer: C
75. A relation R on a set X is said to be a partial ordering if R is:
(A) Reflexive, Symmetric, Transitive
(B) Reflexive, Symmetric, Non-Transitive
(C) Reflexive, Anti-Symmetric, Transitive
(D) Reflexive, Anti-Symmetric, Non-Transitive
Answer: C
76. What would be the output of the following C program
#include<stdio.h>
main()
{
int I,x=1,y=1,z=0;
printf(“%d %d”,x,y);
for(I=0;I<3;I++)
{
x+y=z;
printf(“%d”,z);
x=y;
y=z;
}
}
(A) 1 1 2 3 5 (B) 1 1 1 1 1
(C) 1 1 0 0 0 (D) Syntax Error
Answer: D
77. Let V1={A,B,C} and V2={P,Q}, then the graph below is a:
(A) Complete Graph (B) Digraph
(C) Bipartite Graph (D) Connected Graph
Answer: C
78. Natural objects can be realistically modeled using:
(A) Binary space partitioning tree
(B) Fractal Geometry
(C) Octrees
(D) Constructive Solid Geometry
Answer: B
79. Not a storage placement strategy for an incoming program/data:
(A) First Fit (B) Average Fit
(C) Worst Fit (D) Best Fit
Answer: B
80. An attribute or set of attributes within one relation that matches the candidate key of some(possibly the same) relation:
(A) Super key (B) Candidate key
(C) Primary key (D) Foreign key
Answer: D
81. A subset of data in a data warehouse in the form of summary data, related to a particular department or business function:
(A) Meta Data (B) Archive data
(C) Data Marts (D) Operational Data Store
Answer: C
82. In an IP packet, header checksum computes:
(A) 1’s complement sum of 16 bit words in the header without data field
(B) 2’s complement sum of 16 bit words in the header without data field
(C) 1’s complement sum of 16 bit words in the header including data field
(D) 2’s complement sum of 16 bit words in the header including data field
Answer: A
83. A TCP server must prepare to accept a connection attempt from a TCP client by calling the function:
(A) connect() (B) bind()
(C) accept() (D) listen()
Answer: calling listen() and then calling accept()
84. Not a Bernstein’s condition for two processes P1 and P2 executing in parallel on input set I1 and I2, producing output set 01 and 02 respectively.
(A) 01Ç02=F (B) I1Ç02=F
(C) I2Ç01=F (D) I1ÇI2=F
Answer: D
85. The normalization of 1NF relations to 2NF involves:
(A) Removal of partial dependencies
(B) Removal of full dependencies
(C) Removal of transitive dependencies
(D) Removal of multi-valued dependencies
Answer: A
86. The technique used for dimensionality reduction of original data:
(A) Discrete Wavelet transform
(B) Principal Component Analysis
(C) Both (A) and (B)
(D) Neither (A) nor (B)
Answer: C
87. The technique used for producing color displays with random scan CRT monitors:
(A) Beam Penetration (B) Shadow Mask
(C) Direct View Storage (D) Gas-Discharge
Answer: A
Explanation:
Beam Penetration Method
Random scan monitors use Beam penetration method to display colour. It can display only four colours i.e. Red, Green, Orange and Yellow.
Shadow Mask Method
Raster scan monitors use Shadow mask method to display colour. It can display Millions of colours.
88. An objective measure of pattern interestingness in data mining:
(A) Support rule (B) Confidence rule
(C) Both (A) and (B) (D) Neither (A) nor (B)
Answer: C
89. DHCP stands for:
(A) Dynamic Host Configuration Protocol
(B) Dynamic Host Control Protocol
(C) Dynamic Heap Control Protocol
(D) Dynamic Heap Configuration Protocol
Answer: A
90. A static member function can have access to:
(A) Static functions in the same class
(B) Static members in the class
(C) Static members of other classes
(D) Public functions of the same class
Answer: B
91. Hidden terminals in a wireless network may cause:
(A) Delay (B) Collisions
(C) Drain of battery charge (D) Reduction of Signal Strength
Answer: B
92. IC 80287 is:
(A) Graphics Processor (B) Microprocessor
(C) Micro-controller (D) Co-processor
Answer: D
93. The maximum size of main memory of a computer is determined by:
(A) Operating System (B) Address Bus
(C) Data Bus (D) Chipset
Answer: B
94. In computer terminology, POST stands for:
(A) Power Operating System (B) Push Pop Stack
(C) Power On self Test (D) Power Storage
Answer: C
95. SaaS is a popular term in the field of:
(A) Data mining (B) Bioinformatics
(C) Information Security (D) Cloud Computing
Answer: D
96. Not an assembler directive
(A) XCHG (B) ASSUME
(C) SHORT (D) DB
Answer: A
97. In a CDMA system, a code for a certain system should have:
(A) Good auto correlation with other codes
(B) Orthogonality to other codes
(C) High standard deviation
(D) Both (A) and (B)
Answer: D
98. 1 Kilo Bytes refers to:
(A) 1000 Bytes (B) 1024 Bytes
(C) 8000 Bytes (D) 8192 Bytes
Answer: B
99. Tuple in relational algebra refers to:
(A) Row (B) Column
(C) Table (D) Relation
Answer: A
100. A ternary operator in C++
(A) ?: (B) ||
(C) :: (D) .*
Answer: A
Content copied from http://www.pscquestionbank.com/p/kerala-psc-hsst-computer-science-solved.html
ReplyDeleteGet hold of your old books to review past lessons. And more importantly, take time to produce a well-writtenCollege Admission Essay or graduate school admission essay, including MBA essay. essay writing service
ReplyDelete