2013

Acropolis Technical Campus, Indore

Submitted To: Prof. Ankit Upadhyay
(Asst. Prof.,CSE)

Department of Computer Science

Prof. Sumit Jain

(Asst. Prof.,CSE)

Analysis & Design of Algorithms

Submitted By:
(Name of Student) (Roll No.) (Class/Year)

[LAB ASSIGNMENT DS(CS-404)]

To understand the Data Structures as a practical approach. The purpose of this assignment is to cover the underlying concepts and techniques used in Data Storage & management.

Index
S. No Title of Programming Assignment From This Exercise students will be able to: Page No. Remark

Lab Assignment-1

A software firm named TCS receives new project request from ISRO. In this project ISRO wants an application program for which it is highly desirable that the corresponding computer program terminate after a finite number of steps. Design an efficient algorithm and also implement it. An E-Movie shop is a movie shop which is on web and sale movies in DVD/CD or video files online. This online shop stored movies by name in alphabetical order that is of A, BZ. Any user can search any movie by only name. If a user search for a movie with starting letter M, then this web site must display the movie names starts with letter M. Design an efficient algorithm and also implement it. In a bike racing match happened between countries, bikers finished race in the given time and scored points are given in this fashion: 45,40,35,30,25,20,15,10,5. Biker who finished the race in minimum time than all other bikers, awarded point 5 and so on. You have to sort this result in ascending fashion with the major concentration on time complexity that must be n logn. In a bike racing match happened between countries, bikers finished race in the given time and scored points are given in this fashion: 45,40,35,30,25,20,15,10,5. Biker who finished the race in minimum time than all other bikers, awarded point 5 and so on. You have to sort this result in ascending fashion with the major concentration on time complexity that must be n2.

Lab Assignment-2

Lab Assignment-3

Lab Assignment-4

Lab Assignment-5

In a bike racing match happened between countries, bikers finished race in the given time and scored points are given in this fashion: 5,10,15,20,25,30,35,40,45. Biker who finished the race in minimum time than all other bikers, awarded point 5 and so on. You have to sort this result in ascending fashion with the major concentration on time complexity that must be n logn. In a problem, given a set of items with values and weights and a limited capacity weight bag. We have to find the optimum solution so that, in minimum cost (value) fill the bag with the maximum weight. Design and implement this problem. Suppose there are two company of a group Microsoft: Microsoft and Nokia. Company Microsoft contains the product lists from A1 to M1, and company Nokia contains the product lists from N1 to Z1. Group Microsoft wants to display all the products as a single company product in the sequence of ascending arrangements. A water supply board of a city designed a graph for supplying water to different colonies. There are five colonies in the city named A, B, C, D, and E which has finite distances. When water supply board will supply water to all these colonies from a single node point and after supplied water then reached to each of these colonies of the city. Board wants a minimum path of a planned graph which must contain each of the colonies. Design an efficient solution for above problem and implement it. In an electric circuit current flows from node to node. Suppose there are five nodes A, B, C, D, and E which has finite distances. When switch on of power supply then current will reach to each of the node of the circuit and it usually starts only from single source node. A user wants a minimum path of the designed circuit which must contain each of the nodes. Design and implement this problem.

Lab Assignment-6

Lab Assignment-7

Lab Assignment-8

Lab Assignment-9

Lab Assignment-10

Google made an application program that is Google map to search the location or place from the map of a country or world. Suppose in this application program there are five countries on the map of Asian regions. This application program wants to display these countries in possible colors with condition no two neighbors can have same color and available colors are only three. Design and implement this problem. There are five hills in the New York city USA and names of these hills are NY0, NY1, NY2, NY3, and NY4 respectively. These hills are separated by finite distances. We have to find shortest distance of the hill (NY1, NY2, and NY3) only from single source hill (in this case consider NY0 as the single source point). Design and implement this problem. Algorithm Queens can be made more efficient by redefining the function Place(k,i) so that it either returns the next legitimate column on which to place the kth queen or an illegal value. Rewrite both functions so they implement this alternate strategy.

Lab Assignment-11

Lab Assignment-12

Total No Pages: