Lesson 1

Question 1

are the programmatic way of storing data so that data can be used efficiently.

Answer 1

Data Structure

Question 2

It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

Answer 2

Data Structure

Question 3

defined as process or set well-defined instructions that are typically used to solve a particular group of problems or perform a specific type of calculation.

Answer 3

Algorithm

Question 4

set of operations performed in a step-by-step manner to execute a task.

Answer 4

Algorithm

Question 5

Three common problems that applications face now-a-days

Answer 5

Data Search
Processor Speed
Multiple Request

Question 6

What are the characteristics of a data structure

Answer 6

Correctness
Time Complexity
Space Complexity

Question 7

Data structure implementation should implement its interface correctly.

Answer 7

Correctness

Question 8

Running time or the execution time of operations of data structure must be as small as possible.

Answer 8

Time Complexity

Question 9

Memory usage of data structure operation should be as little as possible.

Answer 9

Space Complexity

Question 10

What are the classification of Data Structure

Answer 10

Linear Data Structure
- Static
- - Array
- Dynamic
- - List
- - Stack
- - Queue
Non- Linear Data Structure
- Graph
- Tree

Question 11

Data structure in which data elements are arranged sequentially or linearly. Examples of linear data structures are array, stack, queue, linked list, etc.

Answer 11

Linear Data Structure

Question 12

has a fixed memory size. An example of this data structure is an array.

Answer 12

Static Data Structure

Question 13

the size is not fixed. Examples of this data structure are queue, stack, etc.

Answer 13

Dynamic Data Structure

Question 14

Data structures where data elements are not placed sequentially or linearly are called ________

Answer 14

Non-Linear Data Structure

Question 15

Examples of this data structure are trees and graphs.

Answer 15

Non-Linear Data Structure

Question 16

refers to the kind of data that variables can assume, hold or take on in a programming language and for which operations are automatically provided.

Answer 16

Data Types

Question 17

Stores whole numbers from -2,147,483,648 to 2,147,483,647

Answer 17

int

Question 18

Stores fractional numbers. Sufficient for storing 15 decimal digits

Answer 18

double

Question 19

Stores fractional numbers. Sufficient for storing 6 to 7 decimal digits

Answer 19

float

Question 20

Stores a single character/letter

Answer 20

char

Question 21

is used to store a sequence of characters (text)

Answer 21

String

Question 22

Stores true or false values

Answer 22

bool

Question 23

Stores whole numbers from -128 to 127

Answer 23

byte

Question 24

Stores whole numbers from -32,768 to 32,767

Answer 24

short

Question 25

Stores whole numbers from -9,223,372,036,854,775,808 to 9,223,372,036,854,775,807

Answer 25

long

Question 26

is a special kind of datatype, whose behavior is defined by a set of values and set of operations.

Answer 26

Abstract Data Type (ADT)

Question 27

The keyword “_________” is used as we can use these datatypes, we can perform different operations.

Answer 27

Abstract

Question 28

This is used to check whether the stack is full or not.

Answer 28

isFul()

Question 29

This is used to check whether the stack is empty or not.

Answer 29

isEmpty()

Question 30

This is used to push x into the stack.

Answer 30

push(x)

Question 31

This is used to delete one element from the top of the stack.

Answer 31

pop()

Question 32

This is used to get the topmost element of the stack.

Answer 32

peek()

Question 33

This function is used to get the number of elements present in the stack.

Answer 33

size()

Question 34

This is used to check whether the queue is full or not.

Answer 34

isFull()

Question 35

This is used to check whether the queue is empty or not.

Answer 35

isEmpty()

Question 36

This is used to add x into the queue at the rear end.

Answer 36

insert(x)

Question 37

This is used to delete one element from the front end of the queue.

Answer 37

delete()

Question 38

This function is used to get the number of elements present in the queue.

Answer 38

size()

Question 39

are useful in the creation and analysis of algorithms.

Answer 39

Mathematical Functions

Question 40

What are under Mathematical Functions

Answer 40

Floor of x Ceiling of x Modulo

Question 41

What are the kind of variable

Answer 41

Local Variable Instance Variable Static Variable

Question 42

A variable declared inside the body of the method is called __________.

Answer 42

Local Variable

Question 43

A variable declared inside the class but outside the body of the method

Answer 43

Instance Variable

Question 44

A variable that is declared as static

Answer 44

Static Variable

Question 45

It cannot be local

Answer 45

Static Variable

Question 46

You can create a single copy of the ___________ and share it among all the instances of the class.

Answer 46

Static Variable

Question 47

What are the other terminologies of programming terminilogies

Answer 47

Instantiation Overloading Constructor Void

Question 48

this means that you are creating an instance of an object.

Answer 48

Instantiation

Question 49

same method names, that have different parameters.

Answer 49

Overloading Constructor

Question 50

a type of method that should not return a value.

Answer 50

Void