Questions and Answers of Data Structures and Other Objects Using Java

A BST is formed from the given sequence 6, 9, 1, 2, 7, 14, 12, 3, 8 and 18. The minimum number of nodes required to be added into this tree to form an extended binary tree is?A. 3 B. 6 C. 8 D. 11
Write algorithm for post-order traversing?
In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1 nodes contains, A. 2n leaf nodes B. n+1 internal nodes C. n+1 exterior nodes D. n-1 internal nodes
How do you insert a new element in a BST?
If n numbers are to be sorted in ascending order in O (n log n) time, which of the following tree can be used A. Binary tree B. Binary search tree C. Max-heap D. Min-heap
What is the minimum number of nodes that a binary tree can have?
If n elements are sorted in a balanced BST. What would be the asymptotic complexity to search a key in the tree? A. A O(1)B. O(logn)C. O(n)D. O(nlogn)
Write a note on heaps?
In which of the following tree, parent node has a key value greater than or equal to the key value of both of its children?A. Binary search tree B. Threaded binary tree C. Complete binary tree D.
Explain different ways of deleting of nodes in the BST.
A complete binary tree T has n leaf nodes. The number of nodes of degree 2 in T is A. log2n B. n-1 C. n D. 2n
Explain tree terminologies with suitable examples?
A BST is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60 and 24. The number of the node in the left sub-tree and right sub-tree of the root,
Explain different types of binary tree representation?
The number of edges or links from the root node to the deepest leaf is called _________ of the tree.A. Height B. Depth C. LengthD. Width
Write a note on breadth frst traversal and depth frst traversal?
In a complete binary tree or a proper binary tree or a strictly binary tree if the number of internal nodes is N, then the number of leaves or exterior nodes, E are?A. E = 2*N -1 B. E = N + 1 C. E
Explain recursive algorithm for in-order traversal?
Which of the following statements is false or true?1. A full binary tree or a proper binary tree or a strictly binary tree is a binary tree in which each node other than the leaves has one or two
What are the different operations performed on BSTs?
Which type of binary tree produces the value in ascending sorted order when it is traversed?A. Binary search tree B. Complete binary tree C. Strictly binary tree D. Almost complete binary tree
Explain different applications of heaps?
Which of the following statements is false or true?1. If a tree is dominated by the left child node or right child node, it is said to be a skewed binary tree.2. Forest is the disjoint union of
What is B tree?
Which of the following statements is false or true?1. An AVL tree is also a BST, but it is a balanced tree.2. Every AVL Tree is a BST, and all the BSTs are also AVL trees.A. Statement 1 is falseB.
What is the difference between B Tree and B+ tree?
Which of the following statements is false or true?1. B tree is a binary tree.2. B+ tree is used to provide indexed sequential file organization.A. Statement 1 is false B. Statement 2 is false C.
What are advantages and disadvantages of the AVL tree?
Which of the following statements is false or true?1. In a B+ tree, the search operation is different than that of BST.2. Internal sorting purpose B+ tree is used.A. Statement 1 is false B.
Define binary tree. Explain different types of binary trees.
Which of the following statements is false or true with respect to a B+ tree?1. In a B+ tree, all the leaf nodes must be at the same level.2. In a B+ tree, all leaves have been connected to form a
What is a graph?
Let us consider an unweighted graph G. Let a breadth-first traverse of G be done from a node r. Let d (r, u) and d (r, v) be the lengths of the shortest paths from r to u and v respectively, in G. of
What are the components that a graph consists of?
How many undirected graphs which are not necessarily connected can be formed out of a provided set V= {V 1, V 2,…V n} of n vertices?A. n(n-l)/2B. 2^nC. n!D. 2^(n(n-1)/2)
What is the difference between a connected graph and a non-connected graph?
Which of the following statements is/are TRUE for an undirected graph?P: Number of odd degree vertices is evenQ: The sum of degrees of all vertices is evenA. P OnlyB. Q OnlyC. Both P and QD. Neither
What is the difference between a directed graph and a non-directed graph?
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?A. A
What are weighted graphs?
Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices isA. EB. 2EC. VD. 2V
How do you represent components of a graph in a computer program?
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, ... vn} of n vertices?A. n(n-1)/B. 2nC. n!D. 2n(n-1)/2
What are the applications of graph data structure?
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the following statements is always
How does depth first traversal work?
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?A. 1B. 2C. 3D. n
How does breadth first traversal work?
Consider a directed graph with n vertices and m edges such that all edges have the same edge weights. Find the complexity of the best-known algorithm to compute the MST of the graph?A. O(m+n)B. O(m
What are the different applications of DFS and BFS?
For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim’s algorithm to construct an MST?A. (a, b), (d, f), (f, c), (g, i),
Describe in brief, the terms related to the graph: in-degree, out-degree, nodes and edges.
What is the number of edges present in a complete graph having n vertices?A. (n*(n+1))/2B. (n*(n-1))/2C. nD. Information given is insufficient
Write an algorithm for BFS on graph.
In the given graph, identify the cut vertices.A. B and EB. C and DC. A and ED. C and B E
Explain the time complexity of the BFS algorithm.
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.A. TrueB. False
Write a note on the advantages and disadvantages of the BFS algorithm.
What is the maximum number of edges in a bipartite graph having 10 vertices?A. 24 B. 21C. 25D. 16
Explain the in-degree and out-degree of a node with examples.
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G’(Complement of G) is ___________A. (n*n-n-2*m)/2B. (n*n+n+2*m)/2C. (n*n-n-2*m)/2D. (n*n-n+2*m)/2
Defne the following terms with respect to the graph:i. In-degree of a node ii. Directed graph iii. Weighted graph iv. Predecessor
A graph with all vertices having an equal degree is known as a _____________.A. MultigraphB. Regular graphC. Simple graphD. Complete graph
Explain the shortest path algorithm for graph with a suitable example.
Which of the following ways can be used to represent a graph?A. Adjacency list and adjacency matrixB. Incidence matrixC. Adjacency list, adjacency matrix as well as incidence matrixD. No way to
Write a note on MST?
Which of the following is true?A. A graph may contain no edges and many verticesB. A graph may contain many edges and no verticesC. A graph may contain no edges and no verticesD. A graph may contain
Explain in detail the DFS traversal of a graph.
The given Graph is regular.A. TrueB. False A B F D E
Describe non-recursive DFS algorithm in brief.
A connected planar graph having 6 vertices, 7 edges contain _____________ regions.A. 15B. 3C. 1D. 11
What are the different applications of DFS?
Which of the following statements is false or true?1. If an undirected simple graph of ‘n’ vertices consists of n (n-1)/2 number of edges then it is called a complete graph.2. A simple digraph is
What is the best case time complexity for insertion sort to sort an array of n elements?A. Ω (n)B. Ω (n log n)C. Ω (n2)D. Ω (n log n2)
Write and explain a C program to implement a linear search algorithm?
If the number of elements to be sorted is very less, then …… sorting can be efficient.A. Heap sortB. Quick sortC. Merge sortD. Selection sort
Can you implement a binary search algorithm without recursion?
Which sorting algorithm is of priority queue sorting technique?A. Quick sortB. Heap sortC. Insertion sortD. Selection sort
Implement and write the bubble sort algorithm?
Sorting is also known as a partition and exchange type of sort.A. Quick sortB. Heap sortC. Insertion sortD. Selection sort
Write advantages and disadvantages of the bubble sort with performance analysis of the Bubble sort?
Which of the following sorting algorithm is based on the divide and-conquer technique?A. Bubble sortB. Selection sortC. Merge sortD. Insertion sort
Explain how selection sort works with advantages?
What is an external sorting algorithm?A. Algorithm that uses hard disk while sorting the elements.B. Algorithm that uses main memory or primary memory during the sorting of the elements.C. Algorithm
Why Sorting algorithms are important?
The time complexity analysis of the heap sort in the worst-case scenario isA. O(n2 log n)B. O(log n)C. O(n log n)D. O(n2 log n2)
Explain how insertion sort works with performance analysis of insertion sort?
If the given input array elements are almost sorted in this scenario, which of the following internal sorting algorithm gives the optimum performance efficiency?A. Selection sortB. Bubble sortC. Heap
What are the advantages and disadvantages of quick sort?
What is special algorithm design paradigm is used in the quick sort and merge sort algorithm?A. Greedy method paradigmB. Backtracking paradigmC. Divide-and-conquer paradigmD. Dynamic programming
Explain and write how heap sort works with a suitable algorithm?
What is the complexity of the search time of the hashing search method?A. O (n2)B. O (logn)C. O (nlogn)D. O (1)
Define merge sort. What are the advantages of merge sort?
Which of the following is not the technique to avoid collision in hashing?A. Linear probingB. Chaining with replacementC. Chaining without replacementD. Dynamic programming
Differentiate linear search and binary search.
In the chaining technique in hashing, which of the following data structure is most suitable?A. Singly linear linked listB. Doubly linked listC. TreeD. Graph
Explain the linear search algorithm with an example.
What is the worst-case time complexity of linear search and binary search, respectively?A. O (n log2 n), O(log2 n)B. O(log2 n), O(n)C. O(n), O(log2 n)D. O(1), O(n)
Write down the merge sort algorithm and give its worst-case, best-case and average-case analysis.
The case in which a hash key other than the desired one is kept at the identified location is called as?A. Open hashingB. Closed hashingC. ChainingD. Collision

Showing 1 - 100 of 507