Cloud computing question bank series

Objective Type Questions:

1. Which resources are typically provided by an Infrastructure as a Service cloud computing delivery model?

A. applications                  B. virtual machines        C. virtual private networks        D. middleware software stacks

                                                                                

2. Which statement is true about a cloud computing environment?

A. It cannot be used to host location based applications.

B. It enables users to access systems regardless of their location.

C. It introduces latency as the servers are geographically dispersed.

D. It can improve a web server response time by having servers closer to the end user.

Analysis and Design of Algorithm Question bank with objective type

Objective Type Questions:

1. The time complexity of an algorithm quantifies the amount of time taken by an algorithm to run according to ____.

a. number of space                                                                                              b. number of inputs

c. number of outputs                                                                                          d. number of characters

2. Which is not a criterion of algorithm design?

a. Finiteness                                                                                                         b. Durability        

c. Definiteness                                                                                                     d. Efficient

Quiz on Theory of Computation

1.   Which string is not accepted by the following FSA?

                               

      a. 00110                b. 01010                      c. 11010                                           d. 00111

2.   Consider the following language L = {aⁿbⁿ|n ≥ 1} then  L is

      a.  regular              b. CSL but not CFL                c.  CFL but not regular        d. type 0 language but not type 1

Basic Computer quiz

Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
(A) less than 1. (B) less than n.
(C) less than m. (D) less than n/2.
Ans:A

Q.2 Let A be an adjacency matrix of a graph G. The th ij entry in the matrix K A , gives
(A) The number of paths of length K from vertex Vi to vertex Vj.
(B) Shortest path of K edges from vertex Vi to vertex Vj.
(C) Length of a Eulerian path from vertex Vi to vertex Vj.
(D) Length of a Hamiltonian cycle from vertex Vi to vertex Vj.
Ans:B