DATA STRUCTURE PRELIMS Flashcards

1
Q

building blocks of any program or the software

A

DATA STRUCTURE

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

an elementary value or collection of values

A

DATA

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

data items which have subordinate data items

A

GROUP ITEMS

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

the collection of various data items

A

RECORD

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

collection of various records

A

FILE

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

represents the class of certain objects

A

ENTITY

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

represents the particular property of an entity.

A

ATTRIBUTE

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

The primary goal of data structure

A

CORRECTNESS

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

It should process the data at high speed without utilizing much of the computer resources such as memory space

A

EFFICIENCY

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

3 FEATURES OF DATA STRUCTURE

A
  1. ROBUSTNESS
  2. ADAPTABILITY
  3. REUSABILITY
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

consist of the numbers and the characters which are built in programs.

A

PRIMITIVE DATA STRUCTURES

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

These can be manipulated or operated directly by the machine level instructions

A

PRIMITIVE DATA STRUCTURES

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

Basic data types such as integer, real, character, and Boolean come under __________

A

PRIMITIVE DATA STRUCTURES

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

Primitive data structures is also known as ___________

A

simple data types

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

Derived from primitive data structures

A

NON-PRIMITIVE DATA STRUCTURES

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

Cannot be manipulated directly by machine level instructions

A

NON-PRIMITIVE DATA STRUCTURES

17
Q

A data structure that maintains a linear relationship among its elements

A

Linear data structure

18
Q

Hierarchical relationship between individual data items

A

Non linear data structures

19
Q

collection of items stored in contiguous memory locations

20
Q

can be seen as a table with ‘x’ rows and ‘y’ columns

A

Two dimensional arrays

21
Q

provides a dynamic way of manipulating data

22
Q

This constructor is used to build an empty array list

A

ArrayList()

23
Q

This constructor is used to build an array list initialized with the elements from collection c

A

ArrayList(Collection c)

24
Q

This constructor is used to build an array list with initial capacity being specified

A

ArrayList(int capacity)

25
Q

a linear data structure that follows a particular order in which the operations are performed

26
Q

what operation adds to the top of the list, hiding any items already on the stack, or initializing the stack if it is empty

27
Q

what operation removes an item from the top of the list and returns this value to the caller

28
Q

responsible for inserting (copying) the value into the array and for incrementing the element counter (size).

29
Q

operation used to delete or remove a data item or element at the top of the stack

30
Q

operation to determine the size (number of items) of the Stack

31
Q

method that looks at the item at the top of a stack

32
Q

a method that returns the position (in number) of an item from the top of a stack

33
Q

a method that tests if a stack object is empty or not.