Data Structures quizzes
64 quizzes by 46 users · Page 1 of 2
This Data Structures quizzes page gathers community-made questions on graphs, trees, linked lists and sets in Python. With more than 50 quizzes made by over 30 users, it offers practice for university students and school students, as well as material for teachers. Choose a topic and try a quiz.
Select topic
Quizzes
-
200 questionsAdvanced Algorithm (Eldan) 1 (200) What does the following function do for a given Linked List with first node as head? void fun1(struct node*...
-
182 questionsD
-
152 questionssdp4 Re-balancing of AVL tree costs
-
73 questionsGraph Theory What is the formal name for the points on a graph?
-
15 questionsSets in Python
-
15 questions12. Graph Traversal When you have a cycle in a graph and you are trying to implement a traversal, what is the most common metho...
-
20 questions1. Trees Splay Trees Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.
-
40 questions2_COP 4530 Exam 1 practice quiz Write a traversal loop for an fsu::Vector object v .
-
20 questions1_Exam 2 (just the ones that are new)
-
28 questions1_Final Practice What operators must exist for an iterator class to be considered a bidirectional iterator? (Select all that...
-
200 questionsCSCI 3110 Test 2 Review If I have this unsorted array: 21 64 35 89 3 35z 89a, Give an example of a stable sorting algorithm working...
-
187 questionssdp4 Choosing pivot and place all items smaller than pivot to the left and bigger ones to the right, then repeat...
-
183 questionsCS_DATA_STRUCT Inheritance is ...
-
75 questionsdatabase final Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these n...
-
47 questionsch_8 What is the representation of the third element in an array called a?
-
40 questionsCOP 4530 Exam 1 practice quiz Write a traversal loop for an fsu::Vector object v .
-
40 questions1_COP 4530 Exam 1 practice quiz Write a traversal loop for an fsu::Vector object v .
-
45 questionsDesign Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on th...
-
44 questionsIntro to Computer Science S2 Chapter 10 It is not possible for an array to hold an array.
-
29 questionsCS 203 Sample Exam_2 Sample
-
29 questionsCS 203 Sample Exam_1 Sample
-
36 questionsDatabase Algorithm midterm Data Encapsulation: The separation of the representation of data from the applications that use the data at...
-
32 questionsData Structures 1 - Review 1 How is a non-circular, doubly-linked list different from a circular, doubly-linked list (which is true for ...
-
30 questionsChapter 8 Which of the following is a LIFO structure?
-
50 questionsCPP and DataStructures Two main measures for the efficiency of an algorithm are
-
20 questionsICS2210 RBT are always balanced
-
40 questionsData Structures How do referenced types differ from primitive types?
-
27 questionsD-Structures and Algorithms Midterm An algorithm is a step-by-step procedure for solving a problem in a finite amount of time.
-
27 questionsData Structures 1 - Review 2 Binary search trees are efficient because they guarantee Θ(logn) access time.
-
39 questionsUntitled In computer science, a tree is an abstract model of a hierarchical structure
-
19 questionsch_7 Which of the following statements are correct?
-
20 questionsExam 2 (just the ones that are new)
-
11 questionsAdvanced Algorithm (Eldan) 2 (11) Dan Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traver...
-
11 questionsAdvanced Algorithm (Eldan) 2 (11) Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traver...
-
25 questionsData Structure Forum Quiz 1 Which of these best describes an array?
-
28 questionsFinal Practice What operators must exist for an iterator class to be considered a bidirectional iterator? (Select all that...
-
15 questions1_runtimes and minimal set operations Select the answer that best describes the asymptotic runtime of the operation fsu::L...
-
17 questions9. Hashing Intro What symbol is used to represent Load Factor and give the equation for determining Load Factor?
-
21 questionsUntitled A breadth first traversal of a tree or a graph is commonly implemented with a(n):
-
15 questionsGAME 1001 Chapter 8 An array is:
More Data Structures resources
About data structures quizzes
GoConqr OriginalChoosing Data Structures quizzes
Start with Graph Theory if you want to practise the terms for points and lines on a graph. For code-based questions, Sets in Python asks you to predict output and consider set operations. Linked Lists includes questions on adding a node and printing data in reverse order.
There are also quizzes on splay trees and graph traversal, plus review questions on linked lists, binary search trees and AVL trees. Choose a topic you are studying rather than working through the listing in order.
Revise with questions
Try answering without notes, then return to any question you found difficult. If you need to revisit a structure or its terminology, switch to a mind map or flashcards on the Data Structures unit page before returning to the quiz.
Pick a quiz that matches the topic you want to practise.
Frequently asked questions
Which quiz could I start with?
Try Graph Theory if you want to begin with graph terminology. It asks for the formal names of points and lines on a graph. If you would rather practise reading code, Sets in Python includes a question about the output of a set operation.
What topics do the quizzes cover?
The listing includes questions on graphs, splay trees, graph traversal, sets in Python and linked lists. There are also review quizzes with questions on binary search trees and AVL trees. You can choose a quiz according to the topic you want to practise.
Are these quizzes free to use?
Yes. Every quiz listed here is free to open, study and take without an account. The resources were made by GoConqr users. A free account also lets you save quiz scores and make your own quizzes, mind maps, flashcards and notes.