Data Structure using C (CSIT124)-Semester II

We Also Provide SYNOPSIS AND PROJECT.

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## 1st Module Assessment

Which of these best describes an array?

Select one:

a. A data structure that shows a hierarchical behavior

b. Container of objects of similar types

c. Arrays are immutable once initialised

d. Array is not a data structure

Question 1. Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct.

Select one:

a. Find the ith largest element

b. Delete an element

c. Find the ith smallest element

d. All of the above

Clear my choice

Question 2. Which of the following highly uses the concept of an array?

Select one:

a. Binary Search tree

b. Caching

c. Spatial locality

d. Scheduling of Processes

Clear my choice

Question 3. Two-dimensional arrays are also called

Select one:

a. tables arrays

b. matrix arrays

c. both of above

d. none of the above

Clear my choice

Question 4. Elements in an array are accessed _____________

Select one:

a. randomly

b. sequentially

c. exponentially

d. logarithmically

Clear my choice

Question 5. The memory address of the first element of an array is called

Select one:

a. floor address

b. foundation address

c. first address

d. base address

Clear my choice

Question 6. Assuming int is of 4bytes, what is the size of int arr[15];?

Select one:

a. 15

b. 19

c. 11

d. 60

Clear my choice

Question 7. What are the advantages of arrays?

Select one:

a. Objects of mixed data types can be stored

b. Elements in an array cannot be sorted

c. Index of first element of an array is 1

d. Easier to store elements of same data type

Clear my choice

Question 8. When does the ArrayIndexOutOfBoundsException occur?

Select one:

a. Compile-time

b. Run-time

c. Not an error

d. Not an exception at all

Clear my choice

Question 9. In general, the index of the first element in an array is __________

Select one:

a. 0

b. -1

c. 2

d. 1

Clear my choice

Question 10. How do you initialize an array in C?

Select one:

a. int arr[3] = (1,2,3);

b. int arr(3) = {1,2,3};

c. int arr[3] = {1,2,3};

d. 1. int arr(3) = (1,2,3);

Clear my choice

What is the maximun number of dimensions an array in C may have?

Select one:

a. Two

b. eight

c. sixteen

d. Theoratically no limit. The only practical limits are memory size and compilers

Question 11. Which of the following is an illegal array definition?

Select one:

a. Type COLONGE : (LIME, PINE, MUSK, MENTHOL); var a : array [COLONGE] of REAL;

b. var a : array [REAL] of REAL;

c. var a : array [‘A’…’Z’] of REAL;

d. var a : array [BOOLEAN] of REAL;

Clear my choice

Question 12. What is the output of the below code?

#include <stdio.h>

int main()

{

int arr[5]={10,20,30,40,50};

printf(“%d”, arr[5]);

}

return 0;

}

Select one:

a. Garbage value

b. 10

c. 50

d. None of the above

Clear my choice

Question 13. A program P reads in 500 integers in the range [0..100] exepresenting the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?

Select one:

a. An array of 50 numbers

b. An array of 100 numbers

c. An array of 500 numbers

d. A dynamically allocated array of 550 numbers

Clear my choice

Question 14. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage.

Select one:

a. 560

b. 565

c. 570

d. 575

Clear my choice

Question 15. What is the output of the following piece of code?

public class array

{

public static void main(String args[])

{

int []arr = {1,2,3,4,5};

System.out.println(arr[2]);

System.out.println(arr[4]);

}

}

Select one:

a. 3 and 5

b. 5 and 3

c. 2 and 4

d. 4 and 2

Clear my choice

Question 16. Let A be a square matrix of size n x n. Consider the following program. What is the expected output?

C = 100

for i = 1 to n do

for j = 1 to n do

{

Temp = A[i][j] + C

A[i][j] = A[j][i]

A[j][i] = Temp – C

}

for i = 1 to n do

for j = 1 to n do

Output(A[i][j]);

Select one:

a. The matrix A itself

b. Transpose of matrix A

c. Adding 100 to the upper diagonal elements & subtracting 100 from diagonal elements of A

d. None of the above

Clear my choice

Question 17. What will be the address of the arr[2][3] if arr is a 2-D long array of 4 rows and 5 columns and starting address of the array is 2000?

Select one:

a. 2048

b. 2056

c. 2052

d. 2042

28

We Also Provide SYNOPSIS AND PROJECT.

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## 2nd Module Assessment

Question 1. Which of the following principle does Queue use?

Select one:

a. LIFO principle

b. FIFO principle

c. Linear tree

d. Ordered array

Clear my choice

Question 2. Which data structure is mainly used for implementing the recursive algorithm?

Select one:

a. Queue

b. Stack

c. Binary tree

d. Linked list

Clear my choice

Question 3. If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as___

Select one:

a. Underflow

b. Garbage collection

c. Overflow

d. None of the above

Clear my choice

Question 4. Which one of the following is the process of inserting an element in the stack?

Select one:

a. Insert

b. Add

c. Push

d. None of the above

Clear my choice

Question 5. Which one of the following is not the application of the Queue data structure?

Select one:

a. Resource shared between various systems

b. Data is transferred asynchronously

c. Load balancing

d. Balancing of symbols

Clear my choice

Question 6. When the user tries to delete the element from the empty stack then the condition is said to be a ____

Select one:

a. Underflow

b. Garbage collection

c. Overflow

d. None of the above

Clear my choice

Question 7. Which of the following is the infix expression?

Select one:

a. A+B*C

b. +A*BC

c. ABC+*

d. None of the above

Clear my choice

Question 8. A list of elements in which enqueue operation takes place from one end, and dequeue operation takes place from one end is__

Select one:

a. Binary tree

b. Stack

c. Queue

d. Linked list

Clear my choice

Question 9. Which one of the following is not the application of the stack data structure

Select one:

a. String reversal

b. Recursion

c. Backtracking

d. Asynchronous data transfer

Clear my choice

Question 10. Which one of the following is not the type of the Queue?

Select one:

a. Linear Queue

b. Circular Queue

c. Double ended Queue

d. Single ended Queue

Clear my choice

Question 11. The time complexity of enqueue operation in Queue is __

Select one:

a. O(1)

b. O(n)

c. O(logn)

d. O(nlogn)

Clear my choice

Question 12. Which one of the following is the overflow condition if linear queue is implemented using an array with a size MAX_SIZE?

Select one:

a. rear = front

b. rear = front+1

c. rear=MAX_SIZE -1

d. rear = MAX_SIZE

Clear my choice

Question 13. If the elements ‘1’, ‘2’, ‘3’ and ‘4’ are inserted in a queue, what would be order for the removal?

Select one:

a. 1234

b. 4321

c. 3241

d. None of the above

Clear my choice

Question 14. What is the outcome of the prefix expression +, -, *, 3, 2, /, 8, 4, 1?

Select one:

a. 12

b. 11

c. 5

d. 4

Clear my choice

Question 15. Which of the following option is true if implementation of Queue is from the linked list?

Select one:

a. In enqueue operation, new nodes are inserted from the beginning and in dequeue operation, nodes are removed from the end.

b. In enqueue operation, new nodes are inserted from the end and in dequeue operation, nodes are deleted from the beginning.

c. In enqueue operation, new nodes are inserted from the end and in dequeue operation, nodes are deleted from the end.

d. Both a and b

Clear my choice

Question 16. Consider the following code.

int fun()

{

if(isEmpty())

{

return -10;

}

else

{

int n;

n= q[front];

front++;

return n;

}

}

Which operation does the above code perform?

Select one:

a. Enqueue

b. Dequeue

c. Return the front element

d. Both b and c

Clear my choice

Question 17. What would be the output after performing the following operations in a Deque?

Insertfront(10);

Insertfront(20);

Insertrear(30);

Insertrear(40);

Deletefront();

Insertfront(50);

Deleterear();

Display();

Select one:

a. 10, 20, 30

b. 50, 10, 30

c. 40, 20, 30

d. None of the above

28

We Also Provide SYNOPSIS AND PROJECT.

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## 3rd Module Assessment

Question 1. What is the space complexity for deleting a linked list?

Select one:

a. O(1)

b. O(n)

c. Either O(1) or O(n)

d. O(logn)

Clear my choice

Question 2. In circular linked list, insertion of node requires modification of?

Select one:

a. One pointer

b. Two pointer

c. Three pointer

d. None

Clear my choice

Question 3. In a circular linked list

Select one:

a. Components are all linked together in some sequential manner.

b. There is no beginning and no end.

c. Components are arranged hierarchically.

d. Forward and backward traversal within the list is permitted.

Clear my choice

Question 4. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

Select one:

a. Pointer to character

b. Pointer to integer

c. Pointer to node

d. Node

Clear my choice

Question 5. What is the time complexity to count the number of elements in the linked list?

Select one:

a. O(1)

b. O(n)

c. O(logn)

d. O(n2)

Clear my choice

Question 6. Which of these is not an application of a linked list?

Select one:

a. To implement file systems

b. For separate chaining in hash-tables

c. To implement non-binary trees

d. Random Access of elements

Clear my choice

Question 7. Doubly linked list is also called as

Select one:

a. list

b. two-way linked list

c. skip list

d. none

Clear my choice

Question 8. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Select one:

a. Deleting a node whose location in given

b. Searching of an unsorted list for a given item

c. Inverting a node after the node with given location

d. Traversing a list to process each node

Clear my choice

Question 9. In doubly linked lists, traversal can be performed?

Select one:

a. Only in forward direction

b. Only in reverse direction

c. In both directions

d. None

Clear my choice

Question 10. A linear collection of data elements where the linear node is given by means of pointer is called?

Select one:

a. Linked list

b. Node list

c. Primitive list

d. None

Clear my choice

Question 11. public void function(Node node)

{

if(size == 0)

head = node;

else

{

Node temp,cur;

for(cur = head; (temp = cur.getNext())!=null; cur = temp);

cur.setNext(node);

}

size++;

}

Select one:

a. Inserting a node at the beginning of the list

b. Deleting a node at the beginning of the list

c. Inserting a node at the end of the list

d. Deleting a node at the end of the list

Clear my choice

Question 12. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?

i) Insertion at the front of the linked list

ii) Insertion at the end of the linked list

iii) Deletion of the front node of the linked list

iv) Deletion of the last node of the linked list

Select one:

a. I and II

b. I and III

c. I,II and III

d. I,II and IV

Clear my choice

Question 13. Consider the following definition in c programming language

struct node

{

int data;

struct node * next;

}

typedef struct node NODE;

NODE *ptr;

Which of the following c code is used to create new node?

Select one:

a. ptr=(NODE*)malloc(sizeof(NODE));

b. ptr=(NODE*)malloc(NODE);

c. ptr=(NODE*)malloc(sizeof(NODE*));

d. ptr=(NODE)malloc(sizeof(NODE));

Clear my choice

Question 14. In worst case, the number of comparison need to search a singly linked list of length n for a given element is

Select one:

a. log n

b. n/2

c. log2n-1

d. n

Clear my choice

Question 15. public int function(int data)

{

Node temp = head;

int var = 0;

while(temp != null)

{

if(temp.getData() == data)

{

return var;

}

var = var+1;

temp = temp.getNext();

}

return Integer.MIN_VALUE;

}

Select one:

a. Find and delete a given element in the list

b. Find and return the given element in the list

c. Find and return the position of the given element in the list

d. Find and insert a new element in the list

Clear my choice

Question 16. The following C function takes a singly linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code left blank.

typedef struct node

{

int value;

struct node* next;

}Node;

Node* move_to_front(Node* head)

{

Node* p, *q;

if((head==NULL) || (head->next==NULL))

return head;

q=NULL;

p=head;

while(p->next != NULL)

{

q=p;

p=p->next;

}

return head;

}

Choose the correct alternative to replace the blank line

Select one:

a. q=NULL; p->next=head; head =p ;

b. q->next=NULL; head =p; p->next = head;

c. head=p; p->next=q; q->next=NULL;

d. q->next=NULL; p->next=head; head=p;

Clear my choice

Question 17. consider the function f defined here:

struct item

{

int data;

struct item * next;};

int f (struct item *p)

{

return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next)));

}

For a given linked list p, the function f returns 1 if and only if

Select one:

a. the list is empty or has exactly one element

b. the element in the list are sorted in non-decreasing order of data value

c. the element in the list are sorted in non-increasing order of data value

d. not all element in the list have the same data value

30

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## 4th Module Assessment

Question 1. While converting binary tree into extended binary tree, all the original nodes in binary tree are …….

Select one:

a. Internal nodes on extended tree

b. External nodes on extended tree

c. Vanished on extended tree

d. Intermediate nodes on extended tree

Clear my choice

Question 2. If every node u in G adjacent to every other node v in G, A graph is said to be

Select one:

a. isolated

b. complete

c. finite

d. strongly connected

Clear my choice

Question 3. If every node u in G is adjacent to every other node v in G,A graph is said to be ……..

Select one:

a. isolated

b. complete

c. finite

d. strongly connected.

Clear my choice

Question 4. A connected graph T without any cycles is called

Select one:

a. a tree graph

b. free tree

c. a tree

d. All of above

Clear my choice

Question 5. A graph is said to be ……. if every node u in G is adjacent to every other node v in G

Select one:

a. Absolute

b. Entire

c. Inclusive

d. Complete

Clear my choice

Question 6. In a graph if e=[u,v], then u and v are called

Select one:

a. endpoints of e

b. adjacent nodes

c. neighbours

d. all of the above

Clear my choice

Question 7. Three standards ways of traversing a binary tree T with root R …….

Select one:

a. Prefix, infix, postfix

b. Pre-process, in-process, post-process

c. Pre-traversal, in-traversal, post-traversal

d. Pre-order, in-order, post-order

Clear my choice

Question 8. The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.

Select one:

a. ABFCDE

b. ADBFEC

c. ABDECF

d. ABDCEF

Clear my choice

Question 9. A binary tree whose every node has either zero or two children is called ………

Select one:

a. Complete binary tree

b. Binary Search tree

c. Extended binary tree

d. E2 tree

Clear my choice

Question 10. The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.

Select one:

a. ABFCDE

b. ADBFEC

c. ABDECF

d. ABDCEF

In a graph if e=(u,v) means …….

Select one:

a. u is adjacent to v but v is not adjacent to u.

b. e begins at u and ends at v

c. u is node and v is an edge.

d. both u and v are edges.

Clear my choice

Question 11. In linked representation of Binary trees LEFT[k] contains the …….. of at the node N, where k is the location.

Select one:

a. Data

b. Location and left child

c. Right child address

d. Null value

Clear my choice

Question 12. In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.

Select one:

a. FAEKCDBHG

b. FAEKCDHGB

c. EAFKHDCBG

d. FEAKDCHBG

Clear my choice

Question 13.

What is the average case time complexity for finding the height of the binary tree?

Select one:

a. h = O(loglogn)

b. h = O(nlogn)

c. h = O(n)

d. h = O(log n)

Clear my choice

Question 14. What is a complete binary tree?

Select one:

a. Each node has exactly zero or two children

b. A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

c. A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

d. A tree In which all nodes have degree 2

In a full binary tree if number of internal nodes is I, then number of nodes N are?

Select one:

a. N = 2*I

b. N = I + 1

c. N = I – 1

d. N = 2*I + 1

Clear my choice

Question 15. In the given graph identify the cut vertices.

Select one:

a. B and E

b. C and D

c. A and E

d. C and B

Clear my choice

Question 16. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Select one:

a. 1,2,3

b. 2,3,4

c. 2,4,5

d. 1,3,5

Clear my choice

Question 17. In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is:

Select one:

a. nk

b. (n – 1) k+ 1

c. n( k – 1) + 1

d. n(k – 1)

29

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## 5th Module Assessment

Question 1. The worst-case occur in linear search algorithm when …….

Select one:

a. Item is somewhere in the middle of the array

b. Item is not in the array at all

c. Item is the last element in the array

d. Item is the last element in the array or item is not there at all

Clear my choice

Question 2. Which of the following is not a limitation of binary search algorithm?

Select one:

a. must use a sorted array

b. requirement of sorted array is expensive when a lot of insertion and deletions are needed

c. there must be a mechanism to access middle element directly

d. binary search algorithm is not efficient when the data elements more than 1500.

Clear my choice

Question 3. The Average case occurs in the linear search algorithm ……….

Select one:

a. when the item is somewhere in the middle of the array

b. when the item is not the array at all

c. when the item is the last element in the array

d. Item is the last element in the array or item is not there at all

Clear my choice

Question 4. Is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

Select one:

a. Insertion

b. Extraction

c. Selection

d. Distribution

Clear my choice

Question 5. If the number of records to be sorted is small, then …… sorting can be efficient.

Select one:

a. Merge

b. Heap

c. Selection

d. Bubble

Clear my choice

Question 6. Which of the following sorting algorithm is of divide and conquer type?

Select one:

a. Bubble sort

b. Insertion sort

c. Merge sort

d. Selection sort

Clear my choice

Question 7. Complexity of linear search algorithm is ………

Select one:

a. O(n)

b. O(logn)

c. O(n2)

d. O(n logn)

Clear my choice

Question 8. Binary search algorithm cannot be applied to …

Select one:

a. sorted linked list

b. sorted binary trees

c. sorted linear array

d. pointer array

Clear my choice

Question 9. Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general?

Select one:

a. Insertion sort

b. Selection sort

c. Heap sort

d. None

Clear my choice

Question 10. Which of the following is not a stable sorting algorithm?

Select one:

a. Insertion sort

b. Selection sort

c. Bubble sort

d. Merge sort

Clear my choice

Question 11. Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the abovealgorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.

Select one:

a. O(n^2 Logn)

b. O(n^2)

c. O(n Logn Logn)

d. O(nLogn)

Clear my choice

Question 12. The total number of comparisons in a bubble sort is ….

Select one:

a. O(n logn)

b. O(2n)

c. O(n2)

d. O(n)

Clear my choice

Question 13. If the number of record to be sorted large and the key is long, then …… sorting can be efficient.

Select one:

a. Merge

b. Heap

c. Quick

d. Bubble

Clear my choice

Question 14. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

Select one:

a. 4

b. 2

c. 1

d. 0

Clear my choice

Question 15. Select the appropriate code that performs bubble sort.

Select one:

a. for(int j=arr.length-1; j>=0; j–)

{

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

}

}

}

b. for(int j=arr.length-1; j>=0; j–)

{

for(int k=0; k<j; k++)

{

if(arr[k] < arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

}

}

}

c. for(int j=arr.length; j>=0; j–)

{

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

}

}

}

d. for(int j=arr.length; j>=0; j–)

{

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+2])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

}

}

}

Clear my choice

Question 16. How can you improve the best case efficiency in bubble sort? (The input is already sorted)

Select one:

a. boolean swapped = false;

for(int j=arr.length-1; j>=0 && swapped; j–)

{

swapped = true;

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

swapped = false;

}

}

}

b. boolean swapped = true;

for(int j=arr.length-1; j>=0 && swapped; j–)

{

swapped = false;

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

}

}

}

c. boolean swapped = true;

for(int j=arr.length-1; j>=0 && swapped; j–)

{

swapped = false;

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

swapped = true;

}

}

}

d. boolean swapped = true;

for(int j=arr.length-1; j>=0 && swapped; j–)

{

for(int k=0; k<j; k++)

{

if(arr[k] > arr[k+1])

{

int temp = arr[k];

arr[k] = arr[k+1];

arr[k+1] = temp;

swapped = true;

}

}

}

Clear my choice

Question 17. Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Which statement is correct?

Select one:

a. The pivot could be either the 7 or the 9.

b. The pivot could be the 7, but it is not the 9

c. The pivot is not the 7, but it could be the 9

d. Neither the 7 nor the 9 is the pivot.

29

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help

## Assignment 2

Question 1. To implement Forward and Backward functionality in the Internet Browser, which data structure would be the appropriate to choose

Select one:

a. Array

b. Stack

c. Queue

d. Linked Lists

Clear my choice

Question 2. How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

Select one:

a. 1

b. 2

c. 3

d. 4

Clear my choice

Question 3. Which of these is an application of linked lists?

Select one:

a. To implement file systems

b. For separate chaining in hash-tables

c. To implement non-binary trees

d. All of the mentioned

Clear my choice

Question 4. As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order,at the end of each day. The ideal choice will be .

Select one:

a. Bubble Sort

b. Insertion Sort

c. SelectionSort

d. Merge Sort

Clear my choice

Question 5. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called .

Select one:

a. Leaf

b. Branch

c. Path

d. Thread

Contact www.kimsharma.co.in for best and lowest cost solution or

Email: amitymbaassignment@gmail.com

Call/what’s app: +91 8290772200

What’s app: +91 8800352777

Amity assignment solution help, Amity assignment answers help, Assignment Help