Test Assignment code

Project Assignment 2.

Here you can test the code for project assignment 2.

Go back to assignment page.

Sorting and searching

Create Array

Enter the number of students:

Create Array»

Sort Array

Choose a sorting algorithm:

Sorting Algorithms»

Search Array

Enter the student's number and the receipt number to search for:

Choose a searching algorithm.

Searching Algorithms»




Data Structures

Stacks

Use array above to create stacks of students.»

Note: Each student's receipt numbers will be stored in a seperate stack.

Push.

Enter student's number and receipt number to insert:

push» view student's receipts»

Pop.

Enter student's number whose receipt to remove:

pop» view student's receipts»

Peek.

Enter student's number to see latest receipt added:

peek» view student's receipts»

Queues

Use array above to create queues of students.»

Note: Each student's receipt numbers will be stored in a seperate queue.

Enqueue.

Enter student's number and receipt number to insert:

enqueue» view student's receipts»

Dequeue.

Enter student's number whose receipt to remove:

dequeue» view student's receipts»

Front.

Enter student's number to see first receipt added:

view front» view student's receipts»

Back.

Enter student's number to see last receipt added:

view back» view student's receipts»

Linked Lists

Use array above to create linked lists of students.»

Note: Each student's receipt numbers will be stored in a seperate linked list.

Find.

Enter student's number and receipt number to search for:

search» view student's receipts»

Insert.

Enter student's number to and receipt number to insert:

insert» view student's receipts»

Remove.

Enter student's number to and receipt number to remove:

remove» view student's receipts»