Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

ECE 331 Project: Individual Programming on Data Structures & Algorithms Performance - Prof, Study Guides, Projects, Research of Electrical and Electronics Engineering

The guidelines and requirements for an individual open-ended programming project in ece 331, focusing on experimental studies of data structures and algorithms performance. Students are encouraged to choose their own project topics, which may include comparing the performance of different data structures or algorithms, analyzing the efficiency of specific algorithms, or applying dynamic programming or graph algorithms. The project should include an introduction, example runs, summary and conclusions, and bibliography sections. The programming language is c/c++ in unix or cygwin. The project report will be graded based on difficulty, thoroughness, and quality of the report, overall understanding and analysis of the problem, correctness of analysis and code, and the ability to run the program.

Typology: Study Guides, Projects, Research

Pre 2010

Uploaded on 09/17/2009

koofers-user-fqu
koofers-user-fqu 🇺🇸

10 documents

1 / 2

Toggle sidebar

Related documents


Partial preview of the text

Download ECE 331 Project: Individual Programming on Data Structures & Algorithms Performance - Prof and more Study Guides, Projects, Research Electrical and Electronics Engineering in PDF only on Docsity! ECE 331 Semester Project (Extra Credit, 10 Points) Open-ended Programming Project – Guidelines & Requirements Due date: May 07, 2009, Thursday in class This project is quite open and is individual only. The project should be a problem of your choosing. You should describe the problem or purpose of your project. The goal of the project is to learn about experimental studies of the performance of data structures and/or algorithms. The possible example topics for this project are: 1. A comparison of performance measures for two or three data structures for the same abstract data type (ADT). 2. Efficiency of quicksort under many different rules for choosing the pivot, etc. 3. A comparison of linear probing with double hashing and/or quadratic probing in terms of both running time and number of probes (different probing schemes for collision resolution in a hash table). 4. Dynamic programming application and compare the running time with recursion algorithm 5. Graph algorithm application and running time analysis 6. … Or any other topic you are interested in. You can talk to me about the any other topic you want to choose. The programming language of the project will be C/C++ in Unix or Cygwin. Format for Project Reports I. Introduction In this section you describe your purpose of this project. You describe the data structures or algorithms you used and tested and write down what you are expecting by theory.
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved