**Virtual University Of Pakistan**Student Cafe

Friday, February 15, 2013

.::VULMSIT::.eNoxel.com CS502 QUIZ NO.5 DATED FEB 15 2013

CS502 - Fundamentals of Algorithms

Quiz No.5 Dated FEB 15^TH 2013

In in-place sorting algorithm is one that uses arrays for storage :
An additional array

No additional array (Right Answer)

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

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

No of inputs

Arrangement of elements in array

Size o elements

Pivot element (Right Answer)

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required.

Duplicating elements remain in same relative position after sorting. (Right Answer)

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

O(n+k) (Right Answer)

O(n^3)

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

Large

Medium

Not known

Small (Right Answer)

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 well to conquer the solutin. (Right Answer)

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

Both are equal.

Cycles are half of back edges.

Cycles are one fourth of back edges.

There is no relationship between back edges and number of cycle (Right Answer)

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

(V+E) (Right Answer)

V.E

Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

?(V + E) Right Answer)

?(V E)

?(V)

?(V^2)

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V) (Right Answer)

V.V

E.E

log (E)

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

Has greedy approach to compute single source shortest paths to all other vertices (Right Answer)

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

O (log V) (Right Answer)

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges ) (Right Answer)

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

True (Right Answer)

False

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V)

V.V

E.E

log (E)

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) Right Answer)

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

128 (Right Answer)

120

Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another.

Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

Both of above Right Answer)

None of above

10 If you find yourself in maze the better traversel approach will bE

A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

Which is true statement.

Select correct option:

Breadth first search is shortest path algorithm that works on un-weighted graphs (Right Answer)

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.

Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

(u, v) where v is a proper descendent of u in the tree. (Right Answer)

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

If you find yourself in maze the better traversel approach will be :

BFS

BFS and DFS both are valid (Right Answer)

Level order

DFS

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another.

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

True (Right Answer)

False

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

?(V + E) Right Answer)

? (V E)

? (V)

? (V^2)

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (Right Answer)

A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.

A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

In in-place sorting algorithm is one that uses arrays for storage :
An additional array

No additional array (Right Answer)

Both of above may be true according to algorithm

More than 3 arrays of one dimension.

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

No of inputs

Arrangement of elements in array

Size o elements

Pivot element (Right Answer)

In stable sorting algorithm

One array is used

In which duplicating elements are not handled.

More then one arrays are required.

Duplicating elements remain in same relative position after sorting. (Right Answer)

Which sorting algorithn is faster :

O(n^2)

O(nlogn)

O(n+k) (Right Answer)

O(n^3)

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

Large

Medium

Not known

Small (Right Answer)

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 well to conquer the solutin. (Right Answer)

No work is needed to combine the sub-arrays, the array is already sorted

Merging the subarrays

None of above.

There is relationship between number of back edges and number of cycles in DFS

Select correct option:

Both are equal.

Cycles are half of back edges.

Cycles are one fourth of back edges.

There is no relationship between back edges and number of cycle (Right Answer)

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T ?

Select correct option:

(V+E) (Right Answer)

V.E

Question # 3 of 10 ( Start time: 06:54:27 PM ) Total Marks: 1

You have an adjacency list for G, what is the time complexity to compute Graph

transpose G^T.?

?(V + E) Right Answer)

?(V E)

?(V)

?(V^2)

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V) (Right Answer)

V.V

E.E

log (E)

Dijkstra's algorithm :

Select correct option:

Has greedy approach to find all shortest paths

Has both greedy and Dynamic approach to find all shortest paths

Has greedy approach to compute single source shortest paths to all other vertices (Right Answer)

Has both greedy and dynamic approach to compute single source shortest paths to all other vertices.

What algorithm technique is used in the implementation of Kruskal solution for the

MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

O (log E)

? (V)

? (V+E)

O (log V) (Right Answer)

Which is true statement in the following.

Kruskal algorithm is multiple source technique for finding MST.

Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)

Both of above

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges ) (Right Answer)

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree

edge) when the graph has relatively few edges.

True (Right Answer)

False

What is the time complexity to extract a vertex from the priority queue in Prim's

algorithm?

Select correct option:

log (V)

V.V

E.E

log (E)

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

What is generally true of Adjacency List and Adjacency Matrix representations of graphs?

Select correct option:

Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)

Lists require less space than matrices and they are faster to find the weight of an edge (v1, v2) Right Answer)

Lists require more space than matrices and they take longer to find the weight of an edge (v1, v2)

Lists require more space than matrices but are faster to find the weight of an edge (v1, v2)

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Using ASCII standard the string "abacdaacacwe" will be encoded with __________ bits

Select correct option:

128 (Right Answer)

120

Cross edge is :

Select correct option:

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another.

Which statement is true?

Select correct option:

If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.

Both of above Right Answer)

None of above

10 If you find yourself in maze the better traversel approach will bE

A dense undirected graph is:

Select correct option:

A graph in which E = O(V^2) (Right Answer)

A graph in which E = O(V)

A graph in which E = O(log V)

All items above may be used to characterize a dense undirected graph

Which is true statement.

Select correct option:

Breadth first search is shortest path algorithm that works on un-weighted graphs (Right Answer)

Depth first search is shortest path algorithm that works on un-weighted graphs.

Both of above are true.

None of above are true.

Forward edge is:

Select correct option:

(u, v) where u is a proper descendent of v in the tree.

(u, v) where v is a proper descendent of u in the tree. (Right Answer)

(u, v) where v is a proper ancesstor of u in the tree.

(u, v) where u is a proper ancesstor of v in the tree.

Back edge is:

Select correct option:

(u, v) where v is an ancestor of u in the tree. (Right Answer)

(u,v) where u is an ancesstor of v in the tree.

(u, v) where v is an predcessor of u in the tree.

None of above

Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G?

Select correct option:

O(|V |^2)

O(|V | |E|) (Right Answer)

O(|V |^2|E|)

O(|V | + |E|)

In digraph G=(V,E) ;G has cycle if and only if

Select correct option:

The DFS forest has forward edge.

The DFS forest has back edge (Right Answer)

The DFS forest has both back and forward edge

BFS forest has forward edge

What general property of the list indicates that the graph has an isolated vertex?

Select correct option:

There is Null pointer at the end of list.

The Isolated vertex is not handled in list. (not Sure)

Only one value is entered in the list.

There is at least one null list.

If you find yourself in maze the better traversel approach will be :

BFS

BFS and DFS both are valid (Right Answer)

Level order

DFS

Cross edge is :

(u, v) where u and v are not ancestor of one another

(u, v) where u is ancesstor of v and v is not descendent of u.

(u, v) where u and v are not ancestor or descendent of one another (Right Answer)

(u, v) where u and v are either ancestor or descendent of one another.

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few

True (Right Answer)

False

You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?

?(V + E) Right Answer)

? (V E)

? (V)

? (V^2)

A digraph is strongly connected under what condition?

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .

A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. (Right Answer)

A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.

A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.

The relationship between number of back edges and number of cycles in DFS is,

Both are equal

Back edges are half of cycles

Back edges are one quarter of cycles

There is no relationship between no. of edges and cycles (Right Answer)

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Greedy Technique (Right Answer)

Divide-and-Conquer Technique

Dynamic Programming Technique

The algorithm combines more than one of the above techniques

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

Theta asymptotic notation for T (n) :

Select correct option:

Set of functions described by: c1g(n)<=f(n) for c1 some constant and n=n0

Set of functions described by c1g(n)>=f(n) for c1 some constant and n=n0

Theta for T(n)is actually upper and worst case complexity of the code

Set of functions described by: c1g(n)<=f(n)<=c2g(n) for c1 and c2 some constants and n=n0

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.
To unsubscribe from this group and stop receiving emails from it, send an email to vulmsit+unsubscribe@googlegroups.com.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.
For more options, visit https://groups.google.com/groups/opt_out.

.::VULMSIT::.eNoxel.com CS610 QUIZ NO.4 FEB 15 2013

CS610 – Computer Network

Quiz No.4 FEB 15, 2012

technique is used to avoid routing loops.

Reverse path broadcasting

Forward path broadcasting

both a and b

none of the given

_____ includes a 32-bits address mask with each address, which allows the address to be classful, classless, or subnetted.

RIP

OSPF

BGP

None of the given

An area is

Part of an Autonomous System

Composed of at least two As's

Another term of an internet

A collection stub area

Which of the following protocols allows the sender and receiver to enforce polices.

RIP

OSPF

BGP

BGP and RIP

Which of the following are interior routing protocols?

RIP

ospf

BGP

RIP and OSPF

Interior Gateway Protocols (IGPs) and Exterior Gateway Protocols (EGPs) two broad classes of Internet Routing Protocol.

True

False

______ is a type of address used for collection of computers with same prefix.

Cluster

unicast

Multicast

none of the given

In dynamic routing, the routing table is initialized when system boots.

True

False

uses window mechanism to control the flow of data.

UDP

TCP

The Source can configure outgoing datagram's to avoid

Segmentation

Defragmentation

Fragmentation

None of the given

IGPs stand for _________

Internal Gateway Protocols

Interior Gateway Protocols

Intermediate Gateway Protocols

None of the given

One application actively begins execution first and another application waits passively at prearranged location.

True

False

Network having short intervals has a large timeout and the network having large interval has short timeout.

True

False

ICMP message transport is acted upon by getting ICMP _________ in IP.

De-encapsulated

Encapsulated

Segmented

none of the given

Which is not the type of error messages defined by ICMP.

Source quench

Time exceeded

Destination unreachable

none of the given

Which of the following protocols allows the sender and receiver to enforce polices.

RIP

OSPF

BGP

RIP and OSPF

TCP stands for _______

Transport control protocol

Transmission control protocol

Terminal control protocol

none of the given

In IP routing, forwarding refers to ______ transfer.

Packet

Datagram

Message

None of the given

TCP uses _______ format for all messages.

Single

Double

Multiple

None of the given

_____ Protocol provides error reporting mechanism.

IGMP

SNMP

ICMP

none of the given

Router hosts are responsible for the propagation of Multicast routing.

True

False

All routers within a group exchange routing information.

True

False

UDP packet is encapsulated in ________ datagram.

TCP

TCP/IP

None of the given

________ protocol uses distance vector algorithm.

IGP

BGP

RIP

none of the given

_________ is used to attach two autonomous systems.

BGP

IGP

EGP

none of the given

UPD is operating system independent.

True

False

_______ Protocol is used by the unix program mrouted and the Internet multicast backbone.

DVMRP

PRMVD

RPMDV

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 CS410 QUIZ NO. 4 DATED FEB 15 2013

CS410 – Visual Programming

Quiz No.4 Dated FEB 15, 2013

Which one of the following is very useful for localization?

Multithreading

Resource only DLLs NOT SURE

Multitasking

Icons

A child window is always appears within the client area of its parent window.

True

False

The _____ function associates a local address with a socket.

bind(…)

connect(…)

attach(…)

getSocket(…)

The window ______ is the color or pattern used to fill the client area before a window begins drawing.

Caption

Color Palette

Background

Foreground

The error code ______________ Indicates that the underlying network subsystem is not ready for network communication.

WSAEINPROGRESS

WSAEPROCLIM

WSASYSNOTREADY

WSAEFAULT

The state of a semaphore object is _______ when its count is greater than zero and ______ when its count is equal to zero

non-signaled, signaled

signaled, non-signaled

created, destroyed

destroyed, created

The DialogProc function is used to ________

Create a Dialog

Destroy a Dialog

Hide a Dialog

process messages sent to a modal or modeless dialog box

The ________ function sends data on a connected socket

dispatch(…)

transmit(…)

send(…)

broadcast(…)

Consider the following statements written in a DLL: __declspec (dllexport) int Factorial(int); int Average(int,int);

Factorial() and Average() are 2 public functions of the DLL

Average() is the only public functions of the DLL

Factorial()is the only public functions of the DLL

This DLL imports 2 functions. i.e. Factorial() and Average()

To create a thread which is initially in suspended state, we should:

Create thread by calling __beginthread function

Call ExitThread API immediately after creating thread

Give CREATE_SUSPENDED flag in CreateThread

It is impossible

When we use PostThreadMessage for a thread that has not message queue then:

Nothing will happen

It will cause a run time error

Thread will resume processing

Its message queue will be created

Virtual key code defined by

Kernel

Application

System

None of given

Whenever a window is resized, system sends "WM_SIZING" message to the application that owns the window

True

False

__________ handles user inputs and responds to user events independently.

User-Interface Thread

Worker Thread

Kernel Thread

None of given options

In Windows every running application is a _______________

Pointer

Process

Array

List

For showing Dialog we can use "ShowWindow(...)" function

True

Fal;se

The _______ function retrieves a handle to one of the stock pens, brushes, fonts, or palettes

GetStockGDI

GetStockDC

GetStockObject

None of the given options

__________, system sends the item's identifier to the owner window?

When the user chooses a command item from a menu

The _____ function releases a device context, freeing it for use by other applications.

FreeDC

GetDC

DeleteDC

ReleaseDC

________ function is used to invalidate a window or part of it

InvalidateRect

InvalidateWindow

InvalidateClient

InvalidateApp

HTML is a ______Language

Multiset Encryption

Mark-up

Micro Level

None of given options

Line can be drawn using _________ Functions

MoveToEx and LineTo

SelectPts and DrawLine

SelectPts and DrawPOLY

None of the giving options

Name of the three dimensional array is the address of __________________

First Row

First Element

First page

Last Page

If a window owns child Windows, and we destroy owner Window then _____________.

Only owner window will be destroyed

Only its owned window will be destroyed

Both owner and owned Windows will be destroyed

The application will be crashed

system sends the item's identifier to the owner window?

When the user chooses a command item from a menu

When the system chooses a command item from a menu

When the user click on any window area

When the system de-select the item menu

When a menu item is clicked, WM_COMMAND message is send and ID of this menu item is sent in:

wParam

lParam

hInstance

HWND

Which function is not used to handle a caret?

CreateCaret()

DestroyCaret()

SetCaretPos()

DenyCaret()

Graphical device interface communicates between application and _______ driver

Port

Operating System

Device

Kernel

_______ acts as a buffer between applications and output devices.

GDI

Kernel32

CPU

When a thread terminates, the thread object attains _______ state

Signaled

Blocked

Resumed

Non-signaled

The ________ function establishes a connection to a specified socket.

Connect

Attach

Connectsocket

attachsocket

Static variables are made on ___________ memory location

Fixed

Stack

Pointer

Variable

We can undefine already defined preprocessor directive using

#undef

#unifdef

#unenddef

None of given

If we press a normal key from keyboard, the number of byte(s) sent to keyboard buffer

2 Not sure

All threads share the

Virtual Address space

Global variables

Operating system resources of their respective processes

All of given options

How many WM_CHAR messages will be generated when Shift+A key combination is pressed from keyboard and we haven't called TranslateMessage() before calling DispatchMessage() function?

32-bit Microsoft Windows, there is very low chance of device drivers getting corrupted because:

Win-32 allows multi-threading

Each process cannot access the virtual address space of some other process

Each thread has its own stack

Context switching mechanism is very good

Consider the following statements written in a DLL: __declspec (dllexport) int Factorial(int); int Average(int,int);

Factorial() and Average() are 2 public functions of the DLL

Average() is the only public functions of the DLL

Factorial()is the only public functions of the DLL

This DLL imports 2 functions. i.e. Factorial() and Average()

Long chain of keywords in declaration can be shortened. Above line is the advantage of ______.

Typedef

Struct

Union

None of 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: ENG201 Business and Technical English Writing Online Quiz No.4 Conference At 11:00 am and 07:00 pm on 13-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 13 09:57AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 2 of 19 -------
Subject: CS201 Introduction to Programming Online Quiz No.4 Conference At 01:00 pm and 09:00 pm on 13-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 13 09:58AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 3 of 19 -------
Subject: CS304 Object Oriented Programming Online Quiz No. 04 Conference At 03:00 pm and 10:00 pm on 13-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 13 09:59AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 4 of 19 -------
Subject: CS501 Advance Computer Architecture Online Quiz No. 04 Conference At 04:00 pm and 11:00 pm on 13-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 13 10:01AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 5 of 19 -------
Subject: Today Online Quran & Online Hadith 13 Feb 2013 (02 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 08:05AM +0500

Today Online Quran & Online Hadith 13 Feb 2013 (02 Rabi'al Sani 1434)

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

------- 6 of 19 -------
Subject: Today Online Quran & Online Hadith 14 Feb 2013 (03 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 08:06AM +0500

Today Online Quran & Online Hadith 14 Feb 2013 (03 Rabi'al Sani 1434)

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

------- 7 of 19 -------
Subject: VALENTINE DAY NONSENSE IS UN ISLAMIC
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 08:12AM +0500

*In the Name of Allâh, the Most Beneficent, the Most Merciful. *

*السلام عليكم ورحمة الله وبركاته
*
*Assalamu'alaikum Wa Rahmatullah e Wa Barakatuhu,*

VALENTINE DAY NONSENSE IS UN ISLAMIC

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

------- 8 of 19 -------
Subject: CS601 Data CommunicationOnline Quiz No.4 Conference At 11:00 am and 08:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:27AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 9 of 19 -------
Subject: CS401 Computer Architecture and Assembly Language Programming Online Quiz No.4 Conference At 01:00 pm and 10:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:28AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 10 of 19 -------
Subject: STA301 - Statistics and Probability Online Quiz No.02 Conference At 02:00 pm and 07:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:31AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 11 of 19 -------
Subject: MTH302 - Business Mathematics & Statistics VU Online Quiz no.4 Conference At 04:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:33AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 12 of 19 -------
Subject: CS506 Web Design and Development Online Quiz No. 02 Conference At 05:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:47AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 13 of 19 -------
Subject: CS604 Operating Systems Online Quiz No. 02 Conference At 06:00 pm on 14-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 09:54AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 14 of 19 -------
Subject: All BS Programs Subjects CS101, ENG101, ISL201, MGT101, MTH101, MTH302, PAK301, PSY101, SOC101 FAQs, Glossary, Lecture wise question and answer and past final term solved papers
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 14 05:48PM +0500

Asslam .o. Alaikum
Respected VU Fellows

We are preparing Faqs, Glossary, Lecture wise Questions and Answers, Solved
Online Quiz, Solved Past Final Term Papers PDF files of All VU Subjects for
Final Term Exam Preparation. Uploading of many

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

------- 15 of 19 -------
Subject: Today Online Quran & Online Hadith 15 Feb 2013 (04 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 08:54AM +0500

Today Online Quran & Online Hadith 15 Feb 2013 (04 Rabi'al Sani 1434)

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

------- 16 of 19 -------
Subject: Jumma Mubarak to All Muslims 15 Feb 2013 (04 Rabi'al Sani 1434)
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 09:07AM +0500

Jumma Mubarak to All Muslims 15 Feb 2013 (04 Rabi'al Sani 1434)

<http://api.ning.com/files/sbS3oDiupKBc774wiHp-TfBVYiYDTsz*Qe1r2OcDuKM6P1DwEq58FVl-*jeQNzchIuAwef7O79GHREXd*2uuqvX9AsMh5FT3/JummaMubaraktoAllMuslims15Feb201304RabialSani14345.jpg>

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

------- 17 of 19 -------
Subject: STA301 - Statistics and Probability Online Quiz No.02 Conference At 12:00 pm and 08:00 pm on 15-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 09:29AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 18 of 19 -------
Subject: MTH302 - Business Mathematics & Statistics VU Online Quiz no.4 Conference At 02:00 pm and 07:00 pm on 15-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 09:30AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

------- 19 of 19 -------
Subject: MTH202 - Discrete Mathematics QUIZ No.1 Conference At 03:00 pm 15-02-2013
From: "www.virtualians.pk" <irfankhan0044@gmail.com>
Date: Feb 15 09:31AM +0500

Asslam.o.Alaikum

Dear Students

Virtualians Social Network is going to organize Quiz. Conference of VU
Online Quizzes for Virtual University Students.

The main purpose of such quiz conferences is to motivate encourages and

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

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.
To unsubscribe from this group and stop receiving emails from it, send an email to vulmsit+unsubscribe@googlegroups.com.
Visit this group at http://groups.google.com/group/vulmsit?hl=en-GB.
For more options, visit https://groups.google.com/groups/opt_out.

Thursday, February 14, 2013

.::VULMSIT::.eNoxel.com CS401 QUIZ NO. 4 FEB 14, 2013

CS401- Computer Architecture and Assembly Language

Quiz No.4 FEB 14, 2013

A 32-bit address register can access up to ____ of memory.

2 MB

2 GB

4 MB

4 GB

Operating system Organize data in the form of

Folder

Batch file

File

None of the above

The 'program segment prefix' for com files is of size:

Select correct option:

64 bytes

128 bytes

256 bytes

512 bytes

COM1 is connected with

IRQ2

IRQ3

IRQ4

IRQ5

"INT13 –BIOS disk services" generally uses which register to return the 'error flag' ?

Select correct option:
CF
DL
AH
AL

In case of COM file, first command line parameter is stored at ___ offset of 'program segment prefix'
0×80
0×82
0×84
0×86

On executing INT 0×21 service 0x3D, if file is successfully opened then

CF will contain 1
CF will contain 0
ZF will contain 1
ZF will contain 0

Which register is generally used to specify the service number of an interrupt ?

The lower 16-bits of EAX register are labeled as:

EAL

Device drivers can be divided into ___ major categories:

None

In programmable interrupt controller which of the following ports is referred as a

interrupt mask register?

Select correct option:

Which of the following BIOS INT provides serial port services

INT 21

INT 14

INT 10

INT 08

In 9pin DB 9 connector, which pin is assigned to RD (Received Data) ?

In 9pin DB 9 connector, which pin is assigned to Signal Ground ?

Device drivers can be divided into ___ major categories:

The INT 0x13 service 0x03 is use to

Select correct option:

Get drive parameter

Reset disk sector

Write disk sector

Read disk sector

Hard disk MBR( Master Boot Record ) is of size_____.

Select correct option:

446 bytes

350 bytes

512 bytes

256 bytes

COM2 is connected with

Select correct option:

IRQ 2

IRQ 3

IRQ 4

IRQ 5

On executing INT 0x21--service 0x3D, if file can't be opened then

Select correct option:

CF will contain 1

CF will contain 0

ZF will contain 1

ZF will contain 0

"INT13 --BIOS disk services" generally uses which register to return the 'error code' ?

correct option:

BPB stands for

Basic parameter block

Bios precise block

Basic precise block

Bios parameter block

"INT13 --BIOS disk services" generally uses which register to return the 'error flag' ?

The maximum length of DOS command line parameters is

64 bits

127 bits

256 bits

512 bits

Which of the following BIOS INT provides serial port services
Select correct option:
INT 21
INT 14
INT 10
INT 08

In case of COM file, maximum length of parameters passed through command line can be ___
Select correct option:
63 bytes
127 bytes
255 bytes
511 bytes

In case of COM file, first command line parameter is stored at ___ offset of 'program segment prefix'
Select correct option:
0x80
0x82
0x84
0x86

The 'program segment prefix' is used to store:
Select correct option:
DOS information
Command tail
DOS information and Command tail
None of the given options

The INT 0x13 service 0x03 is use to
Select correct option:
Read disk sector
Write disk sector
Reset disk sector
Get drive parameter

On executing INT 0x21--service 0x3D, if file can't be opened then
Select correct option:
CF will contain 1
CF will contain 0
ZF will contain 1
ZF will contain 0

Operating system Organize data in the form of
Select correct option:
Folder
Batch file
File
None of the above

We can access all the DOS services using
Select correct option:
INT 0x21
INT 0x13
INT 0x10
INT 0x08

In 9pin DB 9 connector, which pin is assigned to RD (Received Data) ?
Select correct option:
1
2
3
4

Device drivers can be divided into ___ major categories:
Select correct option:
5
4
3
2

The higher 16-bits of EAX register are labeled as:

Select correct option:

EAH

None of the given options

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