CSE 302 HW 1

.docx

School

University of Louisville *

*We aren’t endorsed by this school

Course

302

Subject

Computer Science

Date

Apr 3, 2024

Type

docx

Pages

1

Uploaded by SargentTreeOstrich48

Report
CSE 302 Homework Assignment 1 (Due 2/3/2024) 1) (20 pts) a. Explain the principal procedural differences between the Waterfall, Spiral and AGILE models of software development. b. Explain in a few sentences why the Waterfall model (at least in its standard form) is generally unsuitable for large-scale, practical applications in the modern software engineering era. 2) (20 pts) a. Explain in 2-4 sentences the crucial differences between an abstract data type and data structure . b. Is every abstract data type limited to being implemented by a single data unique structure? Explain your answer in a few sentences. 3) (20 pts) Define at least four abstractions (from different user/observer perspectives) for the following concepts/entities: a. A Newly Opened Restaurant in Town b. A New Network in a Campus Building c. A Video Shared Via Social Media d. A College Basketball Game 4) (40 pts) The following tasks deal with the Array-based and Linked List-based implementations of the Unordered List ( AUList and LLUList ). For full credit, you must add the requisite functions to the existing classes provided with the assignment with matching function signatures . In addition, remember that we will be using a driver program to test your code for sample inputs/outputs, so you can expect a heavy penalty if the class and header files (AUList.h, AUList.cpp, LLUList.h, LLUList.cpp) you submit do not compile and function. a. (Easy) Write function “ int getMin() ” for both AUList and LLUList that computes and returns the smallest element in the list. Ex: if an AUList myAL has elements (3, 2, 1, 4, 5, 6), then myAL.getMin() should return 1 . b. (Medium) Write a function “ int getRange() ” for both AUList and LLUList that computes and returns the difference between the smallest and largest element in the list. Ex: if an LLUList myLL has elements (3, 2, 1, 4, 5, 6), then myLL.getRange() should return 5. c. (Challenging) Write a function “DuplicateSE(int first, int last)” for the AUList that duplicates only those elements of the list beginning with first and ending with last (both inclusive) The member function must have the signature AUList DuplicateSE(int first, int last). Ex: If a AUList myAL has elements (5, 1, 3, 9, 7, 11) then myAL.DuplicateSE(1,4) should return an AUList with elements (1, 3, 9, 7) -- in that order. Note that you do not need to write a version of this for the LLUList structure. Note that calling DuplicateSE should not modify the structure of the original AUList (myAL in the above example). Submissions are to use Gradescope. Be sure to refer to the Blackboard Assignments page, as well as Gradescope walk-through from the week of 1/22-1/26 for submission details and help.
Discover more documents: Sign up today!
Unlock a world of knowledge! Explore tailored content for a richer learning experience. Here's what you'll get:
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help