Data Structures Quizzes, Questions & Answers

Recent Quizzes

This quiz focuses on fundamental data structures, including simple types, operators, and array characteristics, designed for students studying computer science or programming.

Questions: 25 | Attempts: 5194 | Last updated: Mar 22, 2023

Sample Question
Yang termasuk struktur data sederhana yaitu

Int, char, float, bool

Array dan struct

Tree

Linked list

Data Structure Skills Quiz! Trivia

Have you ever heard of data structure? A data structure is a data organization, supervision and storage format that allows for efficient contact and modification in computer science. Data structures are often employed as...

Questions: 10 | Attempts: 360 | Last updated: Mar 21, 2023

Sample Question
Struct Node{ int val; struct Node *next; }*head; int get_max() { struct Node* temp = head->next; int max_num = temp->val; while(______) { if(temp->val > max_num) max_num = temp->val; temp = temp->next; } return max_num; } Which of the following lines should be inserted to complete the above code?

Temp->next!=0

Temp->next!=0

Head->next!=0

Head != 0

Advance Data Structure Quiz-1

This Advance Data Structure Quiz-1 assesses knowledge on various trees like R-B Trees, 2-3 Trees, and Binary Search Trees. It explores properties, operations, and structural outcomes, enhancing understanding of complex data...

Questions: 15 | Attempts: 260 | Last updated: Mar 20, 2023

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Do You Know A Nibble?

Do you know a Nibble?

Alright computer whizes, here's another one. What's a nibble (smaller than a bit)? What do you know about it? And how extensive is your knowledge of it? Attack this quiz.

Questions: 10 | Attempts: 64 | Last updated: Mar 21, 2023

Sample Question
A nibble is known as half of?

Bit

Byte

Octet

Terabit

Ds Quiz 4 Cse D

DS QUIZ 4 CSE D

DS QUIZ 4 CSE D assesses knowledge on circular queues, priority queues, and queue configurations. It tests the understanding of queue operations, conditions for full or empty queues, and priority queue representations, essential...

Questions: 10 | Attempts: 163 | Last updated: Mar 17, 2023

Sample Question
Suppose a circular queue of capacity n elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = -1. The conditions to detect queue full and queue empty are:

Full: (REAR+1) mod n = = FRONT, empty: (FRONT+1) mod n == REAR

Full: REAR == FRONT, empty: (REAR+1) mod n = = FRONT

Full: (FRONT+1) mod n = = REAR, empty: FRONT= =REAR=-1

Full: (REAR+1) mod n = = FRONT, empty: REAR = = FRONT= -1

Online Test On Algorithms And Data Structure

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING FM: 50 PM: 30 ...

Questions: 50 | Attempts: 317 | Last updated: Mar 21, 2023

Sample Question
In linked lists there are no NULL links in

Single linked list

Linear doubly linked list

Circular linked list

None of these

IT 15 Semi Finals Section 10

IT 15 SEMI FINALS SECTION 10

This quiz titled 'IT 15 SEMI FINALS SECTION 10' tests knowledge on arrays in programming, focusing on their properties, types, and capacities.

Questions: 22 | Attempts: 49 | Last updated: Apr 19, 2023

Sample Question
It is a collection of values with the same data type.

Variable

Array

Functions

Constants

Data Structures (Dummy Test)

The 'Data Structures (Dummy Test)' assesses understanding of basic data structure concepts such as stacks and searching algorithms. It evaluates knowledge of LIFO principles, applications, and computational evaluations relevant...

Questions: 10 | Attempts: 244 | Last updated: Aug 23, 2023

Sample Question
A Stack follows the principle of

LIFO

FIFO

BOTH A and B

None

13it33 - Data Structures MCQ Type Test

13IT33 - DATA STRUCTURES MCQ TYPE TEST

This MCQ test titled '13IT33 - DATA STRUCTURES' evaluates knowledge in binary tree traversals, array operations, and basic data structure concepts. It assesses key skills in searching, traversal, and understanding of linear and...

Questions: 30 | Attempts: 234 | Last updated: Mar 20, 2023

Sample Question
The inorder and preorder traversal of a binary tree are d, b, e, a, f, c, g and a, b, d, e, c, f, g respectively. The postorder traversal of the binary tree is:

D, e, b, f, g, c, a

E, d, b, g, f, c, a

E, d, b, f, g, c, a

D, e, f, g, b, c, a

Cop4858 Final Review - 52 Questions

COP4858 Final Review - 52 questions

The COP4858 Final Review consists of 52 questions focusing on fundamental concepts of data structures and programming, including binary operations, data flow, and memory management. It assesses key skills in understanding and...

Questions: 52 | Attempts: 106 | Last updated: Mar 1, 2024

Sample Question
In the decimal or binary notations, the symbol used to represent a digit and the digit’s position in a string determines its ____.

Sign

Placement

Base

Value

« Previous 123 4 Next »