My Report (&Account)

Data Structure Online Test


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)

Here is the complete list of test quizzes on Data Structure.

1. Consider two arithmetic operators + and –. The precedence of + is higher than that of –. + is right-associative whereas – is left-associative. Which of the following parse tree represents the expression (2 – 4 + 6 + 8 -1)?

Question 1 of 50

2. Each level in a k-d tree is made of?

Question 2 of 50

3. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 4*2+3-5/5

Question 3 of 50

4. The time complexity of the code that determines the number of inversions in an array using self balancing BST is lesser than that of the code that uses loops for the same purpose.

Question 4 of 50

5. What is a skip list?

Question 5 of 50

6. What is direct addressing?

Question 6 of 50

7. Can the two edges that are coming out of a node have labels of string beginning with the same character?

Question 7 of 50

8. On what value does the probe sequence depend on?

Question 8 of 50

9. When array reversal and rotation is applied to the same array then the output produced will also be the same every time.

Question 9 of 50

10. What is the functionality of the following piece of code?

public void function(Object item)
{
	Node temp=new Node(item,trail);
	if(isEmpty())
	{
		head.setNext(temp);
		temp.setNext(trail);
	}
	else
	{
		Node cur=head.getNext();
		while(cur.getNext()!=trail)
		{
			cur=cur.getNext();
		}
		cur.setNext(temp);
	}
	size++;
}

Question 10 of 50

11. Cosider the below formations of red-black tree.
50-black root, 18-red left subtree, 100-red right subtree of red-black tree
All the above formations are incorrect for it to be a redblack tree. then what may be the correct order?

Question 11 of 50

12. What are implicit and explicit implementations of freelists?

Question 12 of 50

13. Select the appropriate code that inserts elements into the list based on the given key value.
(head and trail are dummy nodes to mark the end and beginning of the list, they do not contain any priority or element)

Question 13 of 50

14. Can leaf node be called child node in a ternary tree?

Question 14 of 50

15. What is the other name or Van Emde Boas Tree data structure?

Question 15 of 50

16. Do all the nodes have at least two children in suffix tree.

Question 16 of 50

17. MultiGraphs having self-loops are called PseudoGraphs?

Question 17 of 50

18. A leftist heap is also said to be a binary heap.

Question 18 of 50

19. Consider the following operation performed on a stack of size 5.

Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);

After the completion of all operation, the number of elements present in stack is?

Question 19 of 50

20. Which of the following trees is similar to that of an AA-Tree?

Question 20 of 50

21. What is the time complexity for splitting the string into two new string in the rope data structure?

Question 21 of 50

22. Reversing a word using stack can be used to find if the given word is a palindrome or not.

Question 22 of 50

23. What are the set of functions that are to be executed to get the following output?
cat

Question 23 of 50

24. What is the longest length path for a node x in random binary search tree for the insertion process?

Question 24 of 50

25. Which of the following is not the application of stack?

Question 25 of 50

26. How do you insert a node at the beginning of the list?

Question 26 of 50

27. Which of the following is not an inherent application of stack?

Question 27 of 50

28. Which of the following is an advantage of open addressing over separate chaining?

Question 28 of 50

29. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)

Question 29 of 50

30. A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

Question 30 of 50

31. What is the advantage of hashing with chaining?

Question 31 of 50

32. Which is the simplest of all binary search trees?

Question 32 of 50

33. Select the code snippet which performs level-order traversal.

Question 33 of 50

34. When the corresponding end bracket/braces/parentheses is not found, what happens?

Question 34 of 50

35. Which of the following statement is true.

Question 35 of 50

36. What will be the auxiliary space complexity of the code to rotate an array by using the reversal algorithm (d = number of rotations)?

Question 36 of 50

37. What are the siblings of smallest element of the given maximum ternary heap?
The highest element of the given maximum ternary heap is 31

Question 37 of 50

38. What is the corresponding postfix expression for the given infix expression?

a+(b*c(d/e^f)*g)*h)

Question 38 of 50

39. What is the special property of red-black trees and what root should always be?

Question 39 of 50

40. The number of trees in a binomial heap with n nodes is

Question 40 of 50

41. Which of the following statement is incorrect?

Question 41 of 50

42. Select the appropriate code for the recursive Tower of Hanoi problem.(n is the number of disks)

Question 42 of 50

43. If there are c children of the root, how many calls to the merge procedure is required to reassemble the heap?

Question 43 of 50

44. What is the correct notation for a load factor?

Question 44 of 50

45. Determine the number of vertices for the given Graph or Multigraph?
G is a 4-regular Graph having 12 edges.

Question 45 of 50

46. What is the functionality of the following piece of code?

public Object function(int row_index, int col_index)
{
        if (row_index < 0 || col_index > N)
	{
            System.out.println("column index out of bounds");
			return;
	}
        return (sparse_array[row_index].fetch(col_index));
}

Question 46 of 50

47. Which of the following tree traversals work if the null left pointer pointing to the predecessor and null right pointer pointing to the successor in a binary tree?

Question 47 of 50

48. What is the total time spent for N-1 merges in a dynamic equivalence problem?

Question 48 of 50

49. Which technique is used for finding similarity between two sets?

Question 49 of 50

50. Entries in a stack are "ordered". What is the meaning of this statement?

Question 50 of 50


 

Topic wise Test Quizzes on Data Structure

Data Structure tests, quizzes, and exams are great ways to learn and test your Data Structure skills. Whether you’re a beginner or experienced, challenge and boost your confidence with our engaging online quizzes on Data Structure Basics, Linked List, Stack, Queue, Expression Conversions, Arrays Types, List Types, Binary Tree, B-Tree, Trees, Heap, Trie, Hash Table and Graph Data Structure. Start the Data Structure online test now!

Data Structure Basic Quiz

Abstract Data Types Quiz

Expression Evaluation Quiz

Arrays Types Quiz

Types of Lists Quiz

Binary Tree Quiz

B-Tree Quiz

Trees Quiz

Heap Quiz

Trie Quiz

Hash Table Quiz

Graph Quiz


Data Structure Certification Test

Data Structure Certification Test is a free certification exam. However, you need to score an A grade in each of the "Certification Level Tests 1 to 10" to be eligible to take part in this certification test. So, take all the "10 Tests" starting from Certification Level 1 upto Level 10, before taking the final Certification test.

Level 1 Test Certification Test

Level 1 to 10 Tests:
Total Questions: 25, Total Time: 30 min, Correct Answer: 2 points, Wrong Answer: -1 point

Certification Test:
Total Questions: 50, Total Time: 1 hour, Correct Answer: 2 points, Wrong Answer: -1 point

Data Structure Internship Test

If you scored either Grade A* or Grade A in our Data Structure Internship Test, then you can apply for Internship at Sanfoundry in Data Structure.

Data Structure Internship Test

Total Questions: 50, Total Time: 1 hour, Correct Answer: 2 points, Wrong Answer: -1 point

Data Structure Job Test

It is designed to test and improve your skills for a successful career, as well as to apply for jobs.

Data Structure Job Test

Total Questions: 50, Total Time: 1 hour, Correct Answer: 2 points, Wrong Answer: -1 point

Note: Before you get started on these series of online tests, you should practice our collection of 1000 MCQs on Data Structure .

Sanfoundry Scoring & Grading System

Sanfoundry tests and quizzes are designed to provide a real-time online exam experience. Here is what you need to know about them.

  • Scoring System: You get 2 points for each correct answer but lose 1 point for every wrong answer.
  • Grading System: Your grade depends on your final score and can be one of the following:

    • Grade A* - Genius (100%)
    • Grade A - Excellent (80% to 99%)
    • Grade B - Good (60% to 80%)
    • Grade C - Average (40% to 60%)
    • Grade D - Poor (0% to 40%)
advertisement
advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.