CPP and DataStructures

1

Two main measures for the efficiency of an algorithm are

1

The complexity of Binary search algorithm is

1

Which of the following data structure is not linear data structure?

1

The complexity of merge sort algorithm is

1

When determining the efficiency of algorithm the time factor is measured by

1

When determining the efficiency of algorithm, the space factor is measured by

1

Which of the following is not the internal sort?

1

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

1

To represent hierarchical relationship between elements, Which data structure is suitable?

1

The postfix expression for * + a b - c d is?

1

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

1

Which type of traversal of binary search tree outputs the value in sorted order?

1

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

1

The type of expression in which operator succeeds its operands is?

1

The postfix form of the expression (A+ B)(CD- E)*F / G is?

1

In linked list, pointer is pointing to the first element of the node then time require to insert element to second position is

1

Time require to find any element of the linked list is

1

If start is pointing to first node of the linked list then consider the following statement -
start = start->next;
current = start->next;
what will be the value of address field of current ?

1

Consider the following linked list and following linked list representation -
struct node {
int data;
struct node next;
}start = NULL;
what will be the value of following statement ?
start->next->next->next->data

1

In Circular Linked List insertion of a node involves the modification of ____ links.

1

If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

1

Which of the following operation is performed more efficiently in doubly linked list ?

1

When new element is added in the middle of singly linked list then ________.

1

Consider linked list is used to implement the Stack then which of the following node is considered as Top of the Stack ?

1

Consider the following linked list representation -
struct node {
int data;
struct node next;
}start = NULL;

struct node new_node;
Which of the following statement is used to create a node ?

1

Which of the following data structure is linear type?

1

In a Heap tree

1

The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is

1

A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

1

A characteristic of the data that binary search uses but the linear search ignores, is

1

Queue can be used to implement

1

Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

1

Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requires only about n comparisons to find the location of an item in the DATA array, then n is

1

A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

1

The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)

1

The postfix equivalent of the prefix * + a b - c d is

1

A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

1

A full binary tree with n leaves contains

1

Traversing a binary tree first root and then left and right subtrees called _______traversal.

1

The number of nodes in a complete binary tree of level 5 is

1

Number of possible binary trees with 3 nodes is

1

A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 The number of nodes in the left of the root respectively is

1

The depth of a complete binary tree with n nodes is (log is to be base two)

1

Which of the following are valid characters for a numeric literal constant?

1

A default catch block catches

1

When the compiler cannot differentiate between two overloaded constructors, they are called

1

When you pass a variable _____, C++ passes only the contents of the variable to the receiving function

1

SecondYear Second Year Quiz on CPP and DataStructures, created by Faheem Ahmed on 10/19/2017.

CPP and DataStructures

CPP and DataStructures

Two main measures for the efficiency of an algorithm are

The complexity of Binary search algorithm is

Which of the following data structure is not linear data structure?

The complexity of merge sort algorithm is

When determining the efficiency of algorithm the time factor is measured by

When determining the efficiency of algorithm, the space factor is measured by

Which of the following is not the internal sort?

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

To represent hierarchical relationship between elements, Which data structure is suitable?

The postfix expression for * + a b - c d is?

A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.

Which type of traversal of binary search tree outputs the value in sorted order?

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?

The type of expression in which operator succeeds its operands is?

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

In linked list, pointer is pointing to the first element of the node then time require to insert element to second position is

Time require to find any element of the linked list is

If start is pointing to first node of the linked list then consider the following statement - start = start->next; current = start->next; what will be the value of address field of current ?

Consider the following linked list and following linked list representation - struct node { int data; struct node *next; }*start = NULL; what will be the value of following statement ? start->next->next->next->data

The postfix form of the expression (A+ B)(CD- E)*F / G is?

If start is pointing to first node of the linked list then consider the following statement -
start = start->next;
current = start->next;
what will be the value of address field of current ?

Consider the following linked list and following linked list representation -
struct node {
int data;
struct node next;
}start = NULL;
what will be the value of following statement ?
start->next->next->next->data

Consider the following linked list representation -
struct node {
int data;
struct node next;
}start = NULL;

struct node new_node;
Which of the following statement is used to create a node ?