vu acc311 Mid Term Subjective Solved Past Paper No.2

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 8 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: Let's call the node as a that requires re-balancing. Consider the two cases given below:

An insertion into left subtree of the left child of a
An insertion into right subtree of the right child of a.

Which of the following statement is correct about these two cases.

The insertion occurs outside (i.e., left-left or right-right) in cases 1 and 2. single rotation can fix the balance in these two cases.
The insertion occurs inside ((i.e., left-left or right-right) in cases 1 and 2. single rotation cannot fix the balance in these two cases

Answer:

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

Question 2: See the code below, give comments against each line and identify which line will result in error?
void main(void) {
int actual = 123;
int &other = actual;
int natural = 456;
other = ♮
}

Answer:

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

Question 3: The following function is performing some operation on the elements of a singly link list please tell what this functions is doing,
void LinkList::mystery(){
Node * temp = headNode;
int result = 0;
while( temp->getNext() != NULL ){
temp = temp->getNext();
int value = temp->get();
if(value % 2 == 0) {
value ++;
temp->set(value);
}
}
}

Answer:

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

Question 4: The nodes of a binary tree have data 1, 2, 3, 4. The in-order traversal of the tree yields 2,1,4,3. The postorder traversal is 2, 4, 3, 1. The root of the tree is at level 0.

Answer:

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

Question 5: What are the applications of Binary Tree?

Answer:

The binary tree is a useful data structure for rapidly storing sorted data and rapidly retrieving stored data. It can hold objects that are sorted by their keys. It can represent a structured object, An operating system maintains a disk's file system as a tree, where file folders act as tree nodes:

Question 6: What is difference between call by reference and call by value?

Answer:

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

Question 7: What is Function Call Stack Give short answer?

Answer:

Stacks play a key role in implementation of function calls in programming languages. In C++, for example, the "call stack" is used to pass function arguments and receive return values. The call stack is also used for "local variables"

Question 8: What is the functionality of the following method of BST class
TreeNode<int>* function(TreeNode<int>* tree) {
if( tree == NULL )
return NULL;
if( tree->getLeft() == NULL )
return tree; // this is it.
return function( tree->getLeft() );
}

Answer:

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