Column_Major_Display: For I in For J in Location_In_Array := I + (J-1)*3 Display Element in Array(Location_In_Array) New_Line
|
|
|
- Philippa Thomas
- 5 years ago
- Views:
Transcription
1 C-14 Solutions 1. Package Design Data Structures An array of nine integers Subprograms Function to accept 9 integers Procedure to display the array in row major order Procedure to display the array in column major order Procedure to sort the array using the bubble sort algorithm Algorithms Accept_Numbers: For I in Accept an integer Store it in an array Row_Major_Display: For I in Display Element in Array(I); If I mod 3 = 0 then New_Line Given the elements are in row-major order, the position locations are sequential. Column_Major_Display: For I in For J in Location_In_Array := I + (J-1)*3 Display Element in Array(Location_In_Array) New_Line If the elements are in column-major order, the locations in the one-dimensional array have to be computed. Bubble_Sort: For I in 1.. Array Value(1)-1 For J in I+1.. Array Value(1) If Array(I) > Array(J) Swap the values Note that the algorithm will sort the array in ascending order.
2 2. Code Listing Package Listing Package Specification GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Checking: c:/docume~2/joeb/desktop/16070/codeso~1/my_array_package.ads (source file time stamp: :48:58) Package specification of a package to Create an array of 9 integers Display the array as a 3x3 matrix i. assuming row-major order ii. assuming column-major order Bubble Sort the 1-D array Specifier : Joe B Date Last Modified : 10/07/ package My_Array_Package is type My_Array is array (1.. 9) of Integer; function Create_Array return My_Array; procedure Display_Row_Major(Input_Array : in My_Array); procedure Display_Column_Major(Input_Array : in My_Array); procedure Bubble_Sort (Input_Array : in out My_Array); 27. end My_Array_Package; lines: No errors Package Body GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Compiling: c:/docume~2/joeb/desktop/16070/codeso~1/my_array_package.adb (source file time stamp: :54:40) Package implementation of My_Array_Package Programmer : Joe B
3 4. -- Date Last Modified : 10/07/ with Ada.Text_Io; 8. with Ada.Integer_Text_Io; package body My_Array_Package is function Create_Array return My_Array is 14. Output_Array : My_Array; 15. begin 16. for I in loop 17. Ada.Text_Io.Put("Please Enter a number : "); 18. Ada.Integer_Text_Io.Get(Output_Array(I)); 19. Ada.Text_Io.New_Line; 20. end loop; 21. return Output_Array; 22. end Create_Array; procedure Display_Row_Major ( 26. Input_Array : in My_Array ) is 27. begin 28. for I in loop 29. Ada.Text_Io.Put(Integer'Image(Input_Array(I))); 30. Ada.Text_Io.Put(" "); 31. if I mod 3 = 0 then 32. Ada.Text_Io.New_Line; 33. end if; 34. end loop; 35. end Display_Row_Major; procedure Display_Column_Major ( 40. Input_Array : in My_Array ) is 41. Index : Integer; 42. begin 43. for I in loop 44. for J in loop 45. Index := I + (J-1)*3; 46. Ada.Text_Io.Put(Integer'Image(Input_Array(Index))); 47. Ada.Text_Io.Put(" "); 48. end loop; 49. Ada.Text_Io.New_Line; 50. end loop; 51. end Display_Column_Major; procedure Bubble_Sort ( 56. Input_Array : in out My_Array ) is 57. Temp : Integer; 58. begin 59. for I in loop 60. for J in I loop 61. if Input_Array(I) > Input_Array(J) then
4 62. Temp := Input_Array(I); 63. Input_Array(I) := Input_Array(J); 64. Input_Array(J) := Temp; 65. end if; 66. end loop; 67. end loop; 68. end Bubble_Sort; end My_Array_Package; lines: No errors Test Program Listing GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Compiling: c:/docume~2/joeb/desktop/16070/codeso~1/test_my_array.adb (source file time stamp: :03:20) Program to test My_Array_Package Programmer : Joe B Date Last Modified : 10/07/ with My_Array_Package; 8. use My_Array_Package; 9. with Ada.Text_Io; procedure Test_My_Array is 12. New_Array : My_Array_Package.My_Array; 13. begin 14. New_Array := Create_Array; Ada.Text_Io.Put_Line("Displaying unsorted array in Row-Major order"); 17. Display_Row_Major(New_Array); Ada.Text_Io.Put_Line("Displaying unsorted array in Column-Major order"); 20. Display_Column_Major(New_Array); Bubble_Sort(New_Array); Ada.Text_Io.Put_Line("Displaying sorted array in Row-Major order"); 25. Display_Row_Major(New_Array); Ada.Text_Io.Put_Line("Displaying sorted array in Column-Major order"); 28. Display_Column_Major(New_Array); 29. end Test_My_Array; 29 lines: No errors
5 C 15 Solutions 1. Invert a 3x3 Matrix Data Structure A new type my_3x3_matrix as a real array (1..3, 1..3) Subprograms 1. Function to create the matrix 2. Procedure to display the matrix 3. Function to compute the determinant 4. Function to compute the inverse 5. Main program to invert the matrix Algorithm Create_Matrix: For I in For J in Accept Matrix(I,J) Return Matrix to the user Display_Matrix: For I in For J in Display Matrix (I,J); New_Line Compute_Determinant: 1. Convert the matrix into a real_matrix (as defined in Generic_Real_arrays) 2. Compute the determinant using the det function defined in Generic_Real_Arrays.Operations. 3. Return the computed Value Compute_Inverse: 1. Convert the matrix into a real_matrix (as defined in Generic_Real_arrays) 2. Compute the inverse using the Inverse function defined in Generic_Real_Arrays.Operations.
6 3. Convert the real_matrix back into the user defined type 4. Return the inverted matrix Main Program: 1. Prompt the user to enter a matrix 2. Display accepted matrix to the user 3. Check if matrix is singular by computing the determinant. 4. If matrix is not singular (determinant /= 0) a. Compute the inverse b. Display inverse to the user 5. Else, Display Cannot Invert 2. Code Listing GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Compiling: c:/docume~2/joeb/desktop/16070c~1/matrix/pset_4_inversion.adb (source file time stamp: :37:14) Program to invert a 3x3 matrix Programmer : Joe B Date Last Modified : 10/07/ with Ada.Text_Io; 8. with Ada.Float_Text_Io; 9. with Generic_Real_Arrays; 10. with Generic_Real_Arrays.Operations; 11. with Generic_Real_Arrays.Array_Io; procedure Pset_4_Inversion is create instances of the generic matrix packages. 15. package My_Real_Array is new Generic_Real_Arrays(Float); 16. package My_Real_Array_Operations is new My_Real_Array.Operations; create a user defined 3x3 matrix 19. type My_3x3_Matrix is new My_Real_Array.Real_Matrix 20. (1.. 3, 1.. 3); declare local variables for matrices and determinant 23. A, 24. B : My_3x3_Matrix; 25. Det : Float; user function to create the matrix 28. function Create_My_Matrix return My_3x3_Matrix is 29. Input_Matrix : My_3x3_Matrix; begin 32. for I in loop
7 33. for J in loop 34. Ada.Text_Io.Put("Please Enter Number in ("); 35. Ada.Text_Io.Put(Integer'Image(I)); 36. Ada.Text_Io.Put(","); 37. Ada.Text_Io.Put(Integer'Image(J)); 38. Ada.Text_Io.Put(") : "); Ada.Float_Text_Io.Get(Input_Matrix(I,J)); 41. Ada.Text_Io.Skip_Line; 42. end loop; 43. end loop; 44. return Input_Matrix; 45. end Create_My_Matrix; user procedure to display the matrix 48. procedure Display_My_Matrix ( 49. Input_Matrix : in My_3x3_Matrix ) is begin 52. for I in loop 53. for J in loop 54. Ada.Float_Text_Io.Put(Input_Matrix(I,J)); 55. end loop; 56. Ada.Text_Io.New_Line; 57. end loop; 58. end Display_My_Matrix; function to compute the inverse 61. function My_Inverse ( 62. Input_Matrix : My_3x3_Matrix ) 63. return My_3x3_Matrix is local variable to convert the user defined matrix to the package defined matrix 66. My_Real_Matrix : My_Real_Array.Real_Matrix (1.. 3, 1.. 3); 67. Output_Matrix : My_3x3_Matrix; begin do type conversion from user defined type to package defined type 71. for I in loop 72. for J in loop 73. My_Real_Matrix(I,J) := Input_Matrix(I,J); 74. end loop; 75. end loop; compute inverse using the generic package function 77. My_Real_Matrix := My_Real_Array_Operations.Inverse(My_Real_Matrix); reconvert back to user defined type 79. for I in loop 80. for J in loop 81. Output_Matrix(I,J) := My_Real_Matrix(I,J); 82. end loop; 83. end loop; return computed inverse 85. return Output_Matrix; end My_Inverse; function My_Determinant (
8 91. Input_Matrix : My_3x3_Matrix ) 92. return Float is 93. My_Real_Matrix : My_Real_Array.Real_Matrix (1.. 3, 1.. 3); 94. begin do type conversion from user defined type to package type 96. for I in loop 97. for J in loop 98. My_Real_Matrix(I,J) := Input_Matrix(I,J); 99. end loop; 100. end loop; compute the determinant and return to user 102. return (My_Real_Array_Operations.Det(My_Real_Matrix)); 103. end My_Determinant; begin create and display the matrix 108. Ada.Text_Io.Put_Line("Please Enter the Matrix : "); 109. A := Create_My_Matrix; Ada.Text_Io.Put_Line("Created Matrix : "); 112. Display_My_Matrix(A); Ada.Text_Io.New_Line; compute determinant 117. Det := My_Determinant(A); check for singularity 120. if Det = 0.0 then 121. Ada.Text_Io.Put_Line("Cannot invert the matrix"); 122. else compute inverse and display 124. B := My_Inverse(A); Ada.Text_Io.New_Line; 127. Ada.Text_Io.Put_Line("Inverted Matrix : "); 128. Display_My_Matrix(B); 129. end if; end Pset_4_Inversion; 131 lines: No errors
9 C-16 Solutions 1. Record Declaration type Aircraft_Information is record Aircraft_Number : Integer; Latitude : Float; Longitude : Float; Heading : Float; Velocity : Float; end record; Note there are multiple ways to do this record declaration. You may for instance choose to use a hierachical record wherein the position information (Latitude, Longitude, Heading, Velocity) is a record within Aircraft_Information as shown below: type Position_Information is record Latitude : Float; Longitude : Float; Heading : Float; Velocity : Float; end record; type Aircraft_Information is record Aircraft_Number : Integer; Aircraft_Position : Position_Information; end record; 2. Ada Program Data Structures Array of 10 elements of Type Aircraft_Information Subprograms o Function to create the array of aircraft o Procedure to sort the contents of the array based on latitude o Procedure to compute and display the distances between the first aircraft and all other aircraft.
10 Algorithms Create_Aircraft: For I in Prompt the user to input relevant information Store the information in Array(I) Return Array to the main program Sort_Aircraft: For I in 1.. Num_of_Aircraft -1 For J in I+1.. Num_Of_Aircraft If Array(I).Latitude > Array(J).Latitude Swap the records in Array(I) and Array(J) Return sorted array to the user Compute_Distances: For I in 2.. Num_Of_Aircraft Compute difference in latitudes (dlat) Compute the differences in longitude (dlon) Covert the differences into distances using the WGS-84 approximations in the handout (dlat_dist, dlon_dist) Distance between the aircraft = sqrt(dlat_dist^2 + dlon_dist^2) Display computed distance to the user. Main Program: Create aircraft using the Create_Aircraft function Sort the aircraft Compute the distances and display it to the user Code Listing My_Aircraft Package Specification GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Checking: c:/docume~2/joeb/desktop/16070/codeso~1/my_aircraft.ads (source file time stamp: :10:40) Package to specify aircraft parameters and the related subprograms Specifier : Joe B Date Last Modified : 10/07/ package My_Aircraft is 9. Num_of_Aircraft : constant Integer := 10; type Aircraft_Information is
11 12. record 13. Aircraft_Number : Integer; 14. Latitude : Float; 15. Longitude : Float; 16. Heading : Float; 17. Velocity : Float; 18. end record; type Aircraft_Array is array (1.. Num_Of_Aircraft) of Aircraft_Information; Latitude_Conversion : constant Float := ; 23. Longitude_Conversion : constant Float := ; function Get_Aircraft_Info return Aircraft_Array; procedure Sort_Aircraft ( 28. Input_Array : in out Aircraft_Array ); procedure Compute_Distances ( 31. Input_Array : in Aircraft_Array ); 32. end My_Aircraft; 32 lines: No errors My_Aircraft Package Body GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Compiling: c:/docume~2/joeb/desktop/16070/codeso~1/my_aircraft.adb (source file time stamp: :26:26) Package body for My_Aircraft Programmer: Joe B Date Last Modified : 10/07/ with Ada.Text_Io; 8. with Ada.Integer_Text_Io; 9. with Ada.Float_Text_Io; 10. with Ada.Numerics.Elementary_Functions; package body my_aircraft is function Get_Aircraft_Info return Aircraft_Array is 16. Output_Array : Aircraft_Array; 17. begin 18. for I in 1.. Num_of_Aircraft loop 19. Ada.Text_Io.Put("Please Enter Information of Aircraft"); 20. Ada.Text_Io.Put(Integer'Image(I)); 21. Ada.Text_Io.New_Line; Ada.Text_Io.Put("Aircraft Id : "); 24. Ada.Integer_Text_IO.Get(Output_Array(I).Aircraft_Number); 25. Ada.Text_Io.Skip_Line; 26.
12 27. Ada.Text_Io.Put("Latitude : "); 28. Ada.Float_Text_Io.Get(Output_Array(I).Latitude); 29. Ada.Text_Io.Skip_Line; Ada.Text_Io.Put("Longitude: "); 32. Ada.Float_Text_Io.Get(Output_Array(I).Longitude); 33. Ada.Text_Io.Skip_Line; Ada.Text_Io.Put("Heading : "); 37. Ada.Float_Text_Io.Get(Output_Array(I).Heading); 38. Ada.Text_Io.Skip_Line; Ada.Text_Io.Put("Velocity: "); 41. Ada.Float_Text_Io.Get(Output_Array(I).Velocity); 42. Ada.Text_Io.Skip_Line; 43. end loop; 44. return Output_Array; 45. end Get_Aircraft_Info; procedure Sort_Aircraft ( Input_Array : in out Aircraft_Array) is 48. Temp : Aircraft_Information; 49. begin 50. for I in 1.. Num_of_Aircraft-1 loop 51. for J in I+1.. Num_Of_Aircraft loop 52. if Input_Array(I).Latitude > Input_Array(J).Latitude then 53. Temp := Input_Array(I); 54. Input_Array(I) := Input_Array(J); 55. Input_Array(J) := Temp; 56. end if; 57. end loop; 58. end loop; 59. end Sort_Aircraft; procedure Compute_Distances (Input_Array : in Aircraft_Array) is 63. Distance, dlat, dlat_dist, dlon, dlon_dist : Float; 64. begin 65. for I in 2.. Num_Of_Aircraft loop 66. Dlat := Input_Array(1).Latitude - Input_Array(I).Latitude; dlat_dist := dlat * 60.0 * latitude_conversion; 69. dlat_dist := dlat_dist * dlat_dist; Dlon := Input_Array(1).Longitude - Input_Array(I).Longitude; 72. Dlon_Dist := Dlon * 60.0 * Longitude_Conversion; 73. Dlon_Dist := Dlon_Dist * Dlon_Dist; Distance := Ada.Numerics.Elementary_Functions.Sqrt(Dlat_Dist+Dlon_Dist); Ada.Text_Io.Put("The distance between Aircraft with id "); 78. Ada.Text_IO.Put(Integer'Image(Input_Array(1).Aircraft_Number)); 79. Ada.Text_Io.Put(" Aircraft with id "); 80. Ada.Text_Io.Put(Integer'Image(Input_Array(I).Aircraft_Number)); 81. Ada.Text_Io.Put(" is "); 82. Ada.Text_Io.Put(Float'Image(Distance)); 83. Ada.Text_Io.New_Line; 84. end loop;
13 85. end Compute_Distances; 86. end My_Aircraft; lines: No errors Main Program GNAT 3.13p ( ) Copyright Free Software Foundation, Inc. Compiling: c:/docume~2/joeb/desktop/16070/codeso~1/test_my_aircraft.adb (source file time stamp: :12:00) Program to test My_Aircraft Programmer : Joe B Date Last Modified : 10/07/ with My_Aircraft; procedure Test_My_Aircraft is 10. Test_Aircraft : My_Aircraft.Aircraft_Array; begin Test_Aircraft := My_Aircraft.Get_Aircraft_Info; 15. My_Aircraft.Sort_Aircraft (Test_Aircraft); 16. My_Aircraft.Compute_Distances(Test_Aircraft); end Test_My_Aircraft; lines: No errors
14
15
16
In the case above, only the x:= x+1 statement is executed and the result is 4;
C-10 1. For X = 3 Case 1. IF x >= 0 THEN x:= x+1; ELSIF x >=1 THEN x := x + 2; END IF; In the case above, only the x:= x+1 statement is executed and the result is 4; Case 2. IF x >= 0 THEN x := x + 1;
After those declarations we assigned 2 records and give them their values:
Lecture C16: Records Response to 'Muddiest Part of the Lecture Cards' (38 respondents) 1) In defining record 'My_First_Record' you just said ("Name", "Age", "Location") Is that acceptable? Shoouldn't you
Count increments by 20 when I is even and decrements by 5 when I is odd.
C11 Solutions 1. Count := 1; FOR I in 1.. 10 LOOP If I MOD 2 = 0 THEN FOR J in 1.. 10 LOOP Count:= Count + 2; END LOOP; ELSE FOR J in 1.. 5 LOOP Count := Count 1; END LOOP; END IF; END LOOP; Count = 76.
Note: The enumerations range from 0 to (number_of_elements_in_enumeration 1).
C8-1 Algorithm 1. Use a subtype to represent the numbers for months 2. Use an enumeration to represent the named months 3. Use an enumeration to represent the roman months 4. Get the inputs from the user
Problem Set 5 Solutions
Problem Set 5 Solutions Problem 1 Part 1: Merge Sort is a sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence.
MST. Parent. Fringe Set. Home Work 9. The problems in this problem set cover lectures C7, C8, C9 and C10
5 Home Work 9 The problems in this problem set cover lectures C7, C8, C9 and C0. What is the Minimum Spanning Tree of the graph shown below using both Prim s and Kruskal s algorithm. Show all the steps
SYNOPSIS This case study explores building an Ada program to estimate ice thickness.
pracnique Estimating Ice Thickness SYNOPSIS This case study explores building an Ada program to estimate ice thickness. Type: Language: Compiler: Skills: Experience Level: programming Ada gnatmake basic
Aerospace Software Engineering
16.35 Aerospace Software Engineering Ada 95: subtypes, enumeration types, functions, packages, exception handling September 30/2002 Prof. I. K. Lundqvist kristina@mit.edu 16.35 September 30/2002 Prof.
Unified Engineering Spring 2005
Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 Unified Engineering Spring 2005 Problem Set #7 Solutions Problem C1. Understanding.ali files With the
Different kinds of resources provided by a package
Collection of resources Resources could include types, functions, procedures, object (data) declarations, even other packages Encapsulated in one unit Compiled on its own Compilation order: Library unit
SYNOPSIS This pracnique explores an Ada program to apply Luhn s algorithm to verify credit card information.
pracnique Luhn s Algorithm SYNOPSIS This pracnique explores an Ada program to apply Luhn s algorithm to verify credit card information. Type: Language: Compiler: Skills: Experience Level: programming Ada
A collision is said to occur when two or more keys hash to the same index location.
Problem Set #8 Solutions Problem 1-9 points Given the tree below, traverse the tree a. Inorder : a/b c * d*e / f + g b. Preorder: * - / a b c / * d e + f g c. Postorder a b / c d e * f g + / * * - / /
C++ PROGRAMMING SKILLS Part 4: Arrays
C++ PROGRAMMING SKILLS Part 4: Arrays Outline Introduction to Arrays Declaring and Initializing Arrays Examples Using Arrays Sorting Arrays: Bubble Sort Passing Arrays to Functions Computing Mean, Median
Computer Programming: C++
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2003 Muath i.alnabris Computer Programming: C++ Experiment #7 Arrays Part II Passing Array to a Function
Principles of Programming. Chapter 6: Arrays
Chapter 6: Arrays In this chapter, you will learn about Introduction to Array Array declaration Array initialization Assigning values to array elements Reading values from array elements Simple Searching
CSCE 110 PROGRAMMING FUNDAMENTALS. Prof. Amr Goneid AUC Part 7. 1-D & 2-D Arrays
CSCE 110 PROGRAMMING FUNDAMENTALS WITH C++ Prof. Amr Goneid AUC Part 7. 1-D & 2-D Arrays Prof. Amr Goneid, AUC 1 Arrays Prof. Amr Goneid, AUC 2 1-D Arrays Data Structures The Array Data Type How to Declare
with Ada.Numerics.Float_Random; with Ada.Containers.Vectors; procedure CalculDeMatrices is
Page 1 of 8 NOM DU CSU (principal) : calculdematrices.adb AUTEUR DU CSU : Pascal Pignard VERSION DU CSU : 1.1c DATE DE LA DERNIERE MISE A JOUR : 25 avril 2013 ROLE DU CSU : Opérations sur les matrices.
CS 12 Fall 2003 Solutions for mid-term exam #2
CS 12 Fall 2003 Solutions for mid-term exam #2 1. (10 points) Compilers and interpreters Provide short answers (a few sentences at most) to the following questions. (a) What is the difference between a
CP5_6 The problems in this problem set cover lectures C5 and C6. 1. a. What are doubly linked lists? What is the record declaration for a node in a doubly linked list? head 10 11 13 Figure 1. Sample Doubly
Computer Science & Engineering 150A Problem Solving Using Computers
Computer Science & Engineering 150A Problem Solving Using Computers Lecture 06 - Stephen Scott Adapted from Christopher M. Bourke 1 / 30 Fall 2009 Chapter 8 8.1 Declaring and 8.2 Array Subscripts 8.3 Using
x = 12 x = 12 1x = 16
2.2 - The Inverse of a Matrix We've seen how to add matrices, multiply them by scalars, subtract them, and multiply one matrix by another. The question naturally arises: Can we divide one matrix by another?
Unified Engineering Fall 2004
Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 Unified Engineering Fall 2004 Problem Set #3 Solutions C&P PSET 3 Solutions 1. 12
Outline. Computer Memory Structure Addressing Concept Introduction to Pointer Pointer Manipulation Summary
Pointers 1 2 Outline Computer Memory Structure Addressing Concept Introduction to Pointer Pointer Manipulation Summary 3 Computer Memory Revisited Computers store data in memory slots Each slot has an
Exam 2. CSC 121 MW Class. Lecturer: Howard Rosenthal. April 26, 2017
Your Name: Exam 2. CSC 121 MW Class Lecturer: Howard Rosenthal April 26, 2017 The following questions (or parts of questions) in numbers 1-7 are all worth 3 points each. 1. Answer the following as true
Chapter 6 - Pointers
Chapter 6 - Pointers Outline 1 Introduction 2 Pointer Variable Declarations and Initialization 3 Pointer Operators 4 Calling Functions by Reference 5 Using the const Qualifier with Pointers 6 Bubble Sort
Programming in OOP/C++
Introduction Lecture 3-2 Programming in OOP/C++ Arrays Part (2) By Assistant Professor Dr. Ali Kattan 1 Arrays Examples Solutions for previous assignments Write a program to enter and store your name and
12/1/2016. Sorting. Savitch Chapter 7.4. Why sort. Easier to search (binary search) Sorting used as a step in many algorithms
Sorting Savitch Chapter. Why sort Easier to search (binary search) Sorting used as a step in many algorithms Sorting algorithms There are many algorithms for sorting: Selection sort Insertion sort Bubble
COMP1511 focuses on writing programs. Effciency is also important. Often need to consider:
Efficiency COMP1511 focuses on writing programs. Effciency is also important. Often need to consider: execution time memory use. A correct but slow program can be useless. Efficiency often depends on the
SYNOPSIS This case study looks at the design of a small program to calculate escape velocity from the surface of a moon or planet.
pracnique Escape Velocity SYNOPSIS This case study looks at the design of a small program to calculate escape velocity from the surface of a moon or planet. Type: Language: Compiler: Skills: Experience
Lecture 2 Arrays, Searching and Sorting (Arrays, multi-dimensional Arrays)
Lecture 2 Arrays, Searching and Sorting (Arrays, multi-dimensional Arrays) In this lecture, you will: Learn about arrays Explore how to declare and manipulate data into arrays Understand the meaning of
General Instructions. You can use QtSpim simulator to work on these assignments.
General Instructions You can use QtSpim simulator to work on these assignments. Only one member of each group has to submit the assignment. Please Make sure that there is no duplicate submission from your
Chapter 8 Arrays and Strings. Objectives. Objectives (cont d.) Introduction. Arrays 12/23/2016. In this chapter, you will:
Chapter 8 Arrays and Strings Objectives In this chapter, you will: Learn about arrays Declare and manipulate data into arrays Learn about array index out of bounds Learn about the restrictions on array
How to declare an array in C?
Introduction An array is a collection of data that holds fixed number of values of same type. It is also known as a set. An array is a data type. Representation of a large number of homogeneous values.
Lecture 6 Sorting and Searching
Lecture 6 Sorting and Searching Sorting takes an unordered collection and makes it an ordered one. 1 2 3 4 5 6 77 42 35 12 101 5 1 2 3 4 5 6 5 12 35 42 77 101 There are many algorithms for sorting a list
Lecture 04 FUNCTIONS AND ARRAYS
Lecture 04 FUNCTIONS AND ARRAYS 1 Motivations Divide hug tasks to blocks: divide programs up into sets of cooperating functions. Define new functions with function calls and parameter passing. Use functions
Matrices. Jordi Cortadella Department of Computer Science
Matrices Jordi Cortadella Department of Computer Science Matrices A matrix can be considered a two-dimensional vector, i.e. a vector of vectors. my_matrix: 3 8 1 0 5 0 6 3 7 2 9 4 // Declaration of a matrix
Sorting Algorithms. Array Data is being arranged in ascending order using the bubble sort algorithm. #1 #2 #3 #4 #5 #6 #7
Sorting Algorithms One of the fundamental problems of computer science is ordering a list of items. There s a plethora of solutions to this problem, known as sorting algorithms. Some sorting algorithms
An array is a collection of data that holds fixed number of values of same type. It is also known as a set. An array is a data type.
Data Structures Introduction An array is a collection of data that holds fixed number of values of same type. It is also known as a set. An array is a data type. Representation of a large number of homogeneous
Chapter 10 - Notes Applications of Arrays
Chapter - Notes Applications of Arrays I. List Processing A. Definition: List - A set of values of the same data type. B. Lists and Arrays 1. A convenient way to store a list is in an array, probably a
Two Dimensional Array - An array with a multiple indexs.
LAB5 : Arrays Objectives: 1. To learn how to use C array as a counter. 2. To learn how to add an element to the array. 3. To learn how to delete an element from the array. 4. To learn how to declare two
Exercise Set Decide whether each matrix below is an elementary matrix. (a) (b) (c) (d) Answer:
Understand the relationships between statements that are equivalent to the invertibility of a square matrix (Theorem 1.5.3). Use the inversion algorithm to find the inverse of an invertible matrix. Express
Introduction to Computer Science Midterm 3 Fall, Points
Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do
public static <E extends Comparable<? super E>>void BubbleSort(E[] array )
![public static <E extends Comparable<? super E>>void BubbleSort(E[] array )](/thumbs/78/78264888.jpg "public static <E extends Comparable<? super E>>void BubbleSort(E[] array )")
Sorting Algorithms The 3 sorting methods discussed here all have wild signatures. For example, public static
Software Development Techniques. 26 November Marking Scheme
Software Development Techniques 26 November 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions,
by Pearson Education, Inc. All Rights Reserved.
Let s improve the bubble sort program of Fig. 6.15 to use two functions bubblesort and swap. Function bubblesort sorts the array. It calls function swap (line 51) to exchange the array elements array[j]
Computer Programming C++ (wg) CCOs
Computer Programming C++ (wg) CCOs I. The student will analyze the different systems, and languages of the computer. (SM 1.4, 3.1, 3.4, 3.6) II. The student will write, compile, link and run a simple C++
CSCI 2170 Algorithm Analysis
CSCI 2170 Algorithm Analysis Given two solutions (algorithms) for a given problem, which one is better? In computer science, we measure the quality of algorithms in terms of its memory and time efficiency.
Searching & Sorting in Java Bubble Sort
With the bubble sort, the basic idea is to compare adjacent values and exchange them if they are not in order. Consider the following example which shows the first pass through the algorithm. 1. Compare
Arrays. Week 4. Assylbek Jumagaliyev
Arrays Week 4 Assylbek Jumagaliyev a.jumagaliyev@iitu.kz Introduction Arrays Structures of related data items Static entity (same size throughout program) A few types Pointer-based arrays (C-like) Arrays
Introduction to Computers & Programming
16.070 Introduction to Computers & Programming Introduction to: Data Structures and Algorithm Analysis Prof. Kristina Lundqvist Dept. of Aero/Astro, MIT Slides based on: A Practical Introduction to Data
DATA STRUCTURES AND ALGORITHMS. Sorting algorithms (insertion sort, bubble sort, selection sort)
DATA STRUCTURES AND ALGORITHMS Sorting algorithms (insertion sort, bubble sort, selection sort) Summary of the previous lecture Recursion Definition Examples Factorial Fibonacci Hanoi tower Printing of
with Ada.Text_IO; with Ada.Integer_Text_IO; with Ada.IO_Exceptions; procedure Assign11 is
with Ada.Text_IO; with Ada.Integer_Text_IO; with Ada.IO_Exceptions; procedure Assign11 is DNA pattern matcher written by John McCormick, April 2013 This program counts the number of times a pattern of
Lecture 05 POINTERS 1
Lecture 05 POINTERS 1 Pointers Powerful, but difficult to master Simulate call-by-reference Close relationship with arrays and strings Pointer Variable vs. Normal Variable Normal variables contain a specific
IUSE Knowledge Test. 1. Demographic Questions. IUSE Knowledge Test. 2. Computational Thinking Knowledge Test
IUSE Knowledge Test 1. Demographic Questions Your student ID number will be erased from the data file after this survey is linked to the other surveys you have taken or will be taking. * 1. Please enter
CSci 1113 Lab Exercise 6 (Week 7): Arrays & Strings
CSci 1113 Lab Exercise 6 (Week 7): Arrays & Strings Strings Representing textual information using sequences of characters is common throughout computing. Names, sentences, text, prompts, etc. all need
CSC 307 DATA STRUCTURES AND ALGORITHM ANALYSIS IN C++ SPRING 2011
CSC 307 DATA STRUCTURES AND ALGORITHM ANALYSIS IN C++ SPRING 2011 Date: 01/18/2011 (Due date: 01/20/2011) Name and ID (print): CHAPTER 6 USER-DEFINED FUNCTIONS I 1. The C++ function pow has parameters.
Computer Science Foundation Exam
Computer Science Foundation Exam December 18, 015 Section I B COMPUTER SCIENCE NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question # Max Pts Category
Pointers and Strings. Adhi Harmoko S, M.Komp
Pointers and Strings Adhi Harmoko S, M.Komp Introduction Pointers Powerful, but difficult to master Simulate call-by-reference Close relationship with arrays and strings Pointer Variable Declarations and
Solutions to Chapter 8
Solutions to Chapter 8 Review Questions 1. a. True 3. b. False 5. b. False 7. c. index 9. d. ary[0] = x; 11. e. sorting 13. e. sequential 15. a. A two-dimensional array can be thought of as an array of
CSE101-lec#19. Array searching and sorting techniques. Created By: Amanpreet Kaur & Sanjeev Kumar SME (CSE) LPU. LPU CSE101 C Programming
CSE101-lec#19 Array searching and sorting techniques Created By: Amanpreet Kaur & Sanjeev Kumar SME (CSE) LPU Outline Introduction Linear search Binary search Bubble sort Introduction The process of finding
Declaring Array Variable
5. Arrays Sisoft Technologies Pvt Ltd SRC E7, Shipra Riviera Bazar, Gyan Khand-3, Indirapuram, Ghaziabad Website: www.sisoft.in Email:info@sisoft.in Phone: +91-9999-283-283 Array Arrays are used typically
QUIZ. 0] Define arrays 1] Define records 2] How are arrays and records: (a) similar? (b) different?
![QUIZ. 0] Define arrays 1] Define records 2] How are arrays and records: (a) similar? (b) different?](/thumbs/79/78927150.jpg "QUIZ. 0] Define arrays 1] Define records 2] How are arrays and records: (a) similar? (b) different?")
QUIZ 0] Define arrays 1] Define records 2] How are arrays and records: (a) similar? (b) different? 1 QUIZ 3] What are the 4 fundamental types of algorithms used to manipulate arrays? 4] What control structure
Unit 1 - Arrays. 1 What is an array? Explain with Example. What are the advantages of using an array?
1 What is an array? Explain with Example. What are the advantages of using an array? An array is a fixed-size sequenced collection of elements of the same data type. An array is derived data type. The
Two Dimensional Array - An array with a multiple indexs.
LAB5 : Arrays Objectives: 1. To learn how to use C array as a counter. 2. To learn how to add an element to the array. 3. To learn how to delete an element from the array. 4. To learn how to declare two
List of Practical for Class XII Computer Science
List of Practical for Class XII Computer Science P.01. Write a complete C++ program to define class Garment with following description: Private members: Code - type string Type - type string Size - type
Objectives. Chapter 8 Arrays and Strings. Objectives (cont d.) Introduction 12/14/2014. In this chapter, you will:
Objectives Chapter 8 Arrays and Strings In this chapter, you will: Learn about arrays Declare and manipulate data into arrays Learn about array index out of bounds Learn about the restrictions on array
Programación de Computadores. Cesar Julio Bustacara M. Departamento de Ingeniería de Sistemas Facultad de Ingeniería Pontificia Universidad Javeriana
POINTERS Programación de Computadores Cesar Julio Bustacara M. Departamento de Ingeniería de Sistemas Facultad de Ingeniería Pontificia Universidad Javeriana 2018-01 Pointers A pointer is a reference to
Arrays a kind of data structure that can store a fixedsize sequential collection of elements of the same type. An array is used to store a collection
Morteza Noferesti Arrays a kind of data structure that can store a fixedsize sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful
CpSc 1111 Lab 9 2-D Arrays
CpSc 1111 Lab 9 2-D Arrays Overview This week, you will gain some experience with 2-dimensional arrays, using loops to do the following: initialize a 2-D array with data from an input file print out the
SCJ2013 Data Structure & Algorithms. Bubble Sort. Nor Bahiah Hj Ahmad & Dayang Norhayati A. Jawawi
SCJ2013 Data Structure & Algorithms Bubble Sort Nor Bahiah Hj Ahmad & Dayang Norhayati A. Jawawi 1 Bubble Sort Sorting activities for Bubble: Go through multiple passes over the array. In every pass: Compare
Columns A[0] A[0][0] = 20 A[0][1] = 30
![Columns A[0] A[0][0] = 20 A[0][1] = 30](/thumbs/78/77846369.jpg "Columns A[0] A[0][0] = 20 A[0][1] = 30")
UNIT Arrays and Strings Part A (mark questions). What is an array? (or) Define array. An array is a collection of same data type elements All elements are stored in continuous locations Array index always
8/2/10. Looking for something COMP 10 EXPLORING COMPUTER SCIENCE. Where is the book Modern Interiors? Lecture 7 Searching and Sorting TODAY'S OUTLINE
Looking for something COMP 10 EXPLORING COMPUTER SCIENCE Where is the book Modern Interiors? Lecture 7 Searching and Sorting TODAY'S OUTLINE Searching algorithms Linear search Complexity Sorting algorithms
Output of sample program: Size of a short is 2 Size of a int is 4 Size of a double is 8
Pointers Variables vs. Pointers: A variable in a program is something with a name and a value that can vary. The way the compiler and linker handles this is that it assigns a specific block of memory within
Programming for Engineers Arrays
Programming for Engineers Arrays ICEN 200 Spring 2018 Prof. Dola Saha 1 Array Ø Arrays are data structures consisting of related data items of the same type. Ø A group of contiguous memory locations that
C Arrays. Group of consecutive memory locations Same name and type. Array name + position number. Array elements are like normal variables
1 6 C Arrays 6.2 Arrays 2 Array Group of consecutive memory locations Same name and type To refer to an element, specify Array name + position number arrayname[ position number ] First element at position
Discrete Mathematics 1
Discrete Mathematics 1 http://iscasmc.ios.ac.cn/dm2016 Lijun Zhang April 5, 2016 1 Materials about the axiomatization are provided by Dr. Wanwei Liu. Contents 1. The Foundations: Logic and Proofs 2. Basic
CS 106 Introduction to Computer Science I
CS 106 Introduction to Computer Science I 06 / 11 / 2015 Instructor: Michael Eckmann Today s Topics Comments and/or Questions? Sorting Searching Michael Eckmann - Skidmore College - CS 106 - Summer 2015
16.unified Introduction to Computer Programming. Examination 11/18/05
16.unified Introduction to Computer Programming Examination 11/18/05 Professor I. Kristina Lundqvist, Lecturers Heidi Perry and Gustaf Naeser Fall 2005 You have 55 minutes to take this examination. Do
Chapter 6. Arrays. Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved.
1 Chapter 6 Arrays Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 2 Chapter 6 - Arrays 6.1 Introduction 6.2 Arrays 6.3 Declaring Arrays 6.4 Examples Using Arrays
Pointers. Chih-Wei Tang ( 唐之瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan
Pointers Chih-Wei Tang ( 唐之瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan Outline 7.1 Introduction 7.2 Pointer Variable Definitions and Initialization 7.3 Pointer
CS115 Principles of Computer Science
CS5 Principles of Computer Science Chapter Arrays Prof. Joe X. Zhou Department of Computer Science CS5 Arrays. Re: Objectives in Methods To declare methods, invoke methods, and pass arguments to a method
Quadratic: the time that it takes to sort an array is proportional to the. square of the number of elements.
ITEC 136 Business Programming Concepts Week 12, Part 01 Overview 1 Week 12 Overview Week 11 review Associative Arrays Common Array Operations Inserting shifting elements right Removing shifting elements
Data Structures and Algorithms Sorting
Data Structures and Algorithms Sorting Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/23 12-0: Sorting Sorting is
Matlab and Octave: Quick Introduction and Examples 1 Basics
Matlab and Octave: Quick Introduction and Examples 1 Basics 1.1 Syntax and m-files There is a shell where commands can be written in. All commands must either be built-in commands, functions, names of
DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305
Q.1 If h is any hashing function and is used to hash n keys in to a table of size m, where n
C/C++ Programming Lecture 18 Name:
. The following is the textbook's code for a linear search on an unsorted array. //***************************************************************** // The searchlist function performs a linear search
Data Structures and Algorithms
Data Structures and Algorithms CS245-2015S-10 Sorting David Galles Department of Computer Science University of San Francisco 10-0: Main Memory Sorting All data elements can be stored in memory at the
5.2 Defining and Initializing Arrays Statically in the Data Segment
5 Arrays and Files 5.1 Objectives After completing this lab, you will: Define and initialize arrays statically in the data segment Allocate memory dynamically on the heap Compute the memory addresses of
Chapter 4 - Arrays. 4.1 Introduction. Arrays Structures of related data items Static entity (same size throughout program)
Chapter - Arrays 1.1 Introduction 2.1 Introduction.2 Arrays.3 Declaring Arrays. Examples Using Arrays.5 Passing Arrays to Functions.6 Sorting Arrays. Case Study: Computing Mean, Median and Mode Using Arrays.8
Algorithms. Chapter 8. Objectives After studying this chapter, students should be able to:
Objectives After studying this chapter, students should be able to: Chapter 8 Algorithms Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.
Arrays and functions Multidimensional arrays Sorting and algorithm efficiency
Introduction Fundamentals Declaring arrays Indexing arrays Initializing arrays Arrays and functions Multidimensional arrays Sorting and algorithm efficiency An array is a sequence of values of the same
Outline Introduction Arrays Declaring Arrays Examples Using Arrays Passing Arrays to Functions Sorting Arrays
Arrays Outline 1 Introduction 2 Arrays 3 Declaring Arrays 4 Examples Using Arrays 5 Passing Arrays to Functions 6 Sorting Arrays 7 Case Study: Computing Mean, Median and Mode Using Arrays 8 Searching Arrays
Programming 1. Lecture 6 Structured data types. Arrays
Programming 1 Lecture 6 Structured data types. Arrays Objectives Understand the difference between simple and structured data types Manage the following structured data types: one-dimensional and two-dimensional
Chapter 4 - Arrays. 4.1 Introduction. Arrays Structures of related data items Static entity (same size throughout program) A few types
Chapter 4 - Arrays 1 4.1 Introduction 4.2 Arrays 4.3 Declaring Arrays 4.4 Examples Using Arrays 4.5 Passing Arrays to Functions 4.6 Sorting Arrays 4.7 Case Study: Computing Mean, Median and Mode Using
MATLAB. Devon Cormack and James Staley
MATLAB Devon Cormack and James Staley MATrix LABoratory Originally developed in 1970s as a FORTRAN wrapper, later rewritten in C Designed for the purpose of high-level numerical computation, visualization,
(6) The specification of a name with its type in a program. (7) Some memory that holds a value of a given type.
CS 7A - Fall 2016 - Midterm 1 10/20/16 Write responses to questions 1 and 2 on this paper or attach additional sheets, as necessary For all subsequent problems, use separate paper Do not use a computer
Procedural Programming
Universität Duisburg-Essen PRACTICAL TRAINING TO THE LECTURE Procedural Programming Session Five: Arrays Name: First Name: Tutor: Matriculation-Number: Group-Number: Date: Prof. Dr.Ing. Axel Hunger Dipl.-Ing.
C Pointers. sizeof Returns size of operand in bytes For arrays: size of 1 element * number of elements if sizeof( int ) equals 4 bytes, then
1 7 C Pointers 7.7 sizeof Operator 2 sizeof Returns size of operand in bytes For arrays: size of 1 element * number of elements if sizeof( int ) equals 4 bytes, then int myarray[ 10 ]; printf( "%d", sizeof(
Data Structures and Algorithms(8)
Data Structures and Algorithms(8) Instructor: Ming Zhang Textbook Authors:Ming Zhang, Tengjiao Wang and Haiyan Zhao Higher Education Press, 2008.6 (the Eleventh Five-Year national planning textbook) https://courses.edx.org/courses/pekingx/04830050x/2t2014/
LECTURE 17. Array Searching and Sorting
LECTURE 17 Array Searching and Sorting ARRAY SEARCHING AND SORTING Today we ll be covering some of the more common ways for searching through an array to find an item, as well as some common ways to sort