CSCI 161 - Algorithm Analysis and Data Structure.

My summer classes are almost done! And since I had developed some code I decided to share....  Most of the labs were easy except Lab 5 and 6 which require some understanding in order to code. There are useful explanation about each method and Class so it should not be a problem. Also, all the code is following Java conventions (at least we tried to follow it.) All labs were scored as A+ so they are definitely worthy looking! Here is the information about each lab:

LAB 1:  

Simple implementation from the Netbeans Tutorial.

LAB 2:  

Another simple implementation from the Netbeans Tutorial.

LAB 3:

In this lab we (me and my partners) implemented the code from a Design (which is included in the folder)


1. Learn how to translate your design from assignment # 1 into java code. 
2.  Learn how to express class relationships in Java language syntax.  
3. Learn how to create (or instantiate) and populate objects of classes.

LAB 4:

Easy tutorial about GUI building

·       First tutorial  (4L): This Beginner Tutorial teaches you how to create a simple graphical user interface and add simple back-end functionality. In particular you will learn how to code the behavior of buttons and fields in a Swing form.

·       Second tutorial (4G) : This Tutorial guides you through the process of creating the graphical user interface (GUI) for an application called ContactEditor using the NetBeans IDE GUI Builder. In the process you will layout a GUI front-end that enables you to view and edit contact information of individuals included in an employee database. (The GUI is not fully implemented

LAB 5:

1. Learn how implement searching & sorting algorithms in Java.
2. Learn how to use experimental results to approve or disprove the following regarding algorithms performance:
         
§  The binary search algorithm takes O(log n) time in the worst case giving the fact that the original data set is sorted.

§  We claim that, the sequential search algorithm which takes O(n) time,  may outperform the binary search when the original data set is not sorted.

Write a Java program (main class & methods) to implement and analyze the performance of two search algorithms, sequential search and the binary search. Each task such as creating and printing the arrays should be done outside the main function, i.e. use functions/methods.  Each sorting algorithm should be implemented in a separate function/method. 

LAB 6:

1. Learn how implement the STACK using a SINGLE LINKEDLIST.
2. Learn how to use push(), pop(), size(), peek(), isEmpty(),  isFull() on a stack.
3. Learn how to check for and handle possible exceptions that may occur. 
 
Download:


Disclaimer: For educational purpose only! By downloading you agree that all code developed by me and my partners will solely be used to guide you through your coding. Me and my partners do not take responsibility for code misuse or cheating.