Sunday, 19 February 2017

HSST Computer Science Solved Paper (SR For SC/ST) 86/2016/OL - Part 4

61.       A variation in the representation of the waterfall model is called
(A) Classic life cycle
(B) V-model
(C) Incremental process model
(D) Spiral model
Answer: B
62.       The most common manifestation of separation of software into separately named and addressable components is called
(A) Concern
(B) Pattern
(C) Modularity
(D) Independence
Answer: C
63.       ............... is an indication of the relative interdependence among modules.
(A) Coupling
(B) Cohesion
(C) Hiding
(D) Refactoring
Answer: A
64.       The diagram which help you to determine the functionality and features of the software from the user's perspective.
(A) Class diagram
(B) Deployment diagram
(C) Sequence diagram
(D) Use-case diagram
Answer: D
65.       ............... testing is focuses on the functional requirements of the software.
(A) White-box testing
(B) Black-box testing
(C) Condition testing
(D) Unit testing
Answer: B
66.       The software metric that provides a quantitative measure of the logical complexity of a program.
(A) Cylcomatic complexity
(B) Defect removal efficiency
(C) Object-oriented metrics
(D) LOC
Answer: A
67.       ............... is the most widely used strategy for statistical quality assurance in industry.
(A) Pareto principle
(B) CMM
(C) Six Sigma
(D) IEEE
Answer: C
68.       .............. is an agile software development approach.
(A) Extreme programming
(B) Quality function deployment
(C) PSPEC
(D) Unified process
Answer: A
69.       ................ provide a notation that translates actions and conditions described in a use case into a tabular form.
(A) Decision tree
(B) Pattern
(C) Linear structures
(D) Decision tables
Answer: D
70.    .............. is a project scheduling method.
(A) PERT
(B) Scrum model
(C) UML
(D) RAD
Answer: A
71.    The bus carries bits between
(A) Microprocessor and Memory
(B) Microprocessor and I/Os
(C) Memory and I/Os
(D) Microprocessor, Memory and I/Os
Answer: D
72.    The Gray code for the binary number 1011102 is
(A) 111101
(B) 111001
(C) 111011
(D) 111010
Answer: B
73.    Simplify the expression AB + A(B + C) + B(B + C) using Boolean algebra techniques is
(A) C + AC
(B) A + AC
(C) B + AC
(D) B + AB
Answer: C
74.    How many 74154 4-line-to-16-line decoders are necessary to decode a six-bit binary number?
(A) One
(B) Two
(C) Three
(D) Four
Answer: B
75.    The binary equivalent for the BCD number 10000101 is
(A) (1010100)2
(B) (1000100)2
(C) (1110100)2
(D) (1010101)2
Answer: D
76.    How many states are there in an eight-bit Johnson counter sequence?
(A) 4
(B) 8
(C) 16
(D) 32
Answer: C
77.    How many clock pulses are required to serially enter a byte of data into an eight-bit shift register?
(A) 8
(B) 16
(C) 32
(D) 64
Answer: A
78.    How many address bits are required for a 2048-bit memory?
(A) 10 bits
(B) 11 bits
(C) 12 bits
(D) 13 bits
Answer: B
79.    How many tracks are there on a typical 5 ½ inch floppy disk?
(A) 64
(B) 67
(C) 77
(D) 87
Answer: C
80.    Visual cryptography is mainly used for
(A) Text encryption
(B) Video encryption
(C) Audio encryption
(D) Image encryption
Answer: D

Saturday, 18 February 2017

HSST Computer Science Solved Paper (SR For SC/ST) 86/2016/OL - Part 3

41.       Dijkstra's banking algorithm in an operating system, solves the problem of
(A) Deadlock recovery
(B) Mutual exclusion
(C) Deadlock avoidance
(D) None of these
Answer: C
42.       Interval between the time of submission and completion of the job is called
(A) Waiting time
(B) Response time
(C) Throughput
(D) Turnaround time
Answer: D
43.       The example of non-preemptive scheduling is
(A) First-Come-First-Served
(B) Round Robin
(C) Last-In-First-Out
(D) Shortest-Job-First
Answer: A
44.       ................. is a process-to-process protocol that adds only port addresses, checksum, error control and length information to the data from the upper layer.
(A) TCP
(B) UDP
(C) IP
(D) None of the above
Answer: B
45.       The RSA algorithm uses a ................ cryptography method.
(A) Public Key
(B) Private Key
(C) Symmetric Key
(D) All the above
Answer: A
46.       The .............. attack is related to confidentiality.
(A) Fabrication
(B) Interception
(C) Modification
(D) Interruption
Answer: B
47.       The cryptography method in which the plaintext BBBB becomes the cipher text BCDE. This is probably
(A) Transposition cipher
(B) Monoalphabetic substitution cipher
(C) Polyalphabetic substation cipher
(D) None of the above
Answer: C
48.       The following service is not provided by digital signature
(A) Integrity
(B) Authentication
(C) Nonrepudiation
(D) Confidentiality
Answer: D
49.       ............... is a technique of temporarily removing inactive programs from the memory of computer system.
(A) Swapping
(B) Spooling
(C) Semaphore
(D) Scheduling
Answer: A
50.    Fence register is used for
(A) CPU protection
(B) Memory protection
(C) File protection
(D) Processor protection
Answer: B
51.    The ................. clause is used to list the attributes desired in the result of a query.
(A) where
(B) from
(C) select
(D) having
Answer: C
52.    We express queries in QBE by
(A) Datalog
(B) Skeleton tables
(C) Entity sets
(D) SQL
Answer: B
53.    .............. is a set of permitted values for each attribute.
(A) Domain
(B) Entity
(C) Constraints
(D) Relationship
Answer: A
54.    Minimal super keys are called
(A) Primary key
(B) Foreign key
(C) Candidate key
(D) Unique
Answer: C
55.    A relation is in ................, every non-key attribute is irreducibly dependent on the primary key.
(A) 1NF
(B) 2NF
(C) 3NF
(D) 4NF
Answer: B
56.    A statement that the system executes automatically when a database related event occurs.
(A) View
(B) Alter
(C) Assertion
(D) Trigger
Answer: D
57.    An index record appears for every Search key value in the file
(A) Dense index
(B) Sparse index
(C) Hash index
(D) Single-key index
Answer: A
58.    In hashing, we use the term to denote a unit of storage that can store one or more records.
(A) Field
(B) Hash function
(C) Index
(D) Bucket
Answer: D
59.    The number of transactions executed in a given amount of time is called
(A) Response time
(B) Waiting time
(C) Throughput
(D) Performance
Answer: C
60.    ................ is a predicate expressing a condition that we wish the database always to satisfy.
(A) Authorization
(B) Deadlock
(C) QBE
(D) Assertion
Answer: D

Friday, 17 February 2017

HSST Computer Science Solved Paper (SR For SC/ST) 86/2016/OL - Part 2

21.       What are units of width and height specified in HTML tag?
(A) Pixels
(B) Bytes
(C) Bits
(D) All of the above
Answer: A
22.       What will be the values of x, m and n after execution of the following statements?
int x, m, n;
m = 10;
n = 15;
x = ++m + n++;
(A) x = 25, m = 10, n = 15
(B) x = 27, m = 10, n = 15
(C) x = 26, m = 11, n = 16
(D) x = 27, m = 11, n = 16
Answer: C
23.       What will be the result of the expression 13 and 25?
(A) 38
(B) 9
(C) 25
(D) 12
Answer: B
24.       Which of the following will produce a value of 22 if x = 22.9?
(A) ceil(x)
(B) log(x)
(C) abs(x)
(D) floor(x)
Answer: D
25.       Which is the legal ways to access a class data member using this pointer?
(A) this.x
(B) *this.x
(C) *(this.x)
(D) (*this).x
Answer: D
26.       Which one of the following is an associative container?
(A) list
(B) queue
(C) map
(D) string
Answer: C
27.       Which one of the following is a sequence container?
(A) stack
(B) deque
(C) queue
(D) set
Answer: B
28.       What does the acronym BCPL stands for?
(A) Basic Combined Programming Language
(B) Basic Compiler Programming Language
(C) Beginners Combined Programming Language
(D) None of the above
Answer: A
29.       What was Ken Thompson's version of C called?
(A) C++
(B) B
(C) P
(D) None of the above
Answer: B
30.    What does the fopen() function return?
(A) address
(B) pointer
(C) file pointer
(D) all of the above
Answer: C
31.    Recursive algorithms are based on
(A) Divide and conquer approach
(B) Top-down approach
(C) Bottom-up approach
(D) Hierarchical approach
Answer: C
32.    The Sorting method which is used for external sort is
(A) Bubble sort
(B) Quick sort
(C) Merge sort
(D) Radix sort
Answer: C
33.    Worst case efficiency of binary search is
(A) log2 n+1
(B) n
(C) 2n
(D) log n
Answer: D
34.    What is the type of the algorithm used in solving the 8 Queens problem?
(A) Dynamic
(B) Backtracking
(C) Branch and Bound
(D) None of the above
Answer: B
35.    The time taken by NP-class sorting algorithm is
(A) O(1)
(B) O(log n)
(C) O(n2)
(D) O(n)
Answer: D
36.    How many nodes are there in a full state space tree with n = 6?
(A) 65
(B) 64
(C) 63
(D) 32
Answer: C
37.    Prims algorithm is based on ............. method.
(A) Divide and conquer method
(B) Greedy method
(C) Dynamic programming
(D) Branch and bound
Answer: B
38.    Graph Colouring is which type of algorithm design strategy
(A) Backtracking
(B) Greedy
(C) Branch and Bound
(D) Dynamic programming
Answer: A
39.    The asymptotic notation for defining the average time complexity is
(A) Equivalence
(B) Symmetric
(C) Reflexive
(D) All of the above
Answer: A
40.    The complexity of merge sort algorithm is
(A) O(n)
(B) O(n2)
(C) O(log n)
(D) O(n log n)
Answer: D