The document provides instructions for a final assignment worth 35 marks. Students must submit the assignment by August 15th, which will be treated as a mid-term internal evaluation. The assignment consists of 7 programming problems involving arrays, stacks, queues and linked lists - including sorting array elements by ASCII value, calculating the mean of array max and min, using stacks to print a name and calculate a sum, representing a queue with a stack, swapping linked list nodes with pointers, and implementing a queue with a linked list.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
65 views1 page
Assignment Final PDF
The document provides instructions for a final assignment worth 35 marks. Students must submit the assignment by August 15th, which will be treated as a mid-term internal evaluation. The assignment consists of 7 programming problems involving arrays, stacks, queues and linked lists - including sorting array elements by ASCII value, calculating the mean of array max and min, using stacks to print a name and calculate a sum, representing a queue with a stack, swapping linked list nodes with pointers, and implementing a queue with a linked list.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
FINAL ASSIGNMENT
Marks:7*5=35 The assignment is treated as a mid-term internal evaluation. Please submit the assignment within 15th August
1. Create an array of characters (randomly chosen) and print them in
ascending order of their ASCII value. 2. Find the mean of maximum and minimum element of an array. 3. Create a stack of characters, push some characters and pop and print them so that it prints your name. 4. Create a stack of numbers, pop them and give the summation. 5. Represent a queue using stack. 6. Swap 2 nodes of a Linked List using pointers. 7. Represent Queue using Linked List.