# Data Structure And Algorithms Using Java Assignment 6 Answers 2022

NPTEL Data Structure And Algorithms Using Java Assignment 6 Answers 2022:- In this post, we have provided answers to NPTEL Data Structure And Algorithms Using Java Assignment 6. We provided answers here only for reference. Please, do your assignment to your own knowledge.

## About Data Structure And Algorithms Using Java

With the growth of Information and Communication Technology, there is a need to develop large and complex software. For developing large software, software developers should have enough proficiency in data structures and algorithms. Further, that software should be platform independent, Internet-enabled, easy to modify, secure, and robust. To meet this requirement object-oriented paradigm has been developed and based on this paradigm the Java programming language emerges as the best programming environment.

Now, Java programming language is being used for mobile programming, Internet programming, and many other applications compatible with distributed systems. This course aims to cover the essential topics of data structures and algorithms and how the same can be implemented using Java programming language. The participants of the proposed course will be able to improve their skills, cope with the current demand of IT industries and solve many problems in their own field of studies.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of the best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF THE AVERAGE ASSIGNMENT SCORE >=10/25 AND THE EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

## Data Structure And Algorithms Using Java Assignment 6 Answers 2022

1. Which of the following is/are TRUE about BST(Binary Search tree)?

a. The complexity of building a BST is nearly equal to O(nlogan)
b. Searching an element in BST costs O(n) is the best case
c. Searching for an element in BST costs O(n*) is the worst case
d. Searching for an element in BST costs O(logan) in the average case

`Answer:- a, c`

2. Which of the following is/are TRUE about queue?

a. Linear data structure
b. Non-Linear data structure
c. Heterogeneous data structure
d. Non-homogeneous data structure a. c.

`Answer:- a`

3.

`Answer:- d, e`

4. Which of the following is/are TRUE about queue methodology?

a. First-in-First-out
b. Last-in-First-out
c. Both a & b
d. None of these

`Answer:- a`

5.

`Answer:- a, b, c, d, e`

6. What is enqueue operation in queue?

a. Data insertion
b. Data deletion
c. Check if queue is full
d. None of these

`Answer:- a`

7.

`Answer:- c`

8. What will be the inorder traversal of the following Binary search tree?

a. 1,2, 3, 4, 6, 8
b. 6,2, 1, 4, 3, 8
c. 1.3,4, 2, 8, 6
d. 6, 2, 8, 1, 4, 3

`Answer:- a`

9. Which of the following is/are correct example for unbounded queue?

a. Array
`Answer:- b`
`Answer:- c`