ecet
59 views | +0 today

# ecet

Curated by Burnssteinr4
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 370 Week 3 Lab 3 Linked Lists

Burnssteinr4's insight:

General Instructions

Exercises 1, 2, and 3 use the programs in DocSharing labeled “User-defined linked list."

Exercise 4 uses the programs in DocSharing labeled “Using java.util.LinkedList."

Exercise 1: Review of Linked Lists Create a project using the classes in the DocSharing area labeled “User-defined linked list." Compile it, run it, and review the code that is given carefully. This code tests the LinkedList class provided in the lecture. Extend the class Main to test the functions isEmpty, search and remove of the class LinkedList.

Exercise 2: A User-Defined Linked List Modify the class LinkedList given in the lecture by adding to it the functions listed below for Exercise 2. In each case, the appropriate error message should be generated if an invalid condition occurs. a. toString(): modify the display function to overload the toString function of the Object class. b. int length(): create this function to determine the number of items in the list (accessor function). c. void clear(): create this function to remove all of the items from the list. After this operation is completed, the length of the list is zero. d. void insertEnd(int item): create this function to insert item at the end of the list. e. void replace(int location, int item): create this function to replace the item in the list at the position specified by location. The item should be replaced with item. f. int get(int location): create a function that returns the element at the position location.

Exercise 3: Using a Linked List This exercise is similar to Exercise 3 in Lab 2, but uses the LinkedList class implemented in Exercise 2 above. That is, using the class LinkedList, write a program that uses it to store 100 random numbers. Again, consider that each of these random numbers is an integer in the interval [0, 200]. Write the program in such a way that there are no number duplicates.

Exercise 4: Review of the Library Class java.util.LinkedList Create a project using the class in the DocSharing area labeled “Using java.util.LinkedList." Compile it, run it, and review the code that is given carefully. This code is the complete program given in our lecture that tests the library class java.util.LinkedList. Exercise 5: Using the Library Class java.util.LinkedList Rewrite Exercise 3 (above) using the class java.util.LinkedList to store the 100 random numbers.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 370 Week 5 Lab 5 Search Algorithms and Techniques

Burnssteinr4's insight:

General Instructions

Exercise 1 uses the programs in DocSharing labeled “Search algorithms."

Exercise 1: Review of the Lecture Content Create a project using the ArrayList class and the Main class provided in DocSharing. The ArrayList class contains implementations of the first three search methods explained in this week’s lecture: sequential, sorted, and binary search. The Main class uses these three methods. These programs test the code discussed in the lecture. Compile the project, run it, and review the code that is given carefully.

Exercise 2: Search Algorithms and Techniques Expand the project developed in the previous exercise to perform the following experiment: time the three search methods several times each and record the results. Compare the running times of the three search methods (sequential search, sorted search, and binary search) which are obtained during the experiment. What conclusions can be drawn?

Exercise 3: Searching Applications Select one of the following two problems to solve: Problem 1: Design and implement an algorithm that determines whether or not a given array of elements, list1, is completely contained within another given array of elements, list2. Consider two different scenarios: 1) both arrays are sorted; 2) both arrays are unsorted. Problem 2: Design an algorithm that when given a collection of integers in an unsorted array, determines the second smallest number (or second minimum). For example, if the array consists of the values 12, 23, 9, 17, 3, the algorithm should report the value 9, since it is the second smallest number in the array. Write a function that receives an array as a parameter and returns the second smallest number. To test your function, write a program that populates an array with random numbers and then call your function. Exercise 4: Hashing Suppose that the type of key in a hashing application you are implementing is String (Sections 19.6 and 19.7 in our textbook explain hash functions for strings). Design, implement, and test a hash function that converts a key to a hash value. Assume that the size of the hash table is a prime number.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 370 All Ilabs Week 1 - Week 7

Burnssteinr4's insight:

ECET 370 Week 1 Lab 1

ECET 370 Week 2 Lab 2

ECET 370 Week 3 Lab 3 Linked Lists

ECET 370 Week 4 Lab 4 Complexity of Computational Problems

ECET 370 Week 5 Lab 5 Search Algorithms and Techniques

ECET 370 Week 7 Lab 7 Binary Trees

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 365 Lab 2 Temperature Measuring System using a Microcontroller

Burnssteinr4's insight:

Lab 2 of 6: Temperature Measuring System using a Microcontroller

Submit your assignment to the Dropbox located under the silver tab at the top of this page.

(See Syllabus section Due Dates for Assignments & Exams for due dates.)

L A B O V E R V I E W

Scenario/Summary

To know how to design and use signal conditioners to interface analog sensors or transducers to the HC12To learn how to use A-to-D Converters to input and digitize signals coming to the microprocessor from analog input devicesTo learn how to write a C language program to sample, process, and output the data from an analog device on an LCD

Deliverables

Answer all parts, and submit completed lab document.

L A B S T E P S

STEP 2: Complete the lab instructions

Follow the directions and steps to complete the Week 2 Lab. Be sure to complete each part.

STEP 3: Submit

Submit the completed lab document in a Word file

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 365 Lab 4 Servo Control Using Pulse Width Modulation (PWM)

Burnssteinr4's insight:

Lab 4 of 6: Servo Control Using Pulse Width Modulation (PWM)

Submit your assignment to the Dropbox located under the silver tab at the top of this page.

(See Syllabus section Due Dates for Assignments & Exams for due dates.)

L A B O V E R V I E W

Scenario/Summary

To become familiar with the PWM interface using the Dragon 12 Plus with serial monitorTo learn how to use input and output subroutines in C languageTo learn how to compose projects containing several modules

Deliverables

Answer all parts and submit completed lab document.

L A B S T E P S

STEP 2: Complete the lab instructions

Follow the directions and steps to complete the Week 4 Lab. Be sure to complete each part.

STEP 3: Submit

Submit the completed lab document in a Word file.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 370 Week 4 Lab 4 Complexity of Computational Problems

Burnssteinr4's insight:

General Instructions

Exercise 1 uses the programs in DocSharing labeled “Minimum," “Factorial,” and “Sorting algorithms."

Exercise 1: Review of the Lecture Contents Create projects using the classes in the DocSharing areas labeled “Minimum," “Factorial,” and “Sorting algorithms." Compile them, run them, and review the code that is given carefully. These programs test the code discussed in the lecture.

Exercise 2: Efficiency of Algorithms Problem 2 in the Section “Projects” at the end of Chapter 9 in the textbook: find a value of n for which Loop B is faster.

Exercise 3: Recursion Problem 1 in the Section “Projects” at the end of Chapter 10 in the textbook: recursive algorithm to find the square root of a given number. Exercise 4: Sorting In this week’s lecture, the algorithms quicksort and bubblesort are described and implemented. In DocSharing, under the section labeled “Sorting algorithms," you can find the class ArrayList where these sorting algorithms are implemented. Write a Java program that times both of them for various values of n. Create a table to record the times. Regarding the efficiency of both sorting methods, what conclusion can be reached from this experiment? Note: You can probably save development time by using the program from Week 2 to generate a list of the 1000 smallest prime numbers (in random order). This list could then be used as the input to the sorting algorithms.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 370 Week 7 Lab 7 Binary Trees

Burnssteinr4's insight:

Full set of lab with working programs.

Exercise 1: Lecture review: Binary Search Tree Create a project using the classes BinarySearchTree, Node, and Main in the DocSharing area labeled “The BST." Compile the project, run it, and review the code that is given carefully. These programs test the code discussed in our lecture.

Exercise 2: An improved BST class Modify the class BinarySearchTree so that it contains the toString method, instead of the display method that was given originally.

Exercise 3: Using a BST in an application Use a binary search tree to implement a dictionary that contains the keywords in the Java language. Test it. Note that you can use the programs from the previous exercises. For a list of the keywords in Java, visit http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html.

Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the nodes in a binary search tree.

Exercise 5: Using properties of BSTs Write an algorithm getMax to find the maximum value stored in a binary search tree.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 365 Lab 1 Using the Serial Communication Interface in a Microcontroller

Burnssteinr4's insight:

Lab 1 of 6: Using the Serial Communication Interface in a Microcontroller

Submit your assignment to the Dropbox located on the silver tab at the top of this page.

(See Syllabus section Due Dates for Assignments & Exams for due dates.)

L A B O V E R V I E W

Scenario/Summary

1. To use the built-in COM port and understand how it sends and receives serial data using the RS-232 communication standard

2. To learn how to program the HC12 Serial Communication Interface in C language to transfer data between sender and receiver and display it

Deliverables

Answer all parts, and submit completed lab document.

L A B S T E P S

STEP 2: Complete the lab instructions

Follow the directions and steps to complete the Week 1 Lab. Be sure to complete each part.

STEP 3: Submit

Submit the completed lab document in a Word file.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 365 Lab 3 Traffic Light Control Using Finite State Machines (FSM)

Burnssteinr4's insight:

Lab 3 of 6: Traffic Light Control Using Finite State Machines (FSM)

Submit your assignment to the Dropbox located under the silver tab at the top of this page.

See Syllabus section Due Dates for Assignments & Exams for due dates.

L A B O V E R V I E W

Scenario/Summary

To understand how a relatively simple finite state machine abstraction can be used to implement a complex set of equivalent relay actions in hardwareTo analyze a familiar real-world problem in terms of how system inputs and the present state determine the next output state using a state diagramTo acquire proficiency in the use of statically allocated linked list data structures to define a sequence of states involving multiple variables

Deliverables

Answer all parts, and submit completed lab document.

L A B S T E P S

STEP 1: Open lab document

STEP 2: Complete the lab instructions

Follow the directions and steps to complete the Week 3 Lab. Be sure to complete each part.

STEP 3: Submit

Submit the completed lab document in a Word file.

No comment yet.
 Scooped by Burnssteinr4

## DeVryGenius.com - ECET 365 Lab 5 Servo Motor Interfaces-Closed-Loop Motor Speed Control

Burnssteinr4's insight:

Lab 5 of 6: Servo Motor Interfaces-Closed-Loop Motor Speed Control

Submit your assignment to the Dropbox located under the silver tab at the top of this page.

(See Syllabus section Due Dates for Assignments & Exams for due dates.)

L A B O V E R V I E W

Scenario/Summary

To understand the operation of servo motors and optical interrupter switchesTo analyze the interface requirements for connecting an optical interrupter to an HC12 and implementing the interfaceTo learn how to write a C language program that controls the speed and direction of a dc motor and displays motor speed in RPM to the PC monitorTo learn how to program a continuous feedback control loop that stabilizes the speed of a servo motor under varying load using the HC12 input capture timer.

Deliverables

Answer all parts and submit completed lab document.

L A B S T E P S

STEP 2: Complete the lab instructions

Follow the directions and steps to complete the Week 5 Lab. Be sure to complete each part.

STEP 3: Submit

Submit the completed lab document in a Word file.

No comment yet.