DSA part 2 PRELIM

Question 1

Focusing on what it does and ignoring how it does it’s job

Answer 1

(ADT) Abstract Data types

Question 2

These are high-level
data structures that are defined by their behavior and
the operations that can be performed on them, rather
than by their implementation details.

Answer 2

Abstract Data Types (ADT)

Question 3

When we consider a primitive type, we are referring to two
things: a data item with certain characteristics and the permissible
operations on that data.

Answer 3

Data Type

Question 4

The word abstract in our context stands for
“considered apart from the detailed specifications or
implementation”.

Answer 4

Abstract

Question 5

is a fundamental data structure used to store a
fixed-size, ordered collection of elements, all of which must
be of the same data type

Answer 5

Array

Question 6

Characteristics of Arrays in Java

Answer 6

1. Fixed Size
2. Initialization
3. Immutable Size

Question 7

Once an array is created, its size is
fixed and cannot be changed. You must
specify the size of the array at the time of
declaration.

Answer 7

Fixed Size

Question 8

After declaring an array, you can initialize its
elements individually. However, you must ensure that you do
not access or modify elements beyond the specified size of the
array.

Answer 8

Initialization

Question 9

Once an array is created, you
cannot change its size.

Answer 9

Immutable Size

Question 10

• A one-dimensional array is a linear collection of elements of the same
data type.
• Elements in a one-dimensional array are indexed using a single index.
• Commonly used to represent lists of data.

Answer 10

One-Dimensional Arrays

Question 11

• Multi-dimensional arrays are arrays of arrays, that allow you to
organize data in multiple dimensions or rows and columns.
• In Java, two-dimensional arrays are the most common form of multidimensional arrays.
• Elements in multi-dimensional arrays are accessed using multiple
indices.
• Used to represent grids, matrices, tables, and more complex data
structures.

Answer 11

Multi-Dimensional Arrays

Question 12

is a linear data structure in which
elements, called nodes, are connected sequentially via
references or links. Each node contains two parts: the
data and a reference (or link) to the next node in the
sequence.

Answer 12

Linked list

Question 13

can be implemented in Java using classes
and references.

Answer 13

Linked list

Question 14

Common Types of Link Lists

Answer 14

1. Singly linked list
2. Doubly linked list
3. Circular linked list

Question 15

has one pointer in each node pointing to the next
node in the list

Answer 15

Singly link list

Question 16

Has two pointers in each node pointing to the next
and previous nodes

Answer 16

Doubly linked list

Question 17

The first and last nodes of the list are linked together.

Answer 17

Circular linked list

Question 18

In the context of linked data structures, a _________ is a
reference within a node that points to the memory
location (address) of the next node in the structure. It
explicitly specifies where the next element is located
in memory

Answer 18

Pointer

Question 19

often used to implement linked
structures like singly linked lists, doubly linked lists,
and trees.

Answer 19

Pointer

Question 20

is often used to describe the connection
between nodes in a linked list

Answer 20

Link

Question 21

its
implementation may involve pointers or references to
achieve the actual linkage.

Answer 21

Link