Jump to Year/Set
2021 2020 2020 (V4)2020 2020 (SPECIAL)2019 2019 (V4)
2021 100304

B.Tech Examination, 2021

Time 3 hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Questions

Q1

Choose the correct answer of the following (any seven) :

Q2

Answer the following:

Q3

Answer the following:

Q4

Insert the following numbers, in the given sequence, in an empty B tree of order 5 and display the tree at every split : 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1. Now delete the following elements from the tree, in the given sequence, and display the tree at every merge.

[14 Marks]
Q5

Insert the following numbers, in the given sequence, in an empty B+ tree of order 3 and display the tree at every split : 10, 20, 30, 90, 80, 60, 70, 40, 50, 66, 16, 84, 21, 76. Now delete the following elements from the tree, in the given sequence, and display the tree at every merge.

[14 Marks]
Q6

Answer the following:

Q7

Differentiate between the following :

Q8

Explain in detail the Kruskal's and Prim's algorithms for constructing minimum spanning tree. For the weighted undirected graph given below, construct the minimum cost spanning tree for the given graph using Kruskal's algorithm and Prim's algorithm when the starting vertex is R1 :

[14 Marks]
Q9

Define the following :

2020 100304

B.Tech 3rd Semester Exam., 2020 (New Course)

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of the following (any seven):

Q1.1

Which of the following is time complexity of the given code?
$ int\ a=0; $
$ for(i=0; i< N; i++) \{ $
$ \quad for(j=N; j>i; j--) \{ $
$ \quad \quad a = a + i + j; $
$ \quad \} $
$ \} $

a)

O(N)O(N)

b)

O(N∗log⁡(N))O(N * \log(N))

c)

O(N∗N)O(N * \sqrt{N})

d)

O(N∗N)O(N * N)

Q1.2

Which of the following is time complexity of the given code?
$ int\ i,\ j,\ k=0; $
$ for(i=n/2; i<=n; i++) \{ $
$ \quad for(j=2; j<=n; j=j*2) \{ $
$ \quad \quad k = k + n/2; $
$ \quad \} $
$ \} $

a)

O(N)O(N)

b)

O(N∗log⁡(N))O(N * \log(N))

c)

O(N∗N)O(N * \sqrt{N})

d)

O(N∗N)O(N * N)

Q1.3

Which of the following cases does not exist in complexity theory?

a)

Best case

b)

Worst case

c)

Average case

d)

Null case

Q1.4

The operation of processing each element in the list is known as

a)

sorting

b)

merging

c)

inserting

d)

traversal

Q1.5

Arrays are best data structures

a)

for relatively permanent collections of data

b)

for the size of the structure and the data in the structure are constantly changing

c)

Both (i) and (ii)

d)

None of the above

Q1.6

Each array declaration needs not give, implicitly or explicitly the information about

a)

the name of array

b)

the data type of array

c)

the first data from the set to be stored

d)

the index set of the array

Q1.7

In general, the binary search method needs not more than

a)

[log⁡2n]−1[\log_2 n] - 1

b)

[log⁡n]+1[\log n] + 1

c)

[log⁡2n][\log_2 n]

d)

[log⁡2n]+1[\log_2 n] + 1 comparisons.

Q1.8

State True or False:
A. Binary search is used for searching in a sorted array.
B. The time complexity of binary search is O(logn).

a)

True, False

b)

False, True

c)

False, False

d)

True, True

Q1.9

Which of the following is non-linear data structure?

a)

Stack

b)

Linked list

c)

String

d)

Tree

Q1.10

Which is the correct output for the following sequence of operations? push(5), push(8), pop, push(2), push(5), pop, pop, pop, push(1), pop

a)

85251

b)

85521

c)

82551

d)

81255

Q.2 Solve this question :

Q2.1

Analyse the time complexity of the given function and also write the recurrence relation of the function:
$ int\ DoSomething(int\ n) \{ $
$ \quad if(n<=2)\ return\ 1; $
$ \quad else\ return\ (DoSomething(floor(sqrt(n))) + n); $
$ \} $

Q.3 Solve this question :

Q3.1

Consider the following postfix expression : 873-/6254+*+-
The above expression is evaluated using stack. Show the content of stack after each step.

Q.4 Solve this question :

Q4.1

What are the different notations for comparing the time complexity of an algorithm? Explain each of them with neat figures.

Q.5 Solve this question :

Q5.1

Explain the queue and circular queue with examples. Also, write the differences between the two.

Q.6 Solve this question :

Q6.1

Let a and b be positive integers. Suppose a function F is defined recursively as follows:
$ F(a,b) = \begin{cases} 0 & \text{if } a < b \\ F(a-b,b) + 1 & \text{if } b \le a \end{cases} $
Find the values of the following: (a) $ F(2,3) $ (b) $ F(14,3) $

Q.7 Solve both questions :

Q7.1

Write the algorithm of prefix evaluation with example.

Q7.2

Write prefix notation of the following infix notation: $ A+B*C+D $

Q.8 Solve this question :

Q8.1

What do you mean by ADT? Explain the ADT stack with test cases for both pop and push.

Q.9 Write short notes on the following:

Q9.1

Hashing

Q9.2

Circular linked list

Q9.3

Adjacency list

Q9.4

AVL tree

2020 V4 100304

B.Tech 3rd Semester Exam., 2020 (New Course)

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of the following (any seven):

Q1.1

Which of the following is time complexity of the given code?
$ int\ a=0; $
$ for(i=0; i< N; i++) \{ $
$ \quad for(j=N; j>i; j--) \{ $
$ \quad \quad a = a + i + j; $
$ \quad \} $
$ \} $

a)

O(N)O(N)

b)

O(N∗log⁡(N))O(N * \log(N))

c)

O(N∗N)O(N * \sqrt{N})

d)

O(N∗N)O(N * N)

Q1.2

Which of the following is time complexity of the given code?
$ int\ i,\ j,\ k=0; $
$ for(i=n/2; i<=n; i++) \{ $
$ \quad for(j=2; j<=n; j=j*2) \{ $
$ \quad \quad k = k + n/2; $
$ \quad \} $
$ \} $

a)

O(N)O(N)

b)

O(N∗log⁡(N))O(N * \log(N))

c)

O(N∗N)O(N * \sqrt{N})

d)

O(N∗N)O(N * N)

Q1.3

Which of the following cases does not exist in complexity theory?

a)

Best case

b)

Worst case

c)

Average case

d)

Null case

Q1.4

The operation of processing each element in the list is known as

a)

sorting

b)

merging

c)

inserting

d)

traversal

Q1.5

Arrays are best data structures

a)

for relatively permanent collections of data

b)

for the size of the structure and the data in the structure are constantly changing

c)

Both (i) and (ii)

d)

None of the above

Q1.6

Each array declaration needs not give, implicitly or explicitly the information about

a)

the name of array

b)

the data type of array

c)

the first data from the set to be stored

d)

the index set of the array

Q1.7

In general, the binary search method needs not more than

a)

[log⁡2n]−1[\log_2 n] - 1

b)

[log⁡n]+1[\log n] + 1

c)

[log⁡2n][\log_2 n]

d)

[log⁡2n]+1[\log_2 n] + 1 comparisons.

Q1.8

State True or False:
A. Binary search is used for searching in a sorted array.
B. The time complexity of binary search is O(logn).

a)

True, False

b)

False, True

c)

False, False

d)

True, True

Q1.9

Which of the following is non-linear data structure?

a)

Stack

b)

Linked list

c)

String

d)

Tree

Q1.10

Which is the correct output for the following sequence of operations? push(5), push(8), pop, push(2), push(5), pop, pop, pop, push(1), pop

a)

85251

b)

85521

c)

82551

d)

81255

Q.2 Solve this question :

Q2.1

Analyse the time complexity of the given function and also write the recurrence relation of the function:
$ int\ DoSomething(int\ n) \{ $
$ \quad if(n<=2)\ return\ 1; $
$ \quad else\ return\ (DoSomething(floor(sqrt(n))) + n); $
$ \} $

Q.3 Solve this question :

Q3.1

Consider the following postfix expression : 873-/6254+*+-
The above expression is evaluated using stack. Show the content of stack after each step.

Q.4 Solve this question :

Q4.1

What are the different notations for comparing the time complexity of an algorithm? Explain each of them with neat figures.

Q.5 Solve this question :

Q5.1

Explain the queue and circular queue with examples. Also, write the differences between the two.

Q.6 Solve this question :

Q6.1

Let a and b be positive integers. Suppose a function F is defined recursively as follows:
$ F(a,b) = \begin{cases} 0 & \text{if } a < b \\ F(a-b,b) + 1 & \text{if } b \le a \end{cases} $
Find the values of the following: (a) $ F(2,3) $ (b) $ F(14,3) $

Q.7 Solve both questions :

Q7.1

Write the algorithm of prefix evaluation with example.

Q7.2

Write prefix notation of the following infix notation: $ A+B*C+D $

Q.8 Solve this question :

Q8.1

What do you mean by ADT? Explain the ADT stack with test cases for both pop and push.

Q.9 Write short notes on the following:

Q9.1

Hashing

Q9.2

Circular linked list

Q9.3

Adjacency list

Q9.4

AVL tree

2020 PCC-IT-302 (100304)

B.Tech 3rd Semester Special Exam., 2020

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of the following (any seven):

Q1.1

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

a)

merge

b)

heap

c)

selection

d)

bubble

Q1.2

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

a)

Must be a sorted array

b)

Requirement of sorted array is expensive when a lot of insertions 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 are more than 1500

Q1.3

The complexity of the merge sort is

a)

O(n)O(n)

b)

O(log⁡n)O(\log n)

c)

O(n2)O(n^2)

d)

O(nlog⁡n)O(n\log n)

Q1.4

Which of the following is a hash function?

a)

A function has allocated memory to keys

b)

A function that computes the location of the key in the array

c)

A function that creates an array

d)

A function that computes the location of the values in the array

Q1.5

In simple hashing, what is the search complexity?

a)

O(n)O(n)

b)

O(log⁡n)O(\log n)

c)

O(nlog⁡n)O(n\log n)

d)

O(1)O(1)

Q1.6

In simple chaining, what data structure is appropriate?

a)

Singly linked list

b)

Doubly linked list

c)

Circular linked list

d)

Binary tree

Q1.7

Which is not true about insertion sort?

a)

Exhibits the worst case performance when the initial array is sorted in reverse order

b)

Worst case and average case performance is O(n2)O(n^2)

c)

Can be compared to the way a card player arranges his card from a card deck

d)

None of the above

Q1.8

Which of the below mentioned sorting algorithms is not stable?

a)

Selection sort

b)

Bubble sort

c)

Merge sort

d)

Insertion sort

Q1.9

A pivot element to partition unsorted list is used in

a)

merge sort

b)

bubble sort

c)

selection sort

d)

insertion sort

Q1.10

Which one of the following is divide and conquer approach?

a)

Insertion sort

b)

Merge sort

c)

Shell sort

d)

Heapsort

Q.2 Solve this question :

Q2.1

Write down breadth-first traversal and depth-first traversal of given graph taking 1 as source vertex.

Question Diagram

Q.3 Solve this question :

Q3.1

Construct a B-tree with minimum degree t as 3 and a sequence of integers 10, 20, 30, 40, 50, 60, 70, 80 and 90 in an initially empty B-tree. Show each step.

Q.4 Solve this question :

Q4.1

Write a function to perform merge sort on array of element mentioned. Also write recurrence relation for time complexity of algorithm.

Q.5 Solve this question :

Q5.1

What is AVL tree? Describe deletion operation in AVL tree with example.

Q.6 Solve this question :

Q6.1

Apply bubble sort on given array of integers: 26, 45, 13, 23, 12, 7, 38, 42. Show the content of array after every pass.

Q.7 Solve this question :

Q7.1

Write the algorithm to count leaf node in binary tree and check whether the tree is balanced or not.

Q.8 Solve both questions :

Q8.1

What is hash table? How can we use this structure to find all anagrams in a dictionary?

Q8.2

Write a function that inserts a given element in a binary search tree. If the element is already present, throw an exception 'duplicate value'.

Q.9 Write short notes on the following:

Q9.1

Linear and non-linear data structures

Q9.2

How to implement stack using queue

Q9.3

Heapsort

Q9.4

C++ STL

2020 SPECIAL PCC-IT-302 (100304)

B.Tech 3rd Semester Special Exam., 2020

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of the following (any seven):

Q1.1

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

a)

merge

b)

heap

c)

selection

d)

bubble

Q1.2

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

a)

Must be a sorted array

b)

Requirement of sorted array is expensive when a lot of insertions 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 are more than 1500

Q1.3

The complexity of the merge sort is

a)

O(n)O(n)

b)

O(log⁡n)O(\log n)

c)

O(n2)O(n^2)

d)

O(nlog⁡n)O(n\log n)

Q1.4

Which of the following is a hash function?

a)

A function has allocated memory to keys

b)

A function that computes the location of the key in the array

c)

A function that creates an array

d)

A function that computes the location of the values in the array

Q1.5

In simple hashing, what is the search complexity?

a)

O(n)O(n)

b)

O(log⁡n)O(\log n)

c)

O(nlog⁡n)O(n\log n)

d)

O(1)O(1)

Q1.6

In simple chaining, what data structure is appropriate?

a)

Singly linked list

b)

Doubly linked list

c)

Circular linked list

d)

Binary tree

Q1.7

Which is not true about insertion sort?

a)

Exhibits the worst case performance when the initial array is sorted in reverse order

b)

Worst case and average case performance is O(n2)O(n^2)

c)

Can be compared to the way a card player arranges his card from a card deck

d)

None of the above

Q1.8

Which of the below mentioned sorting algorithms is not stable?

a)

Selection sort

b)

Bubble sort

c)

Merge sort

d)

Insertion sort

Q1.9

A pivot element to partition unsorted list is used in

a)

merge sort

b)

bubble sort

c)

selection sort

d)

insertion sort

Q1.10

Which one of the following is divide and conquer approach?

a)

Insertion sort

b)

Merge sort

c)

Shell sort

d)

Heapsort

Q.2 Solve this question :

Q2.1

Write down breadth-first traversal and depth-first traversal of given graph taking 1 as source vertex.

Question Diagram

Q.3 Solve this question :

Q3.1

Construct a B-tree with minimum degree t as 3 and a sequence of integers 10, 20, 30, 40, 50, 60, 70, 80 and 90 in an initially empty B-tree. Show each step.

Q.4 Solve this question :

Q4.1

Write a function to perform merge sort on array of element mentioned. Also write recurrence relation for time complexity of algorithm.

Q.5 Solve this question :

Q5.1

What is AVL tree? Describe deletion operation in AVL tree with example.

Q.6 Solve this question :

Q6.1

Apply bubble sort on given array of integers: 26, 45, 13, 23, 12, 7, 38, 42. Show the content of array after every pass.

Q.7 Solve this question :

Q7.1

Write the algorithm to count leaf node in binary tree and check whether the tree is balanced or not.

Q.8 Solve both questions :

Q8.1

What is hash table? How can we use this structure to find all anagrams in a dictionary?

Q8.2

Write a function that inserts a given element in a binary search tree. If the element is already present, throw an exception 'duplicate value'.

Q.9 Write short notes on the following:

Q9.1

Linear and non-linear data structures

Q9.2

How to implement stack using queue

Q9.3

Heapsort

Q9.4

C++ STL

2019 100304

B.Tech 3rd Semester Exam., 2019 (New Course)

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of any seven of the following questions:

Q1.1

Which of the following points is/are true about linked list data structure when it is compared with array?

a)

Arrays have better cache locality that can make them better in terms of performance.

b)

It is easy to insert and delete elements in linked list.

c)

The size of array has to be pre-decided, linked lists can change their size any time.

d)

All of the above

Q1.2

What is the functionality of the following code?
$ public\ void\ function(Node\ node)\ \{ $
$ \quad if(size==0)\ head=node; $
$ \quad else\ \{ $
$ \quad \quad Node\ temp,\ cur; $
$ \quad \quad for(cur=head; (temp=cur.getNext())! $ $=null; cur=temp); $
$ \quad \quad cur.setNext(node); $
$ \quad \} $
$ \quad size++; $
$ \} $

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

Q1.3

What is the space complexity for deleting a linked list?

a)

O(1)O(1)

b)

O(n)O(n)

c)

Either O(1)O(1) or O(n)O(n)

d)

O(log⁡n)O(\log n)

Q1.4

The situation when in a linked list START=NULL is

a)

underflow

b)

overflow

c)

housefull

d)

saturated

Q1.5

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

a)

O(1)O(1)

b)

O(n)O(n)

c)

Θ(n)\Theta(n)

d)

Θ(1)\Theta(1)

Q1.6

What kind of linked list is best to answer question like "What is the item at position n"?

a)

Singly linked list

b)

Doubly linked list

c)

Circular linked list

d)

Array implementation of linked list

Q1.7

A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is

a)

it wastes memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node

b)

it is not possible to add a node at the end of the list

c)

it is difficult to traverse the list as the pointer of the last node is now not NULL

d)

All of the above

Q1.8

Each node in a linked list must contain at least

a)

three fields

b)

two fields

c)

four fields

d)

five fields

Q1.9

A linear list in which the last node points to the first node is

a)

singly linked list

b)

circular linked list

c)

doubly linked list

d)

None of the above

Q1.10

In a linked list, insertion can be done at

a)

beginning

b)

end

c)

middle

d)

All of the above

Q.2 Solve this question :

Q2.1

What is a Hash Table, and what is the average case and worst-case time for each of its operations? How can we use this structure to find all anagrams in a dictionary?

Q.3 Solve this question :

Q3.1

Describe insertion in max heap tree with example from the following list of numbers: 33, 42, 67, 23, 44, 49, 74

Q.4 Solve this question :

Q4.1

Sort the given values using quicksort and write time complexity of algorithm: 65, 70, 75, 80, 85, 60, 55, 50, 45

Q.5 Solve both questions :

Q5.1

Insert the following sequence of elements into an AVL tree, starting with an empty tree: 10, 20, 15, 25, 30, 16, 18, 19

Q5.2

Delete 30 in the AVL tree that you got.

Q.6 Solve both questions :

Q6.1

Write algorithm for quicksort and mention time and space complexity in each case.

Q6.2

Define collision in hashing. What are the different methodologies to resolve collision? Explain briefly.

Q.7 Solve this question :

Q7.1

Construct binary search tree and write pre- and post-order traversals of this tree: 8, 3, 1, 10, 6, 14, 4, 7, 13, 22, 5

Q.8 Solve both questions :

Q8.1

Write algorithm to count leaf node in binary tree and check whether tree is balanced or not.

Q8.2

Write a recursive and iterative version of insertion sort algorithm and mention time complexity.

Q.9 Write short notes on the following:

Q9.1

BFS

Q9.2

DFS

Q9.3

Binary search tree

Q9.4

Balance factor

2019 V4 100304

B.Tech 3rd Semester Exam., 2019 (New Course)

Time 03 Hours
Full Marks 70
Instructions:
  • The marks are indicated in the right-hand margin.
  • There are NINE questions in this paper.
  • Attempt FIVE questions in all.
  • Question No. 1 is compulsory.

Q.1 Choose the correct answer of any seven of the following questions:

Q1.1

Which of the following points is/are true about linked list data structure when it is compared with array?

a)

Arrays have better cache locality that can make them better in terms of performance.

b)

It is easy to insert and delete elements in linked list.

c)

The size of array has to be pre-decided, linked lists can change their size any time.

d)

All of the above

Q1.2

What is the functionality of the following code?
$ public\ void\ function(Node\ node)\ \{ $
$ \quad if(size==0)\ head=node; $
$ \quad else\ \{ $
$ \quad \quad Node\ temp,\ cur; $
$ \quad \quad for(cur=head; (temp=cur.getNext())! $ $=null; cur=temp); $
$ \quad \quad cur.setNext(node); $
$ \quad \} $
$ \quad size++; $
$ \} $

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

Q1.3

What is the space complexity for deleting a linked list?

a)

O(1)O(1)

b)

O(n)O(n)

c)

Either O(1)O(1) or O(n)O(n)

d)

O(log⁡n)O(\log n)

Q1.4

The situation when in a linked list START=NULL is

a)

underflow

b)

overflow

c)

housefull

d)

saturated

Q1.5

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

a)

O(1)O(1)

b)

O(n)O(n)

c)

Θ(n)\Theta(n)

d)

Θ(1)\Theta(1)

Q1.6

What kind of linked list is best to answer question like "What is the item at position n"?

a)

Singly linked list

b)

Doubly linked list

c)

Circular linked list

d)

Array implementation of linked list

Q1.7

A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is

a)

it wastes memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node

b)

it is not possible to add a node at the end of the list

c)

it is difficult to traverse the list as the pointer of the last node is now not NULL

d)

All of the above

Q1.8

Each node in a linked list must contain at least

a)

three fields

b)

two fields

c)

four fields

d)

five fields

Q1.9

A linear list in which the last node points to the first node is

a)

singly linked list

b)

circular linked list

c)

doubly linked list

d)

None of the above

Q1.10

In a linked list, insertion can be done at

a)

beginning

b)

end

c)

middle

d)

All of the above

Q.2 Solve this question :

Q2.1

What is a Hash Table, and what is the average case and worst-case time for each of its operations? How can we use this structure to find all anagrams in a dictionary?

Q.3 Solve this question :

Q3.1

Describe insertion in max heap tree with example from the following list of numbers: 33, 42, 67, 23, 44, 49, 74

Q.4 Solve this question :

Q4.1

Sort the given values using quicksort and write time complexity of algorithm: 65, 70, 75, 80, 85, 60, 55, 50, 45

Q.5 Solve both questions :

Q5.1

Insert the following sequence of elements into an AVL tree, starting with an empty tree: 10, 20, 15, 25, 30, 16, 18, 19

Q5.2

Delete 30 in the AVL tree that you got.

Q.6 Solve both questions :

Q6.1

Write algorithm for quicksort and mention time and space complexity in each case.

Q6.2

Define collision in hashing. What are the different methodologies to resolve collision? Explain briefly.

Q.7 Solve this question :

Q7.1

Construct binary search tree and write pre- and post-order traversals of this tree: 8, 3, 1, 10, 6, 14, 4, 7, 13, 22, 5

Q.8 Solve both questions :

Q8.1

Write algorithm to count leaf node in binary tree and check whether tree is balanced or not.

Q8.2

Write a recursive and iterative version of insertion sort algorithm and mention time complexity.

Q.9 Write short notes on the following:

Q9.1

BFS

Q9.2

DFS

Q9.3

Binary search tree

Q9.4

Balance factor

Made with ❤️ by Prit at GEC Sheikhpura

Install on iOS

To install BEU Connect on your iPhone:

1. Tap the Share button at the bottom of Safari.
2. Scroll down and tap "Add to Home Screen".