Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

DSA > Data Structures > Flashcards

Data Structures Flashcards

1
Q

is representation of the logical relationship existing between individual elements of data.

A

Data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

is a way of organizing all data items that considers not only the elements stored but also their relationship to each other

A

Data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

is a step by step procedure to solve
a particular function

A

algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

is a set of instructions written to carry out certain tasks & the data structure is the way of organizing the data with their logical relationship retained

A

algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Data structure are normally divided into two broad categories

A
  • Primitive Data Structure
  • Non-Primitive Data Structure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are examples of Primitive Data Structures?

A

Integer, Float, Character, Pointer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Two kinds of non-primitive Data Structures

A

Linear List, Non-Linear List

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

examples of Linear Lists include

A

Array, Link List, Stack, Queue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

examples of Non-Linear Lists include

A

Graph, Trees

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

These are basic structures and directly operated upon by the machine instructions

A

Primitive Data Structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

derived from primitive structures, structured grouping of homogenous or heterogenous data items, sophisticated structuring and operations.

A

Non-primitive data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

is generally a basic structure that is usually built into the language, such as an integer, a float

A

Primitive Data Structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

is built out of primitive data structures linked together in meaningful ways, such as a or a linked-list, binary search tree, AVL Tree, graph etc

A

Non-primitive data structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Identify the Data Structure:

is defined as a set of finite number of
homogeneous elements or same data items, can contain one type of data only,
either all integer, all float-point number or all character

A

array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Identify the Data Structure:

the first element of this data structure has an index of [0] and its elemets are always stored consecutively in memory location

A

array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Some common operation performed on array are

A
  • Creation of an array
  • Traversing an array
  • Insertion of new element
  • Deletion of required element
  • Modification of an element
  • Merging of arrays
17
Q

Identify the Data Structure:

can be defined as a collection of variable number of data items.

A

Lists (Linear linked list)

18
Q

Identify the Data Structure:

the elements of this data structure contain at least two fields, one for
storing data or information and other for storing address of next element.

A

Lists

19
Q

Identify the Data Structure:

each such element is referred to as a node, thus it can be defined as a collection of nodes

A

List

20
Q

Types of linked lists

A
  • Single linked list
  • Doubly linked list
  • Single circular linked list
  • Doubly circular linked list
21
Q

Identify the Data Structure:

is also an ordered collection of elements like arrays, but it has a special feature that deletion and insertion of elements can be done only from one end called the top of the stack

A

Stack

22
Q

Identify the Data Structure:

it is also called as last in first out
type of data structure

A

Stack

23
Q

Identify the Data Structure:

when an element is inserted into or removed from this data structure, its base remains fixed while the top changes

A

Stack

24
Q

Insertion of element into stack is called

A

PUSH

25
Q

deletion of element from stack is called

A

POP

26
Q

The stack can be implemented into two ways:

A
  • Using arrays (Static implementation)
  • Using pointer (Dynamic implementation)
27
Q

Identify the Data Structure:

first in first out type of data structure

A

Queue

28
Q

Identify the Data Structure:

new elements are added to the data structure from one end called REAR end and the element are always removed from other end called the FRONT end

A

Queue

29
Q

The queue can be implemented into two ways:

A
  • Using arrays (Static implementation)
  • Using pointer (Dynamic implementation)
30
Q

Identify the Data Structure:

non-linear type of data structure in which data items are arranged or stored in a sorted sequence

A

Tree

31
Q

Identify the Data Structure:

represent the hierarchical relationship between
various elements

A

Tree

32
Q

In trees, there is a special data item at the top of hierarchy called the

A

Root of the tree

33
Q

Identify the Data Structure:

organizes the data into branches,
which related the information

A

Tree

34
Q

The tree always grows in length towards what direction in data structures

A

The tree always grows in length towards bottom

35
Q

Identify the Data Structure:

In this structure, an edge links two vertices, often with associated weights like length or cost. Vertices are represented as points or circles, while edges are depicted as arcs or line segments.

A

Graph

36
Q

Types of Graphs

A
  • Directed graph
  • Undirected graph
  • Simple graph
  • Weighted graph
  • Connected graph
  • Non-connected graph
37
Q

Identify the Data Structure:

these data structures provide constant-time average-case performance for key-value pair operations, making them ideal for implementing dictionaries, caches, and symbol tables.

A

Hash Tables

38
Q

Identify the Data Structure:

these are tree-based data structures used for efficient string searching and autocomplete functionality. They enable fast prefix matching and word retrieval

A

Tries

39
Q

Identify the Data Structure:

these are tree-based data structures used primarily in priority queue implementations. They ensure efficient extraction of the maximum or minimum element

A

Heaps

DSA (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions