vu acc311 Mid Term Subjective Solved Past Paper No.1

vu acc311 Fundamentals of Auditing Solved Past Papers

This subjective solved past paper is related to book/course code vu acc311 Fundamentals of Auditing which belongs to vu organization. We have 2 past papers available related to the book/course Fundamentals of Auditing. This past paper has a total of 10 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.

NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.

Question 1: Define Reference Variable, Dangling Reference & Const

Answer:

In the C++ programming language, a reference is a simple reference datatype that is less powerful but safer than the pointer type inherited from C. The name C++ reference may cause confusion, as in computer science a reference is a general concept datatype, with pointers andC++ references being specific reference datatype implementations Dangling Reference & Const Dangling pointers and wild pointers in computer encoding are pointers that do not point to a valid object of the suitable type. These are special cases of violations of memory safety

Question 2: Describe any two uses of priority queues?

Answer:

Priority queue being used at many places especially in the operating systems. In operating systems, we have queue of different processes. If some process comes with higher priority, it will be processed first. Here we have seen a variation of queue. We will use the priority queue in the simulation. The events will be inserted in the queue and the event going to occur first in future, will be popped.
(page 101)

Question 3: Determine what the following recursive "mystery" function computes when given a pointer to the root node of a binary tree.
struct bt_s { int key; struct bt_s *left, *right; } bt_t;
int MFunc (bt_t *T) {
int N1, N2;
if (T == NULL) return -1;
N1 = MFunc(T->left);
N2 = MFunc(T->right);
return (N1 > N2 N1 : N2) + 1;
}

Answer:

Be the first to post an answer to earn 100 credits.

Question 4: Draw AVL Tree by following digits 78, 21, 25, 28, 38, 36, 75 and also perform necessary rotation, while showing all the intermediate trees being created in the process. In each stage, the AVL transformation should be conducted at a discrepancy that is farthest from the root.

Answer:

Be the first to post an answer to earn 100 credits.

Question 5: Following is the while loop used in level-order traversal:
while(!q.empty()) {
treeNode = q.dequeue();
cout << *(treeNode->getInfo()) << " ";
if(treeNode->getLeft() != NULL )
q.enque( treeNode->getLeft());
if(treeNode->getRight() != NULL )
}

Answer:

Be the first to post an answer to earn 100 credits.

Question 6: Here is a small binary tree:
14
/
2 11
/ /
1 3 10 30
/ /
7 40
Write the order of the nodes visited in:
A. An in-order traversal:
B. A pre-order traversal:

Answer:

Be the first to post an answer to earn 100 credits.

Question 7: How we can avoid the problem of Dangling reference

Answer:

To avoid dangling reference, don't return the reference of a local variable (Transient) from a function.

Question 8: How we can delete a node with two Childs in a binary search tree using its right sub tree.

Answer:

The node to be deleted has either left child (sub-tree) or right child (sub-tree). In this case we bypass the node in such a way that we find the in-order successor of this node and then link the parent of the node to be deleted to this successor node. Thus the node was deleted. (Page 263)

Question 9: How we evaluate postfix expressions?

Answer:

Evaluating Postfix Expression

Each operator in a postfix expression refers to the previous two operands.
Each time we read an operand, we push it on a stack.
When we reach an operator, we pop the two operands from the top of the stack, apply the operator and push the result back on the stack.

(Page 67)

Question 10: Is the following statement correctIf your answer is No, then correct it.
"A tree is an AVL tree if at least half of the nodes fulfill the AVL condition"

Answer:

Statement is wrong, Correct statement is:
A tree is an AVL tree if all the nodes fulfill the AVL condition. (page 214)