Data Structures

Data Structures

Assessment

Flashcard

Computers

University

Medium

Created by

Lakshmi priya p

Used 1+ times

FREE Resource

Student preview

quiz-placeholder

4 questions

Show all answers

1.

FLASHCARD QUESTION

Front

What defines a Primitive Data Structure?

Back

A Primitive Data Structure defines a set of primitive elements that do not involve any other elements as its subparts. These are generally built-in data types in programming languages, e.g., Integers, Characters.

2.

FLASHCARD QUESTION

Front

What are Non-Primitive Data Structures?

Back

Non-Primitive Data Structures define a set of derived elements such as Arrays, Structures, and Classes.

3.

FLASHCARD QUESTION

Front

What is a Linear Data Structure?

Back

A Data Structure is said to be linear if its elements form a sequence and each element has a unique successor and predecessor, e.g., Stack, Queue.

4.

FLASHCARD QUESTION

Front

What are Non-Linear Data Structures?

Back

Non-Linear Data Structures are used to represent data that have a hierarchical relationship among the elements. In non-linear Data Structures, every element has more than one predecessor and one successor, e.g., Trees, Graphs.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers