ABSTRAC DATA TYPE

Question 1

is a type (or class) for objects whose behavior is defined by a
set of values and a set of operations.

Answer 1

ABSTRACT DATA TYPE (ADT)

Question 2

Is a kind of data type whose behavior is defined with the help of some attributes and
some functions.

Answer 2

ABSTRACT DATA TYPE (ADT)

Question 3

TYPES OF ADT

Answer 3

STACK ADT
LIST ADT
QUEUE ADT

Question 4

implementation instead of data being stored in each node, the pointer to data is stored.

Answer 4

STACK ADT

Question 5

STACK ADT FUNCTIONS

Answer 5

push()
pop()
peek()
size()
isEmpty()
isFull()

Question 6

LIST ADT FUNCTIONS

Answer 6

get()
insert()
remove()
removeAt()
replace()
size()
isEmpty()
isFull()

Question 7

QUEUE ADT FUNCTIONS

Answer 7

enqueue()
dequeue()
peek()
size()
isEmpty()
isFull()

Question 8

The data us generally stored in key sequence in a list which has a head structure consisting of count, pointers and address of compare function needed to compare the data in the list.

Answer 8

LIST ADT

Question 9

Follows the basic design of the stack abstract data type

Answer 9

QUEUE ADT

Question 10

Each node contains a void pointer to the data and the link pointer to the next element in the queue. The programs responsibility is to allocate memory for storing the data.

Answer 10

QUEUE ADT

Question 11

insert an element at one end of the stack called top

Answer 11

push()

Question 12

remove and return an element at the top of the stack, if its not empty

Answer 12

pop()

Question 13

return the element (at the top of the stack/of the queue) without removing it, if the stack is not empty

Answer 13

peek()

Question 14

return the number of elements in the stack/list/queue

Answer 14

size()

Question 15

return true if the stack is empty, otherwise return false

Answer 15

isEmpty()

Question 16

return true if the stack is full, otherwise return false

Answer 16

isFull()

Question 17

return an element from the list at any given position

Answer 17

get()

Question 18

insert an element at any position of the list

Answer 18

insert()

Question 19

remove the first occurance of any element from a non-empty list

Answer 19

remove()

Question 20

remove the element at a specified location from a non empty list

Answer 20

removeAt()

Question 21

replace an element at any position by another element

Answer 21

replace()

Question 22

insert an element at the end of the queue

Answer 22

enqueue()

Question 23

remove and return the first element of the queue, if the queue is not empty

Answer 23

dequeue()