Scribd
Upload
25 views1 page

Assignment 1

This assignment for the Data Structures course requires students to write code for various data structures including linked lists, stacks, queues, binary trees, and sorting algorithms. Specifically, it asks students to implement operations like adding and removing elements, searching, reversing lists, and priority queues using arrays, linked lists, and the heap structure. The assignment is due on August 31, 2010.

Uploaded by

Zakuta123
Copyright
© © All Rights Reserved
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
25 views1 page

Assignment 1

This assignment for the Data Structures course requires students to write code for various data structures including linked lists, stacks, queues, binary trees, and sorting algorithms. Specifically, it asks students to implement operations like adding and removing elements, searching, reversing lists, and priority queues using arrays, linked lists, and the heap structure. The assignment is due on August 31, 2010.

Uploaded by

Zakuta123
Copyright
© © All Rights Reserved
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

Data Structures (IT205)

(July-November, 2011):
Assignment 1
Due:31st August, 2010

1. Write code for creating a linked list, adding elements to the linked list
at the tail, searching for an element with a particular key and also
deleting an element with a particular key if it exists.
2. Write a code for implementing a stack, a queue, and a queue simulated
by two stacks and a stack simulated by two queues, all using prespecified size arrays. You need to implement the push, pop, enqueue,
dequeue operations and error checks.
3. Implement stacks and queues using the linked list data-structure.
4. Write code to translate an arbitrary rooted tree into a binary tree,
using the left-child, right-sibling representation.
5. Write code for reversing a singly linked list.
6. Implement Binary Search.
7. Implement insertion sort, merge sort, quick sort and heap sort routines.
8. Implement the various routines of the binary heap data structure for
priority queues.

You might also like