TECHNICAL QUIZ

Krish has an question in a tree data structure , hence choose the correct option for his question.

A node in a tree, such that removing its splits the tree into forests, with size of each connected component being not greater than n/2 is called ?

• Centroid

• Center

• Path

• Diameter

Choose from the below options , Which is true about AVL Trees?

• AVL Trees are a type of self-balancing Binary Search Trees.

• The height of an AVL Tree always remains of the order of O(logn)

• The difference between the heights of left and right nodes cannot be more than 1.

• All of the above.

Which of the following represents the Postorder Traversal of a Binary Tree?

• Right -> Root -> Left

• Left -> Root -> Right

• Left -> Right -> Root

• Right -> Left -> Root

What is the time complexity to insert an element to the rear of a LinkedList(head pointer given)?

• O(n * logn)

• O(n)

• O(1)

• O(logn)

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

• Selection Sort

• Quick Sort

• Bubble Sort

• Merge Sort

Which of the following is not the application of stack?

• Tracking of local variables at run time

• Data Transfer between two asynchronous process

• A parentheses balancing program

• Compiler Syntax Analyzer

The following python program can work with ____ parameters.

• 15

• 3

• 2

• any number of

What will be the output of the following Python function?

• False

• True

• None

• <0x19967>

What will be the output of the following Python code?

• Hello (‘foo’, ‘bin’) and (‘foo’, ‘bin’)
  

• Hello foo and bin

• Error

• None of the mentioned

Which of the following is a feature of Python DocString?

• It provides a convenient way of associating documentation with Python modules, functions, classes, and methods

• In Python all functions should have a docstring

• None of the mentionedDocstrings can be accessed by the doc attribute on objects

• All of the mentioned