Lesson 2 Flashcards

1
Q

Defines a particular data with the following characteristics: atomic, traceable, accurate, clear and concise.

A

Data Definition

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

Definition should define a single concept.

A

Atomic

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

Definition should be able to be mapped to some data element.

A

Traceable

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

Definition should be unambiguous.

A

Accurate

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

Definition should be understandable.

A

Clear and Concise

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

Represents an object having a data.

A

Data Object

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

Those data types for which a language has built-in support are known as _____. For example, most of the languages provide the following built-in data types.

Integers
Boolean (true, false)
Floating (Decimal numbers)
Character and Strings

A

Built-in Data Type

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

Those data types which are implementation independent as they can be implemented in one or the other way are known as ________. These data types are normally built by the combination of primary or built-in data types and associated operations on them. For example-
List
Array
Stack
Queue

A

Derived Data Type

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

The data in the data structures are processed by certain operations. The particular data structure chosen largely depends on the frequency of the operation that needs to be performed on the data structure.

Traversing
Searching
Insertion
Deletion
Sorting
Merging

A

Basic Operations

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

_______ is a container which can hold a fix number of items and these items should be of the same type. Most of the data structures make use of this to implement their algorithms.

A

Array

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

Each item stored in an array is called an _____.

A

Element

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

Each location of an element in an array has a numerical index, which is used to identify the element.

A

Index

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

Basic Operations:
Print all the array elements one by one.

A

Traverse

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

Basic Operations:
Adds an element at the given index.

A

Insertion

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

Basic Operations:
Deletes an element at the given index.

A

Deletion

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

Basic Operations:
Searches an element using the given index or by the value.

A

Search

17
Q

Basic Operations:
Updates an element at the given index.

A

Update

18
Q

True or False:
In insertion, a new element can be added at the beginning, end, or any given index of array.

A

True

19
Q

_______ refers to removing an existing element from the array and re-organizing all elements of an array.

A

Deletion