Showing posts with label BITS Quiz. Show all posts
Showing posts with label BITS Quiz. Show all posts

Data Warehousing - Quiz 3 - BITS WILP - Mtec Software Systems - 2017

Data Warehousing - Quiz 3
BITS WILP - Mtec Software Systems - 2017



1. Which of the following are the characteristic of OLAP.
a)Contains current and historical data
b)Generally read only
c)Very low analytical capabilities
d)Optimization of database for analysis
Choose the correct option
Select one:
a. Only c & d
b. All
c. Only a & b
d. Only a, b & d

Ans: d. Only a, b & d


2.Match the following:
1) B-tree Index        a) Data address in each entry
2) Bitmapped Index    b) Combined data and index segments
3) Clustered Index    c) Data address in each leaf node
Choose the correct option
Select one:
a. 1-c 2-b 3-b
b. 1-b 2-c 3-a
c. 1-c 2-a 3-b
d. 1-b 2-c 3-a

Ans: c. 1-c 2-a 3-b

3. Which of the following is the correct control flow in the case of ROLAP?
Notation: Analytical Server (AS), Desktop Client (DC), RDBMS Server (RS)
Select one:
a. DC -> RS -> AS -> RS -> DC
b. RS -> DC -> AS -> DC -> RS
c. DC -> AS -> RS -> AS -> DC
d. None of the Options

Ans: c. DC -> AS -> RS -> AS -> DC

4. Match the following:
1) ROLAP        a) It makes use of Multidimensional Databases
2) MOLAP        b) It makes use of Relational Databases
3) HOLAP        c) It provides portability to the users
4) DOLAP        d) It makes use of both Relational and Multidimensional databases
Choose the correct option
Select one:
a. 1-b 2-c 3-a 4-d
b. 1-c 2-b 3-a 4-d
c. 1-b 2-a 3-d 4-c
d. 1-c 2-d 3-b 4-a

Ans: c. 1-b 2-a 3-d 4-c

5. Which of the following is not an advantage of B-Tree Indexing
Select one:
a. Ease of maintenance
b. Works well with data with low selectivity
c. Simplicity
d. Good speed of data retrieval

Ans: b. Works well with data with low selectivity

6. Deliberate splitting of a large table and its index data into manageable parts is called ______________
Select one:
a. Indexing
b. Clustering
c. Partitioning
d. Aggregation

Ans: c. Partitioning

7. Which of the following is the remedy that needs to be applied to the data warehouse storing data at lowest level of granularity, so that the queries requiring summary data run faster (if memory is available in plenty)?
Select one:
a. Partitioning
b. Aggregation
c. Indexing
d. Clustering

Ans: b. Aggregation

8. Which below operation is the viewing of cross-tab (Single dimensional) with a fixed value of one attribute
Select one:
a. Slicing
b. Pivoting
c. Both A and B
d. Dicing

Ans: a. Slicing

9. The operation of moving from coarser-granularity data to a finer-granularity is called as ________.
Select one:
a. Pivoting
b. Dicing
c. Rollup
d. Drill down

Ans: d. Drill down

10. Which kind of partitioning will result in same number of columns in each partition but may have different number of rows.
Select one:
a. None of the above
b. Horizontal
c. Both a and b
d. Vertical

Ans: b. Horizontal



Advanced Data Mining - Quiz 3 BITS WILP - Mtec Software Systems - 2017

Advanced Data Mining - Quiz 3
BITS WILP - Mtec Software Systems - 2017


Question 1
What are the stop words mean in a text document.
Select one:
a. Less commonly used words that have high information
b. Punctuation and special symbols
c. Most commonly used words in a text that contribute to no information d. Designated keywords

answer : Most commonly used words in a text that contribute to no information

Question 2
Consider tree mining in a larger tree database. Which of the following kind support does NOT maintain anti monotone property?
Select one:
a. Hybrid
b. Occurance-Based Correct
c. Transactional-Based

answer : Occurance-Based

Question 3
Consider Gibson, David, Kumar algorithm for determining dense subgraph in massive graph. Choose the best suitable choice for fingerprinting in this algorithm.
Select one:
a. Fingerprinting is parameter independent
b. Fingerprinting helps to compute Jaccard Coefficient
c. Fingerprinting can be avoided
d. Fingerprinting reduces comparison time Correct

answer : Fingerprinting reduces comparison time

Question 4
Consider representation of a text data using features. Which one of the following is typically supposed to work best 
Select one:
a. tfidf Correct
b. term document index matrix
c. word wise sorted array
d. term document count matrix

answer : tfidf

Question 5
Which of the following statements are true with respect to hyperlink induced topic search.
Select one or more:
a. Base set contains both the hub and authoritative pages. Correct
b. Authoritative pages cannot point to other pages in the network
c. HUB pages contain data that is searched by user Incorrect
d. Page-rank can only efficiently be defined recursively.

answer : Page-rank can only efficiently be defined recursively., Base set contains both the hub and authoritative pages.

Question 6
Which one of the following is worst representation of a tree database
Select one:
a. DFS
b. Link List
c. Flat File (Text form) Correct
d. BFS

answer : Flat File (Text form)

Question 7
In a social network graph where node represent person and directional edge represent "following" (A is following B). Which of the statement below is true in general. 
Select one:
a. Higher out-degree of a node represents influential person
b. Higher in-degree of a node represents influential person Correct
c. Both A and B
d. None of the above

answer : Higher in-degree of a node represents influential person

Question 8
Consider the following graph.

Determine similarity between node A and B using Jaccard Coefficient.
Select one:
a. 2/6
b. 2/7 Correct
c. 3/8
d. 2

answer : 2/7

Question 9
Extensible Markup Language (XML) is a format to store database in following form
Select one:
a. Sequential
b. Relational
c. Unstructured
d. Hierarchical Correct

answer : Hierarchical

Question 10
Consider a graph representing social network where nodes represent persons and edges to friends. Now consider a 2D matrix A of integers where A[i,j] represents length of the path between node i and j. Let d be the maximum value in the matrix A. 

Since social networks are dynamic in nature. When number of nodes increases in a social network graph what is expected effect on the value of d?
Select one:
a. Value of d is expected to increase
b. Value of d is expected to decrease Correct
c. Value of d is independent of this change
d. None of the above.

answer : Value of d is expected to decrease

Question 11
A system that has denied 5 genuine (right person wanting access) attempts of authentication out of 20. And have allowed 5 imposer attempts (attacker wanting access to the system) out of 15. Has accuracy
Select one:
a. (20/35)*100 %
b. (10/35)*100 %
c. (15/35)*100 %
d. (25/35)*100 % Correct

answer : (25/35)*100 %

Question 12
PK-Means algorithm can sometime provide non optimal clustering
Select one or more:
a. Because of the dependence on initial choice of centroids Correct
b. Because of the dependence on processing done at combiner
c. Because of the dependence on distribution of data on map machines Incorrect
d. Because of the dependence on processing done at reducer

answer : Because of the dependence on initial choice of centroids

Question 13
What is the support of sequence <{1}{3,4}> in following database
  D= <{2,3}{1,3}{3,4,5}>,<{2,5}{1}{3,4,5}>,<{1,5}{2,5}{3}{3,5}{4}>,<{1,5}{2,3,5}{3,4}{1,4,6}>
Select one:
a. 50%
b. 45%
c. 90%
d. 75% Correct

answer : 75%

Question 14
Consider following architecture of a parallel crawler. 

Which part is responsible to implement freshness property
Select one:
a. URL Frontier Correct
b. Parse
c. URL Filter
d. Host Splitter

answer : URL Frontier

Question 15
Handling of Big Data is challenging because of  
Select one:
a. Large number of data points or Volume
b. Data may be from various sources and could have different formatting
c. Data may be continuously arriving that makes processing difficult
d. All of above Correct

answer : All of above

Network Security - Quiz 3 BITS WILP - Mtec Software Systems - 2017

Network Security - Quiz 3
BITS WILP - Mtec Software Systems - 2017 


1. Hash function should be Collision resistance
Select one:
True
False

Ans: True

2. Security of SHA-1 is 160 bits
Select one:
True
False

Ans: True

3. Symmetric key provide non-repudiation.
Select one:
True
False

Ans: False

4. SHA-1 has 80 Rounds
Select one:
True
False

Ans: True

5. Electronic Code Book mode is susceptible to substitution attacks:
Select one:
True
False

Ans: True

6. Secret prefix MAC: m = MACk(x) = h(k||x).
Select one:
True
False

Ans: True

7. Effective key length of 3DES is 112 bits
Select one:
True
False

Ans: True

8. SHA-1 is based on Merkel-Damgard construction
Select one:
True
False

Ans: True

9. Key whitening makes the block ciphers such as DES/AES much more resistant against
brute-force attacks.
Select one:
True
False

Ans: True

10. SHA-1 is key-less hash algorithm
Select one:
True
False

Ans: True

11. Hash function should be one way function
Select one:
True
False

Ans: True

12. Collision Resistance: Given x1 and h(x1), it should be computationally infeasible to find any
x2 such that h(x1) = h(x2).
where h(x1) is hash(x1)
Select one:
True
False

Ans: False

13. Using the meet-in-the-middle attack, the key space is drastically reduced.
Select one:
True
False

Ans: True

14. SHA-1 has 5 stages
Select one:
True
False

Ans: False

15. Secret suffix MAC: m = MACk(x) = h(x||k).
Select one:
True
False

Ans: True

Distributed Computing - Quiz 3 - BITS WILP - Mtec Software Systems - 2017


Distributed Computing - Quiz 3
BITS WILP - Mtec Software Systems - 2017 

1. Which of the following is not a part of Job Management System of a cluster?
Select one:
job scheduler
user server
resource manager
recovery manager

Ans: recovery manager

2. Which of the following is not a semantic index?
Select one:
database key
document name
index given by a hash mechanism
keyword

Ans: index given by a hash mechanism

3. In the Byzantine agreement problem
Select one:
there can be more than one source process
there is no source process
only one process is the source process
all processes are source processes


Ans: only one process is the source process

4. Which of the following is not a feature of P2P networks?
Select one:
self replicating
distributed control
self organizing
anonymity

Ans: self replicating

5. If the total number of faulty processes present in a synchronous system is k, then the recursive formulation of the Byzantine agreement

tree algorithm runs for
Select one:
k + 2 rounds
k + 1 rounds
k rounds
2k rounds

Ans: k + 1 rounds

6. For a Chord ring having n nodes, the local space requirement at each node is
Select one:
O(n2)
O(log n)
O(n)
O(1)

Ans: O(log n)

7. The Byzantine agreement tree algorithm is initiated by
Select one:
a single lieutenant
all commanders
a single commander
all lieutenants

Ans: a single commander

8. In scalable lookup for Chord, the routing table of each node is termed as
Select one:
finger table
search table
lookup table
hash table

Ans: finger table

9. For a list L, the operation head(L) gives
Select one:
the first member of list L
the list L after deleting the last member of L
the list L after deleting the first member of L
the last member of list L

Ans: the first member of list L

10. In context of cluster computing, SSI stands for
Select one:
Single System Image
System Service Interdependence
Synchronous System Infrastructure
Secure System Interaction

Ans: Single System Image

11. In the iterative formulation of the Byzantine agreement tree algorithm for n processes,  each node at level h - 1 of the tree data

structure at a non-initiator has
Select one:
n child nodes
n + h - 1 child nodes
n - h child nodes
n - (h + 1) child nodes

Ans: n - (h + 1) child nodes

12. In the Byzantine agreement problem
Select one:
50% of the processes must agree on a value
50% of the non-faulty processes must agree on a value
all processes must agree on a value
all non-faulty processes must agree on a value

Ans: all non-faulty processes must agree on a value

13. Authenticated messages help
Select one:
in detection of message loss
in detection of forgery
in detection of process failure
in detection of channel failure
Previous pageNext page
Skip Quiz navigation

Ans: in detection of forgery

14. The agreement variable in any agreement algorithm
Select one:
should be multivalued
should be boolean
should be an integer
may be boolean or multivalued

Ans: may be boolean or multivalued

15. Gnutella uses
Select one:
remote indexing
distributed indexing
local indexing
centralized indexing


Ans: local indexing

16. Which type of failure occurs temporarily?
Select one:
permanent failure
transient failure
total failure
unplanned failure

Ans: transient failure

17. In the interactive consistency problem
Select one:
all faulty processes must agree on an array of values
all non-faulty processes must agree on an array of values
all non-faulty processes must agree on a single value
all faulty processes must agree on a single value

Ans: all faulty processes must agree on an array of values

18. Unstructured overlays use
Select one:
centralized indexing
distributed indexing
local indexing
random indexing

Ans: local indexing

19. In a P2P network, the rapid joining and departure of nodes is termed as
Select one:
power law property
churn
scale free property
small world phenomemon

Ans: churn

20. Availability is calculated as
Select one:
MTTF / MTTR
MTTR / (MTTF + MTTR)
MTTF / (MTTF + MTTR)
MTTR / MTTF

Ans: MTTF / (MTTF + MTTR)

21. Expanding ring strategy is a refinement of
Select one:
random walk
flooding
guided search
blind search

Ans: flooding

22. The total number of message types used by Gnutella is
Select one:
5
3
4
6

Ans: 4

23. In the recursive formulation of the Byzantine agreement tree algorithm, the number of parameters present in each oral message is
Select one:
3
5
4
2

Ans: 4

24. In a synchronous system, if there are 19 processes, then the Byzantine agreement problem is solvable if there are
Select one:
at most 6 faulty processes
8 faulty processes
at least 6 faulty processes
7 faulty processes

Ans: at most 6 faulty processes

25. In the consensus problem
Select one:
each process has an initial value
only one process has an initial value
at most 50% of the processes have initial values
at most two processes have initial values

Ans: each process has an initial value

Network Security - Quiz 2 BITS WILP - Mtec Software Systems - 2017

Network Security - Quiz 2
BITS WILP - Mtec Software Systems - 2017

1. "RC4" is a block cipher
Select one:
True
False

Ans: False

2. In Cipher Block Chaining mode any ciphertext block depends on all previous plaintext blocks (except the first block)
Select one:
True
False

Ans: True

3. Electronic Code Book Mode can be parallelize

Select one:
True
False

Ans: True

4. In AES speed of decryption of a ciphertext is same as the speed of encryption of a plaintext when the on-the-fly generation of subkeys is used.

Select one:
True
False

Ans: False

5. In "AES", diffusion is achieved by MixColumn layer only.
Select one:
True
False

Ans: False

6. AES is a modern block cipher with block size 128 / 192 / 256 bits.

Select one:
True
False

Ans: False

7. OTP is unconditionally secure if key is used once.

Select one:
True
False

Ans: True

8. Cipher Block Chaining Mode has Probabilistic approach

Select one:
True
False

Ans: True

9. Electronic Code Book Mode has Deterministic approach

Select one:
True
False

Ans: True

10. Cipher Block Chaining Mode can be parallelize

Select one:
True
False

Ans: False

11. AES is a 128/192/256 key bits cipher.

Select one:
True
False

Ans: True

12. AES have a Feistel structure.
Select one:
True
False

Ans: False

13. In "AES", confusion is achieved in ShiftRows layer
Select one:
True
False

Ans: False

14. "AES" is a block cipher
Select one:
True
False

Ans: True

15. The Electronic Code Book  mode is susceptible to substitution attacks

Select one:
True
False

Ans: True

16. AES layers computations are based on Galois field.
Select one:
True
False

Ans: True

Distributed Computing Quiz 2 - BITS WILP - Mtec Software Systems - 2017

Distributed Computing - Quiz 2
BITS WILP - Mtec Software Systems - 2017 

1. The number of messages exchanged by the Chandy–Misra–Haas algorithm for the AND model in order to detect a deadlock in a distributed system consisting of n sites and m processes is

Select one:
mn
(m(n−1))/2
(n(m−1))/2
(mn)/2

Ans: (m(n−1))/2

2. The ASSIGN_PRIVILEGE routine is executed by

Select one:
Raymond’s Tree-Based Algorithm
Chandy-Misra-Haas algorithm
Maekawa's algorithm
Lamport's algorithm

Ans: Raymond’s Tree-Based Algorithm

3. Which of the following is not an approach for implementing mutual exclusion in distributed systems?

Select one:
quorum-based approach
token-based approach
non-token-based approach
causal-ordering based approach

Ans: causal-ordering based approach

4. For a spanning tree having n nodes, a broadcast procedure requires

Select one:
2n messages
n2 messages
(n -  1) messages
n messages

Ans: (n -  1) messages

5. Which of the following local variables is not used in Synchronous Single-Initiator Spanning Tree algorithm using flooding?

Select one:
child
depth
parent
visited

Ans: child

6. For the single-resource model, maximum out-degree of a node in a WFG can be

Select one:
exactly 2
more than 1
any positive number
at most 1

Ans: at most 1

7. The termination criterion for the Asynchronous Single-Initiator Spanning Tree Algorithm using flooding is

Select one:
(Children ∪ Unrelated) = (Neighbors \ {parent})
Children = Neighbors
(Neighbors ∪ Unrelated) = Children
(Children ∪ Unrelated) = Neighbors

Ans: (Children ∪ Unrelated) = (Neighbors \ {parent})

8. In Lamport's algorithm for implementing distributed mutual exclusion, a site that wants to enter the critical section sends REQUEST messages to

Select one:
a subset of all the sites
all the other sites
only a single specific site
a predesignated leader site

Ans: all the other sites

9. The type of communication used in the Birman-Schiper-Stephenson protocol is

Select one:
convergecast
unicast
multicast
broadcast

Ans: broadcast

10. For a distributed system consisting of k processes, Raynal–Schiper–Toueg algorithm uses SENT arrays each of size

Select one:
k2
2k
k
k x k

Ans: k x k

11. In a distributed system, when a process sends a message to a subset of the processes then the type of communication is called

Select one:
multicasting
convergecasting
unicasting
broadcasting

Ans: multicasting

12. For a distributed system having K sites, the number of messages required by Lamport's algorithm for implementing distributed mutual exclusion per critical section invocation is

Select one:
K - 1
K
2(K - 1)
3(K - 1)

Ans: 3(K - 1)

13. The Chandy–Misra–Haas algorithm for the OR model uses

Select one:
request and response messages
probe messages
inquire messages
query and reply messages

Ans: query and reply messages

14. The synchronization delay for the Ricart–Agrawala algorithm is equal to

Select one:
twice the average message delay
thrice the average message delay
the average message delay
half of the average message delay

Ans: the average message delay

15. Liveness property with regard to causal ordering of messages states that

Select one:
a message that a process decides to send must eventually be sent
a message that arrives at a process must eventually be delivered to the process
a message that is in transit must eventually reach the destination process
a message that is lost during transmission must eventually be retransmitted

Ans: a message that arrives at a process must eventually be delivered to the process

16. For the Asynchronous Single-Initiator Spanning Tree Algorithm using flooding, ACCEPT messages are sent along

Select one:
the back edges
the cross edges
the tree edges
all edges

Ans: the tree edges

17. How many types of messages are used by the Asynchronous Single-Initiator Spanning Tree algorithm using flooding?

Select one:
2
3
5
4

Ans: 3

18. In a distributed system consisting of x processes, the space requirement at each process for the Raynal–Schiper–Toueg algorithm is

Select one:
O(x2) integers
O(x3) integers
O(x) integers
O(x4) integers

Ans: O(x2) integers

19. The system throughput for a distributed mutual exclusion algorithm is defined as

Select one:
the rate at which the system executes requests for the critical section
the rate at which the system sends messages to enable a process to enter the critical section
the rate at which the system receives requests for the critical section
the rate at which a process in the system sends requests for entering the critical section

Ans: the rate at which the system executes requests for the critical section

20. The safety property in context of distributed mutual exclusion algorithms states that

Select one:
at any instant, atmost a certain number of processes can execute the critical section
at any instant, atmost 2 processes can execute the critical section
at any instant, some process should be executing the critical section
at any instant, only one process can execute the critical section

Ans: at any instant, only one process can execute the critical section

21. For handling deadlocks, Maekawa’s algorithm uses the following types of messages

Select one:
REQUEST, FAILED, INQUIRE
REQUEST, REPLY, INQUIRE
FAILED, INQUIRE, YIELD
REQUEST, INQUIRE, YIELD

Ans: FAILED, INQUIRE, YIELD

22. The local space complexity at a node for the Synchronous Single-Initiator Spanning Tree algorithm using flooding is of the order of

Select one:
the degree of edge incidence
the sum of the diameter and the degree of edge incidence
the number of edges of the graph
the product of the number of edges and the number of nodes of the graph

Ans: the degree of edge incidence

23. For which of the algorithms for implementing distributed mutual exclusion, each process maintains a request-deferred array?

Select one:
Maekawa’s algorithm
Lamport's algorithm
Ricart–Agrawala algorithm
Suzuki–Kasami’s broadcast algorithm

Ans: Ricart–Agrawala algorithm

24. The number of rounds that are executed in the Synchronous Single-Initiator Spanning Tree algorithm using flooding is equal to

Select one:
the number of edges in the graph
the length of the longest path in the graph
the diameter of the graph
the number of nodes in the graph

Ans: the diameter of the graph

25. Which of the following type of multicast algorithm uses a token?

Select one:
communication history-based algorithm
moving sequencer algorithm
fixed sequencer algorithm
destination agreement algorithm

Ans: moving sequencer algorithm

Data Warehousing - Quiz 2 BITS WILP - Mtec Software Systems - 2017

Data Warehousing - Quiz 2
BITS WILP - Mtec Software Systems - 2017

1.Dimension table is related to fact-table in which kind of relationship?
Select one:
a. one-to-one.
b. many-to-many.
c. one-to-many.
d. many-to-one.

Ans: b. many-to-many.

2.Snowflake schema is more normalized compared to star schema.
Select one:
a. True
b. False

Ans: a. True

3.In case of Retail Store Database, Customer Dimension is which kind of dimension?
Select one:
a. Junk Dimension
b. Slowly Changing Dimension
c. Rapidly Changing Dimension
d. Miscellaneous Dimension

Ans: b. Slowly Changing Dimension



4.Which of the following is/are not data transformation task(s)?
Select one:
a. Conversion
b. Selection
c. Rearrangement
d. Reduction

Ans: d. Reduction

5.Data loading requires data warehouse to be in offline mode.
Select one:
a. False
b. True

Ans: a. False

6.Which of the following is not one of the principles pertaining to Type-2 change?
Select one:
a. There is a need to preserve history in Data Warehouse.
b. They ae used to compare performance across the transitions.
c. This type of change partitions the history in the Data Warehouse.
d. Every change for the same attribute must be preserved.

Ans: b. They ae used to compare performance across the transitions.

7.In this technique of Data Loading, if primary key of incoming record matches with that of some already existing record, matching target record is updated
Select one:
a. Destructive Merge
b. Load
c. Constructive Merge
d. Append

Ans: a. Destructive Merge

8.Immediate extraction of data using special stored procedures that are fired when certain pre-defined events occur is called _____________
Select one:
a. Capture through Transaction Logs
b. Capture through Database Triggers
c. Capture based on date and timestamp
d. Capture in Source Application

Ans: b. Capture through Database Triggers

9.The type of key that does not have any built-in meaning and is simply system generated sequence numbers is ________________
Select one:
a. Surrogate Key
b. Concatenated Primary Key
c. Primary Key
d. Foreign Key

Ans: a. Surrogate Key

10.Which of the following is NOT a fully additive measure?
Select one:
a. Products returned
b. Percentage of profit
c. Revenue generated in rupees
d. Products ordered

Ans: b. Percentage of profit

Advanced Data Mining - Quiz 2 BITS WILP - Mtec Software Systems - 2017


Advanced Data Mining - Quiz 2
BITS WILP - Mtec Software Systems - 2017

Question 1
Which of the following is expected to be more compact in general.
Select one:
 a. CAN-Tries
 b. CATS-Tree
 c. FP-Tree
 d. CAN-Tree

Ans:  a. CAN-Tries

Question 2
Consider data mining operation on a database that keeps changing. Assume there are M number of items in the database and after some time M1 number of items expires and M2 number of new items joins the database. An incremental data mining algorithm would be called efficient if it takes
Select one:
 a. Order of M1+M2 time to update its mining result
 b. Order of M time to update its mining result
 c. Order of M2 time to update its mining result
 d. Order of M+M1+M2 time to update its mining result
 e. Order of M1 time to update its mining result

Ans:  a. Order of M1+M2 time to update its mining result

Question 3
Which of the following algorithm could produces clusters of arbitrary shape and size. (Hint: half moon is an arbitrary shape)
Select one or more:
 a. k-Means
 b. DBSCAN
 c. PAM
 d. Single Link

Ans:  b. DBSCAN , c. PAM

Question 4
Consider the paper entitled "Mining Frequent Patterns without Candidate Generation". This paper introduces which of the following algorithm
Select one:
 a. CATS-Tree
 b. CP-Tree
 c. FP-Tree
 d. CAN-Tree

Ans:  c. FP-Tree

Question 5
Incremental DBSCAN scan algorithm does not update the clustering after a single update instead it waits till some adequate number of transactions (datum point) arrive and depart. This step helps to minimize the sensitivity of DBSCAN algorithm on parameters such as eps and  min-pts.
Select one:
 True
 False

Ans:  True

Question 6
Incremental DBSCAN uses a special data structure to answer neighborhood queries called
Select one:
 a. Splay-Tree
 b. B-Tree
 c. AVL-Tree
 d. None of above

Ans :  d. None of above

Question 7
Consider association rule mining that involves the discovery of frequent itemsets based on support and confidence parameters. Negative border set can help in
 a. Reducing number of database scans
 b. Reducing the number of candidate itemsets
 c. Efficient computation of support of a candidate itemset
 d. Speed up in the process of construction of k+1 item sets from k itemsets

Ans:  a. Reducing number of database scans

Question 8
Consider difference estimation for large itemsets (DELI) algorithm. State which of the following is NOT trure
Select one:
 a. It does not process all the items.
 b. Its result could sometime be wrong and the probability of mistake could NOT be bounded
 c. Uses bell curve to build confidence interval
 d. This algorithm uses statistical technique

Ans:  b. Its result could sometime be wrong and the probability of mistake could NOT be bounded

Question 9
Consider a N-3 size data stream of positive integers where all the items are different and the maximum integer value in the stream is N. Assume that the stream is not sorted. Suppose your task is to device and algorithm to determine the numbers missing integers in the stream.
Select one:
 a. Any such algorithm would need to store N-3 numbers in the memory
 b. At least four integers need to be stored in the memory
 c. It is sufficient to have storage of two items
 d. None of the above

Ans:  a. Any such algorithm would need to store N-3 numbers in the memory


Question 10
Which of the following statement about k -Means clustering algorithm is FALSE
 a. It is suited for wide verity of problems and can be applied to evolving databases
 b. It is used for clustering
 c. Value of k is very important parameter and is supplied by the user only.
 d. Cluster label for an data point is determined by its centroid.

Ans:  a. It is suited for wide verity of problems and can be applied to evolving databases

Network Security - Quiz 1 - BITS WILP - Mtec Software Systems - 2017

Network Security - Quiz 1
BITS WILP - Mtec Software Systems - 2017

1. Cryptography provides security through obscurity.
Select one:
 True
 False

Ans: False

2. Security level of the cipher  does not increases by multiple substitution encryption.
Select one:
 True
 False

Ans: True

3. There are 8 equivalence class for the modulus 7
Select one:
 True
 False

Ans: False

4. In a symmetric cipher, different key are used by  the sender and receiver.
Select one:
 True
 False

Ans: False

5. Range of possible values used to construct keys is called key space.
Select one:
 True
 False

Ans: True

6. Security Services integrity assures that data received is a as sent by an authorized entity.
Select one:
 True
 False

Ans: True

7. There are 5 equivalence class for the modulus 5
Select one:
 True
 False

Ans: False

8. In symmetric cipher same key is used by  the sender and receiver.
Select one:
 True
 False

Ans: True

9. Security services authentication assures that the communicating entity is the one claimed.
Select one:
 True
 False

Ans: True

10. Security level of the encrypted message increases by multiple encrypting the message with a substitution cipher.
Select one:
 True
 False

Ans: False

11. Stream ciphers encrypt bits individually.
Select one:
 True
 False

Ans: True

12. Security level of the cipher  does not increases by multiple substitution encryption.
Select one:
 True
 False

Ans: True

13. Plaintext is the data before transformation.
Select one:
 True
 False
Ans : True

14. According to kerchoff's principle, a cryptosystem should be secure even if the attacker knows all details about the system, with the exception of the secret key.
Select one:
 True
 False

Ans: True

15. The ciphertext is the message after transformation.
Select one:
 True
 False

Ans: True

16. Security services non-repudiation protect against denial by one of the parties in a communication.
Select one:
 True
 False

Ans: True

17. A cryptosystem is unconditionally secure if it cannot be broken even with infinite computational resources.
Select one:
 True
 False

Ans: True

18. There are 7 equivalence class for the modulus 8
Select one:
 True
 False

Ans: False


19. According to kerchoff's principle, the attacker should not know the encryption and decryption algorithm.
Select one:
 True
 False

Ans: False

20. Stream ciphers encrypt bits individually.
Select one:
 True
 False

Ans: True

Distributed Computing Quiz 1 BITS WILP - Mtec Software Systems - 2017

Distributed Computing Quiz 1
BITS WILP - Mtec Software Systems - 2017 

1. Consider the following statements:

(i) Middleware provides interoperability among distributed objects.

(ii) Middleware is independent of hardware platforms.

(iii) Middleware is dependent on operating systems.

Which of the following is true?

Select one:
a. (i) only
b. (iii) only
c. (i), (ii) and (iii)
d. (i) and (ii)

Ans: (i) and (ii)

2. The master variable used in the Spezialetti–Kearns algorithm denotes the

Select one:
a. identifier of the process that initiated the algorithm
b. identifier of the process that has received a marker
c. identifier of a process that has already recorded its snapshot
d. identifier of the process that has received a marker along each of its incoming channels

Ans: identifier of the process that initiated the algorithm

3. The number of stages in a 64-input and 64-output Omega network is

Select one:
4
8
6
16

Ans: 6

4. Which of the following statement is false in context of Lai-Yang algorithm?

Select one:
every process is initially white
a message sent by a white process is colored white
a message sent by a red process is colored red
a process turns red when it receives a marker

Ans: a process turns red when it receives a marker


5. A cut is inconsistent if

Select one:
more than one message cross the cut from the FUTURE to the PAST
any message crosses the cut from the PAST to the FUTURE
at least one message crosses the cut from the FUTURE to the PAST
no message crosses the cut

Ans: at least one message crosses the cut from the FUTURE to the PAST

6. denotes


Select one:
the set of events that have occurred at process pj
the yth event that has occurred at process pj
the yth internal event that has occurred at process pj
the event at process pj whose time duration is y units

Ans: the yth event that has occurred at process pj

7. For two events a and b having vector timestamps vx and vy respectively, if a causally affects b, then

Select one:
vx = vy
vx > vy
vx || vy
vx < vy

Ans: vx < vy

8. Global state of a distributed system is

Select one:
a collection of the local states of the channels only
a collection of the local states of the processes and the channels
a collection of the local states of the processes only
a collection of the local states of a set of empty channels

Ans: a collection of the local states of the processes and the channels

9. Which of the following properties is not satisfied by scalar clocks?

Select one:
strong consistency
total ordering
consistency
event counting

Ans: strong consistency

10. How many processing modes are defined in Flynn's taxonomy?

Select one:
5
6
3
4

Ans: 4

11. Which of the following is true?

Select one:
send(mij) ∉∉ LSi ⇒ mij ∉∉ SCij ⊕⊕ rec(mij)  ∉∉ LSj

 send(mij) ∉∉ LSi ⇒ mij ∉∉ SCij

 send(mij) ∉∉ LSi ⇒ mij ∉∉ SCij ∧ rec(mij)  ∉∉ LSj


send(mij) ∉∉ LSi ⇒ mij ∉∉ SCij ∨∨ rec(mij)  ∉∉ LSj


Ans: send(mij) ∉∉ LSi ⇒ mij ∉∉ SCij ∧ rec(mij)  ∉∉ LSj

12. Which of the following is true of the UMA model?

Select one:
software is very loosely coupled
interconnection network to access memory may be a multistage switch
processors are of different types
each processor runs a different operating system

Ans: interconnection network to access memory may be a multistage switch

13. A system supporting causal ordering model satisfies

Select one:
for messages mij and mkj , if send(mij) → rec(mkj), then rec(mij) → send(mkj)
for messages mij and mik , if send(mij) → send(mik), then rec(mij) → rec(mik)
for messages mij and mkj , if send(mij) → send(mkj), then rec(mij) || rec(mkj)
for messages mij and mkj , if send(mij) → send(mkj), then rec(mij) → rec(mkj)

Ans: for messages mij and mkj , if send(mij) → send(mkj), then rec(mij) → rec(mkj)

14. The number of processor and memory units in a 5-dimensional hypercube is

Select one:
16
32
25
64

Ans: 32

15. A global state is strongly consistent iff the global state

Select one:
is consistent and transitless
follows the FIFO model
is transitless
follows the causal ordering model

Ans: is consistent and transitless

16. Concurrency of a distributed program is defined as

Select one:
the ratio of the number of local operations to twice the total number of operations
the ratio of the total number of operations to twice the number of local operations
the ratio of the number of local operations to the total number of operations
the ratio of the total number of operations to the number of local operations

Ans: the ratio of the number of local operations to the total number of operations

17. The system of vector clocks is strongly consistent if


Select one:
the dimension of vector clocks is one less than the total number of processes in the distributed computation
the dimension of vector clocks is at least equal to the total number of processes in the distributed computation
the dimension of vector clocks is half of the total number of processes in the distributed computation
the dimension of vector clocks is one third of the total number of processes in the distributed computation

Ans: the dimension of vector clocks is at least equal to the total number of processes in the distributed computation

18. The termination criterion for the Chandy-Lamport global snapshot recording algorithm is that
Select one:
each process has received a marker on all of its incoming channels
each process has sent a marker to every other process
each process has received a marker from each of the other processes
each process has sent a marker on all of its outgoing channels

Ans: each process has received a marker on all of its incoming channels

19. Which of the following is false for a distributed system?

Select one:
has no shared memory
communicate using message passing
individual computers may be connected via LAN or WAN
has a common clock

Ans: has a common clock

20. CORBA stands for

Select one:
Cyclic Obfuscated Request Broker Architecture
Creative Object Request Broker Architecture
Common Object Request Broker Architecture
Coordinated Online Request Broker Architecture

Ans: Common Object Request Broker Architecture

21. For Butterfly and Omega networks, paths from different inputs to any one output constitute a

Select one:
loop
forest
spanning tree
cycle

Ans: spanning tree

22. ei →→ ej  denotes that


Select one:
ei only directly causally affects ej
ei and ej are concurrent
ej directly or transitively causally affects ei
ei directly or transitively causally affects ej

Ans: ei directly or transitively causally affects ej

23. For an n-input and n-output Omega network, output i of a stage is connected to input j of next stage if j = 2i + 1 - n for

Select one:
n/2 < i < n - 1
n/2 < i < n
n/2 <= i <= n - 1
n/2 <= i <= n

Ans: n/2 <= i <= n - 1

24. The number of switches in a single stage of an n-input and n-output Butterfly network is

Select one:
n
n/4
2n
n/2

Ans: n/2

25. A system of logical clocks is strongly consistent if the following condition is satisfied

Select one:
for 2 events ei and ej, ei →→  ej ⇔⇔ C(ei) >= C(ej)

 for 2 events ei and ej, ei →→  ej ⇔⇔ C(ei) = C(ej)

 for 2 events ei and ej, ei ||  ej ⇔⇔ C(ei) < C(ej)

 for 2 events ei and ej, ei →→  ej ⇔⇔ C(ei) < C(ej)

 Ans: for 2 events ei and ej, ei →→  ej ⇔⇔ C(ei) < C(ej)

Data Warehousing - Quiz 1 - 2017 BITS WILP - Mtec Software Systems

Data Warehousing - Quiz 1 
BITS WILP - Mtec Software Systems - 2017 

1_________ component involves purging source data that is not useful and separating out source records into new combinations.
Select one:
 a. Source Data
 b. Data Staging
 c. Management and Control
 d. Data Storage

 Ans : b. Data Staging

2 ______ is the navigational map of the data warehouse.
Select one:
 a. Operational Metadata
 b. Extraction Metadata
 c. End-User Metadata
 d. Transformation Metadata

 Ans: c. End-User Metadata

3)Strategic information IS NOT used for which for the following purpose?
Select one:
 a. formulate the business strategies
 b. Increase the customer base
 c. process business transactions (e.g., generate invoice, payments, orders, etc.)

 Ans: c. process business transactions (e.g., generate invoice, payments, orders, etc.)

4). __________ are either identical or strict mathematical subsets of the most granular, detailed dimension.
Select one:
 a. Factless Fact Tables
 b. Conformed Facts
 c. Conformed Dimensions
 d. Degenerate Dimensions

 Ans : c. Conformed Dimensions

5)One of the primary benefits of ___________ keys is that they buffer the data warehouse environment from operational changes.
Select one:
 a. None of the Options
 b. Foreign
 c. Natural
 d. Surrogate

 Ans: d. Surrogate

6).In a dimension table ________ conveys the level of detail associated with the fact table measurements.
Select one:
 a. grain
 b. attribute
 c. dimension
 d. metadata

 Ans: a. grain

 7)The precursors required to load the data into the data warehouse presentation area are:
Select one:
 a. Combining data from multiple sources
 b. All the options
 c. Deduplicating data
 d. Cleansing the data

 Ans: b. All the options

 8)What is / are the feature/ features of Data Warehouse?
Select one:
 a. Data Granularity
 b. Time - Variant Data
 c. Nonvolatile Data
 d. All of the Options

 Ans: d. All of the Options

 9).____________ modeling is a design technique that seeks to remove data redundancies.
Select one:
 a. 1NF
 b. 3NF
 c. 2NF
 d. BCNF

 Ans: b. 3NF

 10) ____________ is a systematic process for capturing, integrating, organising and communicating knowledge accumulated by employees.
Select one:
 a. Agent Technology
 b. Multidimensional Analysis
 c. ERP
 d. Knowledge Management

 Ans : d. Knowledge Management




Advanced Data Mining - Quiz 1 BITS WILP - Mtec Software Systems - 2017

Advanced Data Mining - Quiz 1
BITS WILP - Mtec Software Systems - 2017

1. Identify the most appropriate statement about evolutionary streams:
Select one:
a. Number of clusters can be fixed
b. Data come from one side and exit from the other side
c. Role of outliers and clusters may change
d. Data may come from many channels

Answer: Role of outliers and clusters may change

2. Identify FALSE statement about point-wise and batch-wise incremental DBSCAN:
Select one:
a. Both are producing same sets of clusters and are same as that of DBSCAN
b. Batch-wise incremental DBSCAN is faster than that of point-wise incremental DBSCAN if more number of overlapping clusters are present in new data
c. The process of addition of points in R-trees is same in both
d. Both are not suitable for mining data streams

Answer : Batch-wise incremental DBSCAN is faster than that of point-wise incremental DBSCAN if more number of overlapping clusters are present in new data

3. Consider FM-­Sketch algorithm discussed in the class. It determine number of distinct items over a data stream. Assuming, availability of only sub­linear space for the computation and the hash function used as below

                 h(x) = (5.x.x+6) mod 53

Determine the bit values of FM-Sketch after processing following data stream

      83, 63, 36, 14, 24, 57, 78, 57, 57, 24, 14, 36, 14, 36, 14, 36, 57, 57, 14, 23, 57, 36, 23, 24, 57, 14, 78, 57, 78, 83, 63, 36, 23, 14, 24

Assume size of FM­-Sketch to be 8­bit, and least significant position to at extreme right.
Select one:
a. 00101101
b. 00101011
c. 00101111
d. 00110101
e. 01100111

Answer : 00101101


4. The most import key feature of SWF is
Select one:
a. Use of phases
b. Use of Partial_min_sup
c. Use of sliding window model
d. Use of progressive Candidate itemsets

Answer : Use of Partial_min_sup

5. Identify correct statement about batch-wise incremental DBSCAN:
Select one:
a. Its equivalent to update existing clusters by processing new batch cluster by cluster
b. Finding intersection process is very costly procedure
c. Cost of finding clusters in new batch can always be compensated
d. It is equivalent to point-wise incremental DBSCAN if most of the points in the new batch are intersection points

Answer : It is equivalent to point-wise incremental DBSCAN if most of the points in the new batch are intersection points

6. Data Mining is a tool for knowledge discovery in databases (KDD). It is not related to
Select one:
a. Determining statistics about new data items
b. Highlighting outliers
c. Interpreting contents of data
d. Management of the data

Answer : Management of the data

7. Identify the statement which always holds true about incremental DBSCAN:
Select one:
a. Every time a split case may not split two clusters
b. An addition of a point will change density property of the neighboring points
c. A point added in in lesser dense region will be noise point
d. An addition of a point can cause merging of two clusters

Answer : Every time a split case may not split two clusters

8. Addition of a point in incremental DBSCAN:
Select one:
a. affects all density reachable points
b. can change core property of the points in 2-epsilon region of the point
c. affects all density connected points
d. can change core property of the points in an epsilon region of the point

Answer : can change core property of the points in an epsilon region of the point

9. Identify correct statement:
Select one:
a. Processing time for incremental updates should be proportional to the size of the increment
b. Incremental mining is easier than stream mining because it is just reapplying a mining algorithm on the whole dataset
c. There are not many applications where incremental updates are required
d. Bulk updates are always better than point wise updates

Answer : Processing time for incremental updates should be proportional to the size of the increment

10. Identify correct statement about CATS tree:
Select one:
a. The tree is optimally sized tree
b. Its construction cost is higher than CAN tree
c. Siblings are ordered by global support
d. Ordering of items within paths from roots to leaves are ordered by global support

Answer : Its construction cost is higher than CAN tree

Data Warehousing Quiz 3 BITS WILP - Mtec Software Systems


Data Warehousing Quiz 3
BITS WILP - Mtec Software Systems

1. Theoretically, what kind of views we can materialize?
Select one:
a. Any kind of view can be materialized
b. Only involving joins &amp; aggregates
c. Only involving joins
d. Only involving aggregation

Ans: a. Any kind of view can be materialized

2. For partitioning wrt time dimension, which kind of partitioning method is most suitable
Select one:
a. Hash partitioning
b. Composite partitioning
c. Range partitioning
d. List partitioning

Ans: c. Range partitioning

3. User queries and application programs need not be aware of
Select one:
a. Existing partitions only
b. Existing partitions, aggregates, and materialised views
c. Existing aggregates only
d. Existing materialized views only

Ans: b. Existing partitions, aggregates, and materialised views

4. Online aggregation:
Select one:
a. Improves query performance
b. Uses blocking algorithms for evaluating relational operators
c. Does not allow users to prioritise
d. Provides early trends

Ans: d. Provides early trends

5. Size of the bitmap index on a column of a relation R increases with
Select one:
a. An increase in number of attributes of R
b. An increase in column cardinality
c. An increase in the width of the column
d. An increase in number of queries on R

Ans: b. An increase in column cardinality


6. The most generalized term:
Select one:
a. Precomputed joins
b. Precomputed joins with aggregates
c. Precomputed aggregates
d. Materialized views

Ans: c. Precomputed aggregates

7. A query performance enhancing technique that has the least space
overheads:
Select one:
a. View materialization
b. Aggregations
c. Bitmap indices
d. Partitioning

Ans: d. Partitioning

8. Bitmap indexes are:
Select one:
a. Multidimensional indexes
b. Dynamic indexes
c. Multilevel indexes
d. Dense indexes

Ans: a. Multidimensional indexes

9. The aggregate navigation algorithm orders the base and aggregated
fact tables from
Select one:
a. Smallest to the biggest in terms of space requirement
b. Most frequently used to least frequently used
c. Smallest to the biggest in terms of number of tuples
d. 3-way to 2-way to 1-way to base level

Ans: c. Smallest to the biggest in terms of number of tuples

10. Aggregate navigator is a:
Select one:
a. Materialized view generator
b. Middleware
c. End-user tool
d. View maintenance software

Ans: b. Middleware

11. Partitioning wrt time dimension is recommended because:
Select one:
a. It is easier to do as compared to partitioning wrt other dimensions
b. it can be done using range partitioning
c. It facilitates incremental view maintenance
d. It facilitates incremental back up

Ans: c. It facilitates incremental view maintenance
d. It facilitates incremental back up

12. For partitioning wrt product dimension, which kind of partitioning
method is most suitable
Select one:
a. Hash partitioning
b. Composite partitioning
c. Range partitioning
d. List partitioning

Ans: d. List partitioning

13. Which kind of partitioning would create almost equal size partitions:
Select one:
a. Hash partitioning
b. Composite partitioning
c. Range partitioning
d. List partitioning

Ans: a. Hash partitioning

14. Materialized views:
Select one:
a. Store redundant data
b. Always give current data like views
c. Do not need maintenance like views
d. Do not incur space overheads

Ans: a. Store redundant data

15. From the ETL point of view, it is simplest to handle:
Select one:
a. Highly aggregated data
b. Finest granularity data

c. Lightly aggregated data
d. Medium granularity data

Ans: b. Finest granularity data

Usability Engineering SSZG547 Quiz 2 MTec Software Systems - BITS PILANI

Usability Engineering SSZG547 Quiz 2
MTec Software Systems - BITS PILANI

1. Qualitative research helps to understand

Select one or more:
a. Behaviors
b. Faults
c. Domain of products
d. Attitudes

Ans: Behaviors, Attitudes, Domain of products

2. Usability testing helps in determining

Select one or more:
a. Organization
b. How easy to discover and use for the first time
c. Naming
d. How effective is the design

Ans: Naming, Organization, How easy to discover and use for the first time, How effective is the design

3.Benefits of a grid system in visual interface design

Select one or more:
a. Efficiency
b. Usability
c. Fitness
d. Aesthetic appeal
e. None of the answers

Ans: Usability, Aesthetic appeal, Efficiency

4. Basic Visual Usability principles:

Select one or more:
a. Consistency
b. None of the answers
c. Personality
d. Hierarchy

Ans: Consistency, Hierarchy, Personality

5. Ethnographic interview methods:

Select one or more:
a. Encourage story telling
b. First focusing on goals
c. avoiding technology related discussions
d. Make the user as a designer

Ans: First focusing on goals, Encourage story telling, avoiding technology related discussions

6. Market Surveys:

Select one:
a. Both qualitative and quantitative research
b. None of the answers
c. Qualitative Research
d. Quantitative Research

Ans: Quantitative Research

7. Qualitative survey:

Select one or more:
a. Market Survey
b. Subjective knowledge
c. Behavioral knowledge
d. Objective questionnaire
e. Web Poll

Ans: Behavioral knowledge, Subjective knowledge


8. Hierarchy helps in:

Select one or more:
a. to bring the focus
b. Presentation
c. None of the answers
d. structuring

Ans: Presentation, structuring, to bring the focus

9. Personas:

Select one:
a. same as prototypes
b. same as stereotypes
c. None of the answers
d. provides a precise design target

Ans: provides a precise design target

10. The way of placing some elements within other in design user interfaces follows the principle of

Select one:
a. Mixing
b. Nesting
c. Overlapping
d. None of the answers
e. Treatment

Ans: Nesting

11. Select Mechanical age representations


Select one or more:
a. Folder containing papers
b. Paper calendar
c. Google calendar
d. Physical address book
e. None of the answers

Ans:  Paper calendar, Folder containing papers, Physical address book

12. Persona set is essential to capture

Select one:
a. Multiple User behavior
b. Common user behavior
c. Ranges of user behavior
d. User behavior statistics

Ans: Ranges of user behavior

13. Prototypes are:

Select one:
a. same as wire frames
b. less expensive as compared to wire frames.
c. None of the answers
d. Expensive as compared to wire frames

Ans: Expensive as compared to wire frames

14. Archetypes are

Select one or more:
a. Based on motivations
b. Stereotypes
c. Based on Generalization
d. Based on behavior pattern

Ans: Based on behavior pattern, Based on motivations

15. Unstructured interviews are a good way of building personas

Select one:
a. False
b. True

Ans: False

16. More than three or four secondary personas is a sign of

Select one:
a. None of the answers
b. No scope at all
c. product scope is too small and unfocused
d. product scope is too large and unfocused

Ans: product scope is too large and unfocused

17. Personas are

Select one:
a. Zombies
b. None of the answers
c. A single person
d. Imaginary people

Ans: None of the answers

18. Usability testing:

Select one:
a. measuring how well a user can complete a given task
b. same as structural testing
c. is same as black box testing
d. same as white box testing
e. None of the answers

Ans: measuring how well a user can complete a given task

19. Personas are sometimes referred as

Select one:
a. Composite archetypes
b. Typical stereotypes
c. Composite stereotypes
d. Typical archetypes

Ans: Composite archetypes

20. Self Referential design is

Select one:
a. Developer centric
b. None of the answers
c. User centric
d. Tester centric

Ans: Developer centric

21. Identify the methods that could be used to navigate information

Select one or more:
a. Scrolling
b. Zooming
c. Linking
d. Panning

Ans: Scrolling, Linking, Zooming, Panning

22. Building blocks of visual interface design

Select one or more:
a. dullness
b. fitness
c. None of the answers
d. Orientation
e. texture

Ans: Orientation, texture

23. Secondary personas can also be

Select one:
a. Primary personas
b. Negative personas
c. Served personas
d. Supplemental personas

Ans: Served personas

24. Data collected through qualitative research:

Select one or more:
a. None of the answers
b. Descriptive data
c. Not in numerical format
d. Difficult to analyze

Ans: Not in numerical format, Difficult to analyze, Descriptive data

25. The best way to get User data/behavior

Select one or more:
a. Guessing
b. Interviews
c. None of the options
d. Observation

Ans : Observation, Interviews

26. Select the visual properties that is of significance with respect to the below picture.



Select one or more:
a. Position
b. Shape
c. Hue
d. Orientation
e. Size
f. Value

Ans:  Hue, Orientation

27. stakeholder interviews:

Select one or more:
a. None of the answers
b. better to do it in isolation
c. should be done before user research begins
d. done with all the stakeholders together.

Ans: better to do it in isolation, should be done before user research begins

28. Customers:

Select one or more:
a. are not consumers
b. are always consumers
c. may be consumers
d. may not be consumers

Ans: may be consumers, may not be consumers

29. Customer Journey maps are used:


Select one:
a. to create site maps
b. to understand the weather
c. to understand the user
d. None of the answers

Ans: to understand the user

30. SME's are

Select one or more:
a. None of the options
b. Designers
c. Not Designers
d. Domain Experts

Ans: Not Designers, Domain Experts

Machine Learning - ZC464 - Quiz 2 BITS PILANI WILP - 2017

 Machine Learning (ISZC464) Quiz 2
BITS PILANI WILP - 2017


1. A machine learning problem involves four attributes plus a class. The attributes have 3, 2, 2, and 2 possible values each. The class has 3 possible values. How many possible different examples are there?
Select one:
a. 12
b. 48
c. 24
d. 72

Ans: d. 72

2. Which of the following statements are true for k-NN classifiers
Select one:
a. The decision boundary is linear.
b. The decision boundary is smoother with smaller values of k.
c. k-NN does not require an explicit training step.
d. The classification accuracy is better with larger values of k.

Ans: c. k-NN does not require an explicit training step.

3. Which of the following statements are false?
Select one:
a. Decision tree is learned by maximizing information gain
b. Density estimation (using say, the kernel density estimator) can be used to perform classification.
c. No classifier can do better than a naive Bayes classifier if the distribution of the data is known
d. The training error (error on training set) of 1-NN classifier is 0

Ans: c. No classifier can do better than a naive Bayes classifier if the distribution of the data is known

4. Suppose we wish to calculate P(H | E1, E2) and we have no conditional independence information. Which of the following sets are sufficient for computing this (minimal set)?
Select one:
a. P(E1, E2| H) , P(H), P(E1|H), P(E2|H)
b. P(E1, E2), P(H), P(E1, E2| H)
c. P(E1, E2) , P(H), P(E1|H), P(E2|H)
d. P(H), P(E1| H), P(E2|H)
Feedback

Ans: b. P(E1, E2), P(H), P(E1, E2| H)

5. In neural networks, nonlinear activation functions such as sigmoid and tanh
Select one:
a. help to learn nonlinear decision boundaries
b. always output values between 0 and 1
c. speed up the gradient calculation in backpropagation, as compared to linear units
d. are applied only to the output units
Feedback

Ans: a. help to learn nonlinear decision boundaries

6. Which of the following statements about Naive Bayes is incorrect?
Select one:
a. Attributes are statistically independent of one another given the class value.
b. Attributes are statistically dependent of one another given the class value.
c. Attributes can be nominal or numeric
d. Attributes are equally important.

Ans: b. Attributes are statistically dependent of one another given the class value.

7. As the number of training examples goes to infinity, your model trained on that data will have:
Select one:
a. Lower variance
b. None of the other options
c. Higher Variance
d. Does not affect variance
Feedback

Ans: a. Lower variance

8. Which of the following statements are true?
Select one:
a. The depth of a learned decision tree can be larger than the number of training examples used to create the tree.
b. Suppose data has R records, the maximum depth of the decision tree must be less than 1 + log2R
c. Cross validation can be used detect and reduce overfitting
d. As the number of data points grows to infinity, the MAP estimate approaches the MLE estimate for all possible priors. In other words, given enough data, the choice of prior is irrelevant.

Ans: c. Cross validation can be used detect and reduce overfitting

9. Which of the following strategies cannot help reduce overfitting in decision trees?
Select one:
a. Make sure each leaf node is one pure class
b. Enforce a maximum depth for the tree
c. Enforce a minimum number of samples in leaf nodes
d. Pruning
Feedback

Ans: a. Make sure each leaf node is one pure class

10. If A and B are conditionally independent given C, are A and B independent, which of the following is not true?
Select one:
a. P(B|A, C) = P(B|C)
b. P(A,B| C) = P(A) P(B)
c. P(A,B,C) = P(C) P(A|C) P(B|C)
d. P(A|B, C) = P(A|C)
Feedback

Ans: b. P(A,B| C) = P(A) P(B)

11. Which of the following statements are false?
Select one:
a. We can get multiple local optimum solutions if we solve a linear regression problem by minimizing the sum of squared errors using gradient descent.
b. When a decision tree is grown to full depth, it is more likely to fit the noise in the data
c. When the hypothesis space is richer, over fitting is more likely
d. We can use gradient descent to learn a Gaussian Mixture Model.

Ans: a. We can get multiple local optimum solutions if we solve a linear regression problem by minimizing the sum of squared errors using gradient descent.

12. Suppose we wish to calculate P(H | E1, E2) and we know that P(E1| H, E2) = P(E1|H) for all the values of H, E1, E2. Now which of the following sets are sufficient?
Select one:
a. P(E1, E2) , P(H), P(E1|H), P(E2|H)
b. P(E1, E2), P(H), P(E1, E2| H)
c. P(H), P(E1| H), P(E2|H)
d. P(E1, E2| H) , P(H), P(E1|H), P(E2|H)

Ans: b. P(E1, E2), P(H), P(E1, E2| H)

13. As the number of training examples goes to infinity, your model trained on that data will have:
Select one:
a. Lower Bias
b. Same Bias
c. Higher Bias
d. None of the other options

Ans: b. Same Bias

14. For polynomial regression, which one of these structural assumptions is the one that most affects the trade-off between underfitting and overfitting
Select one:
a. The assumed variance of the Gaussian noise
b. Whether we learn the weights by gradient descent
c. The use of a constant-term unit input
d. The polynomial degree

Ans: d. The polynomial degree

15. High entropy means that the partitions in decision tree classification are
Select one:
a. Not pure
b. Pure
c. Useful
d. Useless

Ans: a. Not pure