**Virtual University Of Pakistan**Student Cafe

Monday, December 3, 2012

.::VULMSIT::.eNoxel.com CS502 Quiz N.2 DEC 03, 2012

CS502 - Fundamentals of Algorithms

Quiz No.2 DEC 03, 2012

Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above
Selection sort

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:
linear
arithmetic
geometric
exponent

In Quick sort algorithm, constants hidden in T(n lg n) are
Select correct option:

Large
Medium
Not known
small

How much time merge sort takes for an array of numbers?
Select correct option:

T(n^2)
T(n)
T( log n)
T(n log n)

Counting sort has time complexity:
Select correct option:

O(n)
O(n+k)
O(k)
O(nlogn)

In which order we can sort?
Select correct option:

increasing order only
decreasing order only
increasing order or decreasing order
both at the same time

A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:

heap
binary tree
binary search tree
array

The analysis of Selection algorithm shows the total running time is indeed ________in n,
Select correct option:

arithmetic
geometric
linear
orthogonal

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
Select correct option:

There is explicit combine process as well to conquer the solution.
No work is needed to combine the sub-arrays, the array is already sorted
Merging the sub arrays
None of above.

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,
Select correct option:

upper
lower
average
log n

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

T(n)

T(n / 2)

log n

n / 2 + n / 4

Quick sort is based on divide and conquer paradigm; we divide the problem on base of

pivot element and:

There is explicit combine process as w ell to conquer

No w ork is needed to combine the sub-arrays, the a

Merging the subarrays

None of above

The number of nodes in a complete binary tree of height h is

2^(h+1) – 1

2 * (h+1) – 1

2 * (h+1)

((h+1) ^ 2) – 1

How many elements do we eliminate in each time for the Analysis of Selection

algorithm?

n / 2 elements

(n / 2) + n elements

n / 4 elements

2 n elements

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

O(n+k)

O(n^3)

We do sorting to,

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

keep elements in increasing or decreasing order

Slow sorting algorithms run in,

T(n^2)

T(n)

T( log n)

T(n log n)

One of the clever aspects of heaps is that they can be stored in arrays without using any

_______________.

Pointers

Constants

Variables

Functions

Counting sort is suitable to sort the elements in range 1 to k:

K is large

K is small

K may be large or small

None

We do sorting to,
Select correct option:

keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order

Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1
Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Select correct option:

left-complete
right-complete
tree nodes
tree leaves

Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1
Sieve Technique can be applied to selection problem?
Select correct option:

True
False

Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1
A heap is a left-complete binary tree that conforms to the ___________
Select correct option:

increasing order only
decreasing order only
heap order
(log n) order

Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:

heap
binary tree
binary search tree
array

Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1
Divide-and-conquer as breaking the problem into a small number of
Select correct option:

pivot
Sieve
smaller sub problems
Selection

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1
In Sieve Technique we do not know which item is of interest
Select correct option:

True
False

Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1
The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:

16
10
32
31

Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:

linear
arithmetic
geometric
exponent

Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1
For the heap sort, access to nodes involves simple _______________ operations.
Select correct option:
arithmetic
binary
algebraic
logarithmic

For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines
Slow sorting algorithms run in,
Select correct option:
T(n^2)
T(n)
T( log n)
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis,
Select correct option:
linear
arithmetic
geometric
exponent

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4

The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

In which order we can sort?
Select correct option:
increasing order only
decreasing order only
increasing order or decreasing order
both at the same time

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:
16
10
32
31

Analysis of Selection algorithm ends up with,
Select correct option:
T(n)
T(1 / 1 + n)
T(n / 2)
T((n / 2) + n)

We do sorting to,
Select correct option:

keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order

Divide-and-conquer as breaking the problem into a small number of
Select correct option:

pivot
Sieve
smaller sub problems
Selection

The analysis of Selection algorithm shows the total running time is indeed ________in n,
Select correct option:

arithmetic
geometric
linear
orthogonal

How many elements do we eliminate in each time for the Analysis of Selection algorithm?
Select correct option:

n / 2 elements
(n / 2) + n elements
n / 4 elements
2 n elements

Sieve Technique can be applied to selection problem?
Select correct option:

True
false

For the heap sort we store the tree nodes in
Select correct option:

level-order traversal
in-order traversal
pre-order traversal
post-order traversal

One of the clever aspects of heaps is that they can be stored in arrays without using any _______________.
Select correct option:
pointers
constants
variables
functions

A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

Divide-and-conquer as breaking the problem into a small number of
Select correct option:
pivot
Sieve
smaller sub problems
Selection

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,
Select correct option:
left-complete
right-complete
tree nodes
tree leaves

For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately

A heap is a left-complete binary tree that conforms to the ___________
Select correct option:
increasing order only
decreasing order only
heap order
(log n) order

We do sorting to,
Select correct option:
keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order

How many elements do we eliminate in each time for the Analysis of Selection algorithm?
Select correct option:
n / 2 elements
(n / 2) + n elements
n / 4 elements
2 n elements

How much time merge sort takes for an array of numbers?
Select correct option:
T(n^2)
T(n)
T( log n)
T(n log n)

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
Select correct option:
divide-and-conquer
decrease and conquer
greedy nature
2-dimension Maxima

Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
The number of nodes in a complete binary tree of height h is
Select correct option:
2^(h+1) – 1
2 * (h+1) – 1
2 * (h+1)
((h+1) ^ 2) – 1

Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1
In Sieve Technique we do not know which item is of interest
Select correct option:
True
False

Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1
Heaps can be stored in arrays without using any pointers; this is due to the
____________ nature of the binary tree,
Select correct option:
left-complete
right-complete
tree nodes
tree leaves

Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as
many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4

Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
Theta asymptotic notation for T (n) :
Select correct option:
Set of functions described by: c1g(n)Set of functions described by c1g(n)>=f(n) for c1 s
Theta for T(n)is actually upper and worst case comp
Set of functions described by:
c1g(n)

Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1
The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
Select correct option:
n items
phases
pointers
constant

Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines

Memorization is?

To store previous results for future use

To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later

To make the process accurate

None of the above

Question # 2 of 10 Total M a r k s: 1

Which sorting algorithm is faster

O (n log n)

O n^2

O (n+k)

O n^3

Quick sort is

Stable & in place

Not stable but in place

Stable but not in place

Some time stable & some times in place

One example of in place but not stable algorithm is

Merger Sort

Quick Sort

Continuation Sort

Bubble Sort

In Quick Sort Constants hidden in T(n log n) are

Large

Medium

Small

Not Known

Continuation sort is suitable to sort the elements in range 1 to k

K is Large

K is not known

K may be small or large

K is small

In stable sorting algorithm.

One array is used

More than one arrays are required

Duplicating elements not handled

duplicate elements remain in the same relative position after sorting

Which may be a stable sort?

Merger

Insertion

Both above

None of the above

An in place sorting algorithm is one that uses ___ arrays for storage

Two dimensional arrays

More than one array

No Additional Array

None of the above

Continuing sort has time complexity of ?

O(n)

O(n+k)

O(nlogn)

O(k)

We do sorting to,

keep elements in random positions

keep the algorithm run in linear order

keep the algorithm run in (log n) order

keep elements in increasing or decreasing order

In Sieve Technique we donot know which item is of interest

True

False

A (an) _________ is a left-complete binary tree that conforms to the

heap order

heap

binary tree

binary search tree

array

27. The sieve technique works in ___________ as follows

phases

numbers

integers

routines

For the sieve technique we solve the problem,

recursively

mathematically

precisely

accurately

29. For the heap sort, access to nodes involves simple _______________

operations.

arithmetic

binary

algebraic

logarithmic

The analysis of Selection algorithm shows the total running time is

indeed ________in n,\

arithmetic

geometric

linear

orthogonal

For the heap sort, access to nodes involves simple _______________

operations.

Select correct option:

arithmetic

binary

algebraic

logarithmic

Sieve Technique applies to problems where we are interested in finding a

single item from a larger set of _____________

Select correct option:

n items

phases

pointers

constant

Question # 9 of 10 ( Start time: 07:45:36 AM ) Total Marks: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

True

False

How much time merge sort takes for an array of numbers?

Select correct option:

T(n^2)

T(n)

T( log n)

T(n log n)

For the heap sort we store the tree nodes in

Select correct option:

level-order traversal

in-order traversal

pre-order traversal

post-order traversal

Sorting is one of the few problems where provable ________ bonds exits on

how fast we can sort,

Select correct option:

upper

lower

average

log n

single item from a larger set of _____________

Select correct option:

n items

phases

pointers

constant

A heap is a left-complete binary tree that conforms to the ___________

Select correct option:

increasing order only

decreasing order only

heap order

(log n) order

In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,

Select correct option:

T(n)

T(n / 2)

log n

n / 2 + n / 4

The reason for introducing Sieve Technique algorithm is that it illustrates a

very important special case of,

Select correct option:

divide-and-conquer

decrease and conquer

greedy nature

2-dimension Maxima

The sieve technique works in ___________ as follows

Select correct option:

phases

numbers

integers

routines

For the Sieve Technique we take time

Select correct option:

T(nk)

T(n / 3)

n^2

n/3

In the analysis of Selection algorithm, we eliminate a constant fraction of the

array with each phase; we get the convergent _______________ series in the

analysis,

linear

arithmetic

geometric

exponent

Analysis of Selection algorithm ends up with,

Select correct option:

T(n)

T(1 / 1 + n)

T(n / 2)

T((n / 2) + n)

Quiz Start Time: 07:23 PM
Time Left 90
sec(s)
Question # 1 of 10 ( Start time: 07:24:03 PM ) Total M a r k s: 1
In in-place sorting algorithm is one that uses arrays for storage :
Select correct option:
An additional array
No additional array
Both of above may be true according to algorithm
More than 3 arrays of one dimension.

Time Left 89
sec(s)
Question # 2 of 10 ( Start time: 07:25:20 PM ) Total M a r k s: 1
Which sorting algorithn is faster :
Select correct option:
O(n^2)
O(nlogn)
O(n+k)
O(n^3)

In stable sorting algorithm:
Select correct option:
One array is used
In which duplicating elements are not handled.
More then one arrays are required.
Duplicating elements remain in same relative posistion after sorting.

Counting sort has time complexity:
Select correct option:
O(n)
O(n+k)
O(k)
O(nlogn)

Counting sort is suitable to sort the elements in range 1 to k:
Select correct option:
K is large
K is small
K may be large or small
None

Memorization is :
Select correct option:
To store previous results for further use.
To avoid unnecessary repetitions by writing down the results of recursive calls and looking them again if needed later
To make the process accurate.
None of the above

The running time of quick sort depends heavily on the selection of
Select correct option:
No of inputs
Arrangement of elements in array
Size o elements
Pivot elements

Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above

In Quick sort algorithm, constants hidden in T(n lg n) are
Select correct option:
Large
Medium
Not known
small

Quick sort is
Select correct option:
Stable and In place
Not stable but in place
Stable and not in place
Some time in place and send some time stable

For the Sieve Technique we take time

T(nk)

T(n / 3)

n^2

n/3

The sieve technique is a special case, where the number of sub problems is just

Select correct option:

Many

Few

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Select correct option:

divide-and-conquer

decrease and conquer

greedy nature

2-dimension Maxima

Quick sort is

Select correct option:

Stable and In place

Not stable but in place

Stable and not in place

Some time in place and send some time stable

Memoization is :

Select correct option:

To store previous results for further use.

To avoid unnecessary repetitions by writing down the results of

recursive calls and looking them again if needed later

To make the process accurate.

None of the above

One Example of in place but not stable sort is

Quick

Heap

Merge

Bubble

The running time of quick sort depends heavily on the selection of

Select correct option:

No of inputs

Arrangement of elements in array

Size o elements

Pivot elements

Question # 9 of 10 ( Start time: 07:39:07 PM ) Total M a r k s: 1

In Quick sort algorithm,constants hidden in T(n lg n) are

Select correct option:

Large

Medium

Not known

Small

Zindagi mein 2 Logo ka buhat khayal rahkoooo
Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo

(Father)

2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)

Regards,

Umair Saulat Mc100403250

--
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.eNoxel.com
http://www.enoxelit.tk
http://www.geniusweb.tk

and Please do Share this group with your Friends and Class Fellows so that our Circle would expand and can be more useful for other Students.

Thanks, n Best of Luck......

You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
---
You received this message because you are subscribed to the Google Groups "vulms" group.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.

Friday, November 30, 2012

.::VULMSIT::.eNoxel.com CS614 Quiz No.2 Nov 29, 2012

CS614 - Data Warehousing

Quiz No.2 Nov 29,2012

Question # 1 of 10 ( Start time: 10:29:52 PM ) Total Marks: 1
Data mining uses _________ algorithms to discover patterns and regularities in data.
Select correct option:
Mathematical
Computational
Statistical
None of these

Question # 2 of 10 ( Start time: 10:31:13 PM ) Total Marks: 1
The goal of ___________ is to look at as few blocks as possible to find the matching records(s).
Select correct option:
Indexing
Partitioning
Joining
None of these

Question # 3 of 10 ( Start time: 10:32:34 PM ) Total Marks: 1
An optimized structure which is built primarily for retrieval, with update being only a secondary consideration is
Select correct option:
OLTP
OLAP
DSS
Inverted Index

Question # 4 of 10 ( Start time: 10:33:23 PM ) Total Marks: 1
If every key in the data file is represented in the index file then index is
Select correct option:
Dense Index
Sparse Index
Inverted Index
None of these

Question # 5 of 10 ( Start time: 10:34:47 PM ) Total Marks: 1
There are many variants of the traditional nested-loop join. If the index is built as part of the query plan and subsequently dropped, it is called
Select correct option:
Naive nested-loop join
Index nested-loop join
Temporary index nested-loop join
None of these

Question # 6 of 10 ( Start time: 10:36:08 PM ) Total Marks: 1
Data mining evolve as a mechanism to cater the limitations of ________ systems to deal massive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc.
Select correct option:
OLTP
OLAP
DSS
DWH

Question # 7 of 10 ( Start time: 10:37:30 PM ) Total Marks: 1
A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
Select correct option:
One
Two
Linear
Quadratic

Question # 8 of 10 ( Start time: 10:38:29 PM ) Total Marks: 1
Data mining derives its name from the similarities between searching for valuable business information in a large database, for example, finding linked products in gigabytes of store scanner data, and mining a mountain for a _________ of valuable ore.
Select correct option:
Furrow
Streak
Trough
Vein

Question # 9 of 10 ( Start time: 10:39:49 PM ) Total Marks: 1
If 'M' rows from table-A match the conditions in the query then table-B is accessed 'M' times. Suppose table-B has an index on the join column. If 'a' I/Os are required to read the data block for each scan plus 'b' I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.
Select correct option:
(a + b)M
(a - b)M
(a + b + M)
(a * b * M)

Question # 10 of 10 ( Start time: 10:41:16 PM ) Total Marks: 1
________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
Select correct option:
Clustering
Aggregation
Segmentation
Partitioning

The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The ______ the portion of the program that must be executed sequentially, the greater the scalability of the computation

Larger

Smaller

Unambiguous

Superior

_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.

An Inverted Index

A Sparse Index

A Dense Index

None of these

If someone told you that he had a good model to predict customer usage, the first thing you might try would be to ask him to apply his model to your customer _______, where you already knew the answer.

Base

Drive

File

Log

The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by _____________ tools typical of decision support systems.

Introspective

Intuitive

Reminiscent

Retrospective

If every key in the data file is represented in the index file then index is

Dense Index

Sparse Index

Inverted Index

None of these

A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.

One

Two

Linear

Quadratic

With data mining, the best way to accomplish this is by setting aside some of your data in a vault to isolate it from the mining process; once the mining is complete, the results can be tested against the isolated data to confirm the model's _______.

Validity

Security

Integrity

None of these

Data mining uses _________ algorithms to discover patterns and regularities in data.

Mathematical

Computational

Statistical

None of these

The goal of ___________ is to look at as few blocks as possible to find the matching records(s).

Indexing

Partitioning

Joining

None of these

_______________, if too big and does not fit into memory, will be expensive when used to find a record by given key.

An Inverted Index

A Sparse Index

A Dense Index

None of these

There are many variants of the traditional nested-loop join. If the index is built as part of the query plan and subsequently dropped, it is called

Naive nested-loop join

Index nested-loop join

Temporary index nested-loop join

None of these

_______________, if fits into memory, costs only one disk I/O access to locate a record by given key.

An Inverted Index

A Sparse Index

A Dense Index

None of these

If 'M' rows from table-A match the conditions in the query then table-B is accessed 'M' times. Suppose table-B has an index on the join column. If 'a' I/Os are required to read the data block for each scan plus 'b' I/Os for each data block then the total cost of accessing table-B is _____________ logical I/Os approximately.

(a + b)M

(a - b)M

(a + b + M)

(a * b * M)

With data mining, the best way to accomplish this is by setting aside some of your data in a ________ to isolate it from the mining process; once the mining is complete, the results can be tested against the isolated data to confirm the model's validity.

Cell

Disk

Folder

Vault

The goal of ideal parallel execution is to completely parallelize those parts of a computation that are not constrained by data dependencies. The smaller the portion of the program that must be executed __________, the greater the scalability of the computation.

In Parallel

Distributed

Sequentially

None of these

Data mining is a/an __________ approach, where browsing through data using data mining techniques may reveal something that might be of interest to the user as information that was unknown previously.

Non-Exploratory

Exploratory

Compute Science

none of these

Data mining evolve as mechanism to cater the limitations of _____ systems to deal massive data sets with high dimensionality , new data types, multiple heterogeneous data resources etc..
OLTP

OLAP

DSS

DWH

To identify the __________________ required we need to perform data profiling
Degree of Transformation
Complexity
Cost
Time

Execution can be completed successfully or it may be stopped due to some error. If some error occurs, execution will be terminated abnormally and all transactions will be ___________
Committed to the database
Rolled back

Companies collect and record their own operational data, but at the same time they also use reference data obtained from _______ sources such as codes, prices etc.
Operational
None of these
Internal
External

Ad-hoc access means to run such queries which are known already.
True
False

____________ in agriculture extension is that pest population beyond which the benefit of spraying outweighs its cost.
Profit Threshold Level
Economic Threshold Level
Medicine Threshold Level
None of these

People that design and build the data warehouse must be capable of working across the organization at all levels
True
False

The _________ is only a small part in realizing the true business value buried within the mountain of data collected and stored within organizations business systems and operational databases.
Independence on technology
Dependence on technology
None of these

Many data warehouse project teams waste enormous amounts of time searching in vain for a ___________________.
Silver Bullet
Golden Bullet
Suitable Hardware
Compatible Product

Multidimensional databases typically use proprietary __________ format to store pre-summarized cube structures.
File
Application
Aggregate
Database

A dense index, if fits into memory, costs only ______ disk I/O access to locate a record by given key.
One
Two
lg (n)
n

All data is ______________ of something real.
I An Abstraction
II A Representation
Which of the following option is true?
I Only
II Only
Both I & II
None of I & II

The key idea behind ___________ is to take a big task and break it into subtasks that can be processed concurrently on a stream of data inputs in multiple, overlapping stages of execution.
Pipeline Parallelism
Overlapped Parallelism
Massive Parallelism
Distributed Parallelism

Non uniform distribution, when the data is distributed across the processors, is called ______.
Skew in Partition
Pipeline Distribution
Distributed Distribution
Uncontrolled Distribution

Data mining evolve as a mechanism to cater the limitations of ________ systems to dealmassive data sets with high dimensionality, new data types, multiple heterogeneous data resources etc.
OLTP
OLAP
DSS
DWH

________ is the technique in which existing heterogeneous segments are reshuffled, relocated into homogeneous segments.
Clustering
Aggregation
Segmentation
Partitioning

To measure or quantify the similarity or dissimilarity, different techniques are available. Which of the following option represent the name of available techniques?
Pearson correlation is the only technique
Euclidean distance is the only technique
Both Pearson correlation and Euclidean distance
None of these

For a DWH project, the key requirement are ________ and product experience.
Tools
Industry
Software
None of these

Pipeline parallelism focuses on increasing throughput of task execution, NOT on __________ sub-task execution time.
Increasing
Decreasing
Maintaining
None of these

Focusing on data warehouse delivery only often end up _________.
Rebuilding
Success
Good Stable Product
None of these

Pakistan is one of the five major ________ countries in the world.
Cotton-growing
Rice-growing
Weapon Producing

_____________ is a process which involves gathering of information about column through execution of certain queries with intention to identify erroneous records.
Data profiling
Data Anomaly Detection
Record Duplicate Detection
None of these

Relational databases allow you to navigate the data in ____________ that is appropriate using the primary, foreign key structure within the data model.
Only One Direction
Any Direction
Two Direction
None of these

DSS queries do not involve a primary key
True
False

__________________ contributes to an under-utilization of valuable and expensive historical data, and inevitably results in a limited capability to provide decision support and analysis.
The lack of data integration and standardization
Missing Data
Data Stored in Heterogeneous Sources

DTS allows us to connect through any data source or destination that is supported by ____________
OLE DB
OLAP
OLTP
Data Warehouse

Data Transformation Services (DTS) provide a set of _____ that lets you extract, transform, and consolidate data from disparate sources into single or multipledestinations supported by DTS connectivity.
Tools
Documentations
Guidelines

If some error occurs, execution will be terminated abnormally and all transactions will be rolled back. In this case when we will access the database we will find it in the state that was before the ____________.
Execution of package
Creation of package
Connection of package

To judge effectiveness we perform data profiling twice.
One before Extraction and the other after Extraction
One before Transformation and the other after Transformation
One before Loading and the other after Loading

The need to synchronize data upon update is called
Data Manipulation
Data Replication
Data Coherency
Data Imitation

Taken jointly, the extract programs or naturally evolving systems formed a spider web, also known as
Distributed Systems Architecture
Legacy Systems Architecture
Online Systems Architecture
Intranet Systems Architecture

Node of a B-Tree is stored in memory block and traversing a B-Tree involves ______ page faults.
O (n)
O (n2)
O (n lg n)
O (lg n)
Which statement is true for De-Normalization?
Redundant data is a performance liability at query time, but is a performance benefit at update time.
Redundant data is a performance benefit at both query time and update time.
Redundant data is a performance liability at both query time and update time.
Redundant data is a performance benefit at query time, but is a performance liability at update time.

It is observed that every year the amount of data recorded in an organization is

Doubles

Triples

Quartiles

Remains same as previous year

Pre-computed _______ can solve performance problems

Aggregates

Facts

Dimensions

The degree of similarity between two records, often measured by a numerical value between _______, usually depends on application characteristics.

0 and 1

0 and 10

0 and 100

0 and 99

The purpose of the House of Quality technique is to reduce ______ types of risk.

Two

Three

Four

All

NUMA stands for __________

Non-uniform Memory Access

Non-updateable Memory Architecture

New Universal Memory Architecture

There are many variants of the traditional nested-loop join. If the index is built as part of the query plan and subsequently dropped, it is called

Naive nested-loop join

Index nested-loop join

Temporary index nested-loop join

None of these

The Kimball s iterative data warehouse development approach drew on decades of experience to develop the _____________.

Business Dimensional Lifecycle

Data Warehouse Dimension

Business Definition Lifecycle

OLAP Dimension

For a smooth DWH implementation we must be a technologist.

True

False

During the application specification activity, we also must give consideration to the organization of the applications.

True

False

The most recent attack is the ________ attack on the cotton crop during 2003- 04, resulting in a loss of nearly 0.5 million bales.

Boll Worm

Purple Worm

Blue Worm

Cotton Worm

The users of data warehouse are knowledge workers in other words they are_________ in the organization.

Decision maker

Manager

Database Administrator

DWH Analyst

_________ breaks a table into multiple tables based upon common column values.

Horizontal splitting

Vertical splitting

As apposed to the out come of classification , estimation deal with ____________ valued

outcome.

Discrete

Isolated

Continuous

Distinct

The goal of ______is to look at as few block as possible to find the matching records. Indexing

Partitioning

Joining

none of these

nested loop join

none of these

The technique that is used to perform these feats in data mining modeling, and this act of model building is something that people have been doing for long time, certainly before the _______ of computers or data mining technology.

Access Advent

Ascent Avowal

A data warehouse may include
Legacy systems
Only internal data sources
Privacy restrictions
Small data mart

De-Normalization normally speeds up
Data Retrieval
Data Modification
Development Cycle
Data Replication

In horizontal splitting, we split a relation into multiple tables on the basis of
Common Column Values
Common Row Values
Different Index Values
Value resulted by ad-hoc query

For a given data set, to get a global view in un-supervised learning we use
One-way Clustering
Bi-clustering
Pearson correlation
Euclidean distance

In DWH project, it is assured that ___________ environment is similar to the production environment.
Designing
Development
Analysis
Implementation

For good decision making, data should be integrated across the organization to cross the LoB (Line of Business). This is to give the total view of organization from:
Owner's Perspective
Customer's Perspective
Decision Maker's Perspective
Employee's Perspective

Which is the least appropriate join operation for Pipeline parallelism?

Hash Join

Inner Join

Outer Join

Sort-Merge Join

Data mining derives its name from the similarities between searching for valuable business information in a large database, for example, finding linked products in gigabytes of store scanner data, and mining a mountain for a _________ of valuable ore.

Furrow

Streak

Trough

Vein

Cell

Disk

Folder

Vault

We must try to find the one access tool that will handle all the needs of their users.

True

False

Investing years in architecture and forgetting the primary purpose of solving business problems, results in inefficient application. This is the example of _________ mistake.

Extreme Technology Design

Extreme Architecture Design

The automated, prospective analyses offered by data mining move beyond the analysis of past

events provided by respective tools typical of ___________.

OLTP

OLAP

Decision Support systems

None of these

There are many variants of the traditional nested-loop join, if there is an index is exploited, then it is called……

Naïve nested loop join index

Nested loop join temporary index

Index nested-loop joins

A data warehouse implementation without an OLAP tool is always possible.

True

False

_____modeling technique is more appropriate for data warehouses.

entity-relationship

dimensional

physical

None of the given

The performance in a MOLAP cube comes from the O(1) look-up time for the array data structure.

True

False

Multi-dimensional databases (MDDs) typically use ___________ formats to store pre-summarized cube structures.

SQL

proprietary file

Object oriented

Non- proprietary file

Slice and Dice is changing the view of the data.

True

False

Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.

Unusual

Essential

Optional

None of the given

Virtual cube is used to query two similar cubes by creating a third "virtual" cube by a join between two cubes.

True

False

Analytical processing uses ____________ , instead of record level access.

multi-level aggregates

Single-level aggregates

Single-level hierarchy

None of the Given

The divide&conquer cube partitioning approach helps alleviate the ____________ limitations of MOLAP implementation.

Flexibility

Maintainability

Security

Scalability

In a traditional MIS system, there is an almost linear sequence of queries.

True

False

Data Warehouse provides the best support for analysis while OLAP carries out the _________ task.

Mandatory

Whole

Analysis

Prediction

DOLAP allows download of "cube" structures to a desktop platform with the need for shared relational or cube server.

True

False

The STAR schema used for data design is a __________ consisting of fact and dimension tables.

Select correct option:

Network model

Relational model

Hierarchical data model

None of the given

Data Warehouse provides the best support for analysis while OLAP carries out the _________ task.

Select correct option:

Mandatory

Whole

Analysis

Prediction

Virtual cube is used to query two similar cubes by creating a third "virtual" cube by a join between two cubes.

Select correct option:

True

False

Data warehousing and on-line analytical processing (OLAP) are _______ elements of decision support system.

Select correct option:

Unusual

Essential

Optional

None of the given

Zindagi mein 2 Logo ka buhat khayal rahkoooo
Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo

(Father)

2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)

Regards,

Umair Saulat Mc100403250

.::VULMSIT::.eNoxel.com Moderator's spam report for vulmsit@googlegroups.com

This message is being sent to you because you are a moderator of the group vulmsit.

The following suspicious messages were sent to your group, but are being held in your moderation queue because they are classified as likely spam messages.

If you take no action, all the messages below will be discarded automatically as spam.

However, if you see any messages that are not spam below, you may approve them individually by going to:

http://groups.google.com/group/vulmsit/pendmsg

Please do not mark this notification as spam; this is a service for group moderators. If you do not wish to receive these notifications in the future, you may change your preferences by going to:

http://groups.google.com/group/vulmsit/manage_post

------- 1 of 19 -------
Subject: Complete and Final Solution of CS401 Assignment No. 02 Semester Fall 2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 27 02:07PM +0500

*Asslam.o.alaikum*
* *
*Dear students Complete and Final Solution of CS401 Assignment No. 02
Semester Fall 2012 has posted *
*Click here for Complete and Final Solution of CS401 Assignment No. 02
Semester Fall

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=6430777047978843989

------- 2 of 19 -------
Subject: SAP System Access - IDES. Low cost per month Limited time offer - 101ERP
From: Jyothi Ganesh <simp.biz39@gmail.com>
Date: Nov 27 04:25AM -0500

Visit *sapaccess.101erp.com* for inquiry form. Best for new to SAP
candidates to practice and get trained on.

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=5720036769530517058

------- 3 of 19 -------
Subject: Today Online Quran & Online Hadith 28 November 2012 (13th Muharram 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 08:32AM +0500

<http://www.gophoto.it/view.php?i=http://api.ning.com:80/files/qFQO2CCIhZ3nQY6VnIBwX9K9Fm8UCrKMMpjcaVCEcd5tdbp7inJeSIuHyhAdoTcWXOBLu*HMgchqE4UC97y*ug__/image001.jpg>

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=4830936640409947871

------- 4 of 19 -------
Subject: CS403 Database Management Systems Quiz.No 02 Conference At 04:00 Pm and 08:00 Pm on 28-11-2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 12:35PM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network has started Quiz. Conference of VU Online
Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and
create a class environment

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=8303656416261472888

------- 5 of 19 -------
Subject: MTH101 - Calculus And Analytical Geometry Quiz.No 01 Conference At 03:00 Pm and 07:00 Pm on 28-11-2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 01:41PM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network has started Quiz. Conference of VU Online
Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and
create a class environment

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=8465555195806855276

------- 6 of 19 -------
Subject: How to use VU Exam Software and attempt Midterm Exam Video tutorial and Slide
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 02:04PM +0500

*Asslam.o.alaikum*
* *
*Dear students *
* *

*We prepared video tutorial and slide to understand "how to use vu exam
software "and "how to attempt vu midterm exam"*

* *
*Click here see Slides of How to use VU Exam Software and

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=6194058485379452885

------- 7 of 19 -------
Subject: Complete Solution of MGT201 - Financial Management GDB NO.2 Due Date 28-11-2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 04:49PM +0500

*Asslam.o.alaikum*
*
*
*Dear students Complete Solution of MGT201 - Financial Management GDB NO.2
Due Date 28-11-2012*
* Semester Fall 2012 has posted *
*Click here for Complete Solution of MGT201 - Financial Management GDB NO.2

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=2868304674970263230

------- 8 of 19 -------
Subject: Complete and Final Solution of CS403 Assignment No. 02 Semester Fall 2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 05:08PM +0500

*Asslam.o.alaikum*
*
*
*Dear students Complete and Final Solution of CS403 Assignment No. 02
Semester Fall 2012 has posted *
*Click here for Complete and Final Solution of CS403 Assignment No. 02
Semester Fall

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1532630185927569938

------- 9 of 19 -------
Subject: Complete Solution of CS601 Assignment No. 02 Semester Fall 2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 05:40PM +0500

*Asslam.o.alaikum*
*
*
*Dear students Complete Solution of CS601 Assignment No. 02 Semester Fall
2012 has posted *
*Click here for Complete and Final Solution of CS601 Assignment No. 02

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=6098380221159066627

------- 10 of 19 -------
Subject: Complete Solution of CS402 Assignment No. 02 Semester Fall 2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 05:49PM +0500

*Asslam.o.alaikum*
*
*
*Dear students Complete Solution of CS402 Assignment No. 02 Semester Fall
2012 has posted *
*Click here for Complete and Final Solution of CS402 Assignment No. 02

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=7743616035520472437

------- 11 of 19 -------
Subject: Complete Solution of MGT401 Assignment No. 01 Semester Fall 2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 28 06:15PM +0500

*Asslam.o.alaikum*
*
*
*Dear students Complete Solution of MGT401 Assignment No. 01 Semester Fall
2012 has posted *
*Click here for Complete and Final Solution of MGT401 Assignment No. 01

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=2992568048627500243

------- 12 of 19 -------
Subject: CS403 Quiz No.2 Dated 28-11-2012
From: Umair Saulat <saulat.umair@gmail.com>
Date: Nov 28 07:13PM +0500

*CS403 Quiz No.2 Dated 28-11-2012*

**

* *

Binary relationships are those, which are established between
Select correct option:
One entity type
*Two entity type Correct Answer*
Three entity type
Unlimited entities

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=6867298293357972909

------- 13 of 19 -------
Subject: [No Subject]
From: Dream Girl <redey3z@gmail.com>
Date: Nov 29 12:19AM +0500

anyone solve these questions plz

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=1225933167887375231

------- 14 of 19 -------
Subject: Today Online Quran & Online Hadith 29 November 2012 (14th Muharram 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 29 08:46AM +0500

<http://www.gophoto.it/view.php?i=http://api.ning.com:80/files/qFQO2CCIhZ3nQY6VnIBwX9K9Fm8UCrKMMpjcaVCEcd5tdbp7inJeSIuHyhAdoTcWXOBLu*HMgchqE4UC97y*ug__/image001.jpg>

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=792215487775745424

------- 15 of 19 -------
Subject: MGMT611 quiz 2. solved by Tabish(eagle_eye)
From: "◄::-:: eagle_eye ::-::►" <fantasy.eagle@gmail.com>
Date: Nov 29 09:41AM +0500

*AOA all dearz...

here's MGMT611 current quiz solved by
*
*eagle_eye*
*
remember me in your kind prayerzz..*

*TABISH ALI RAZA*

*Love U and miss U baba, U always alive in my prayers….. *

*Live to EXPRESS not to IMPRESS..!!*

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=9093409333833575981

------- 16 of 19 -------
Subject: STA301 - Statistics and Probability Online Quiz No.1 Conference At 08:00 Pm to 11:00 Pm on 29-11-2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 29 01:43PM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network has started Quiz. Conference of VU Online
Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and
create a class environment

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=7795808970749370582

------- 17 of 19 -------
Subject: MGT211 Introduction To Business Online Quiz No.2 Conference At 06:00 Pm to 08:00 Pm on 29-11-2012
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 29 01:44PM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network has started Quiz. Conference of VU Online
Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and
create a class environment

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=8383212783979384132

------- 18 of 19 -------
Subject: SAP training companies OR SAP Independent Trainers wanted for a good business venture.
From: Jyothi Ganesh <simp.biz39@gmail.com>
Date: Nov 29 05:34AM -0500

If you are a SAP training company or an individual SAP trainer and
interested in partnering with us for a business venture, please let us
know. Our Business development manager will contact you and discuss how we
can work together and the business

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=2692817121679967950

------- 19 of 19 -------
Subject: Today Online Quran & Online Hadith 30 November 2012 (15th Muharram 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Nov 30 07:53AM +0500

<http://www.gophoto.it/view.php?i=http://api.ning.com:80/files/qFQO2CCIhZ3nQY6VnIBwX9K9Fm8UCrKMMpjcaVCEcd5tdbp7inJeSIuHyhAdoTcWXOBLu*HMgchqE4UC97y*ug__/image001.jpg>

Approve: http://groups.google.com/group/vulmsit/pendmsg?view=full&pending_id=2291666905334882997

For more information about this message, please visit:
https://support.google.com/groups/bin/answer.py?hl=en&answer=47792

--
--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.eNoxel.com
http://www.enoxelit.tk
http://www.geniusweb.tk

and Please do Share this group with your Friends and Class Fellows so that our Circle would expand and can be more useful for other Students.

Thanks, n Best of Luck......

You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
---
You received this message because you are subscribed to the Google Groups "vulms" group.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.