Get our Mobile Apps
Subscribe our Newsletter

Data Structures & Algorithms

Arrays, linked lists, trees, graphs, sorting, and algorithmic complexity.

02

Quizzes

20

Questions

00

eBooks

01

Articles

00

Likes

124

Views

00

Shares

Data Structures & Algorithms

More topics in Computer Science

Computer Science
All

Computer Science
AJAX
AJAX

00 Quizzes

Angular JS
Angular JS

00 Quizzes

ASP .NET
ASP .NET

00 Quizzes

Bootstrap
Bootstrap

00 Quizzes

C
C

00 Quizzes

C#
C#

00 Quizzes

C++
C++

00 Quizzes

CodeIgniter
CodeIgniter

00 Quizzes

Computer Networks
Computer Networks

01 Quizzes

CSS
CSS

01 Quizzes

Data Structures & Algorithms
Data Structures & Algorithms

02 Quizzes

Databases
Databases

01 Quizzes

Go Lang
Go Lang

00 Quizzes

HTML
HTML

01 Quizzes

Java
Java

00 Quizzes

JavaScript
JavaScript

01 Quizzes

JQuery
JQuery

00 Quizzes

Laravel
Laravel

00 Quizzes

Node JS
Node JS

00 Quizzes

Operating Systems
Operating Systems

01 Quizzes

PHP
PHP

00 Quizzes

Python
Python

01 Quizzes

React JS
React JS

00 Quizzes

React Native
React Native

00 Quizzes

Ruby on Rails
Ruby on Rails

00 Quizzes

Software Engineering
Software Engineering

01 Quizzes

Tailwind CSS
Tailwind CSS

00 Quizzes

Vue JS
Vue JS

00 Quizzes

Data Structures & Algorithms
Explore
QUESTION NO 01
Share
Dijkstra's algorithm finds?

Answer: Shortest paths from a source in a weighted graph
Dijkstra computes shortest paths from one source (non-negative weights).
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 02
Share
Which traversal visits left subtree, root, then right subtree?

Answer: Inorder
Inorder is left → root → right.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 03
Share
Space complexity of an in-place algorithm is typically?

Answer: O(1) extra space
In-place algorithms use constant (or very small) extra memory beyond the input.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 04
Share
A linked list stores elements as?

Answer: Nodes with data and pointers
Each node holds data and a reference/pointer to the next node.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 05
Share
Space complexity of an in-place algorithm is typically?

Answer: O(1) extra space
In-place algorithms use constant (or very small) extra memory beyond the input.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 06
Share
Worst-case time for searching in an unsorted array is?

Answer: O(n)
Linear search may scan all n elements in the worst case.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 07
Share
Dijkstra's algorithm finds?

Answer: Shortest paths from a source in a weighted graph
Dijkstra computes shortest paths from one source (non-negative weights).
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 08
Share
Which sorting algorithm has average time complexity O(n log n)?

Answer: Merge sort
Merge sort divides and merges in O(n log n) average and worst case.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 09
Share
A hash table ideally provides average lookup time of?

Answer: O(1)
With a good hash function and load factor, average lookup is O(1).
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes
QUESTION NO 10
Share
A stack can be used to evaluate?

Answer: Postfix expressions
Operand stacks are classic for evaluating postfix (RPN) expressions.
Shahzad Mahota
Shahzad Mahota @shahzad-mahota
302 Quizzes
2930 Questions
00 Likes

© 2026 Qaydum.com All Rights Reserved.