Design data structures and associated algorithms to meet specified performance requirements for given task specifications. We use the Java programming language for all assignments and exams in the course.

Assignments have a three-day built-in extension that works as follows: if you submit up to 24 hours after the deadline a 5% penalty applies. if you submit after 24 hours but before 48 hours after the deadline a 10% penalty applies.

Use at least 10 pt font and 1 inch margins. This rule is meant to prepare you for writing research publications: one often has to explain great ideas in a very limited number of pages. Submissions must be made online and consist of a compiled PDF …

Data Structures Assignments and Exercises. Solve interesting problems while understanding Algorithm Design, Pseudocode Creation etc.

DS ASSIGNMENT ASSIGNMENT-1 INTRODUCTION TO DATA STRUCTURE 1. Define data structure. List the various linear and non-linear data structures and explain them in brief. 2. What does abstract data type means? Briefly explain linear and non linear data structures. 3. Discuss the basic operations performed with linear structure. 4.

For each of the use cases below pick a data structure (from the ones you have seen in the lecture) that is best suited for that use case, and explain your choice. If you think there is more than one suitable data structure, brie y discuss the trade-o s. Example.

This document provides an assignment brief for examining and specifying abstract data types and algorithms. The assignment tasks involve: 1. Preparing a presentation on how to create a design specification for data structures like a stack and queue, explaining valid operations. 2.

This document outlines 23 algorithm and programming assignments related to data structures for a BCA semester course. The assignments cover topics like arrays, stacks, queues, linked lists, trees, graphs and various sorting and searching algorithms including linear search, binary search, bubble sort, insertion sort, selection sort, merge sort ...