Pseudocode for algorithms

Question 1

What is the pseudocode for finding the size of a stack?

Answer 1

size()
return top + 1

Question 2

what is the pseudocode for checking if the stack is empty?

Answer 2

isEmpty()
if top < 0:
return True
else:
return False
endif

Question 3

What is the pseudocode for checking the top item in a stack without removing it?

Answer 3

peek()
if isEmpty():
return error
else:
return stackname[top]
endif

Question 4

What is the psuedocode for adding an item to a stack?

Answer 4

push(element)
top = top +1
stackname[top] = element

Question 5

what is the pseudocode for removing an item off the stack?

Answer 5

pop()
if isEmpty():
return error
else:
toRemove = stackname[top]
stackname[top] = “ “
top = top - 1
return toRemove
endif

Question 6

what is the pseudocode for checking the size of a queue?

Answer 6

size()
return back - front

Question 7

what is the pseudocode for checking if a queue is empty?

Answer 7

isEmpty()
if front == back:
return True
else:
return False
endif

Question 8

what is the pseudocode for returning the first item to enter a queue without removing it?

Answer 8

peek()
return queuename[front]

Question 9

what is the pseudocode for adding an item into a queue?

Answer 9

enqueue(element)
queuename[back] = element
back = back + 1

Question 10

what is the pseudocode for removing items from a queue?

Answer 10

dequeue()
if isEmpty():
return error
else:
toDequeue = queuename[front]
endif