| CCS 2100 | | Comp 310 | | CCS 1300 | | CCS 1200 | | CCS 1100 | | CCS 1000 | | CS 212 | | Email: cpuccs@yahoo.com
Showing posts with label Queue. Show all posts
Showing posts with label Queue. Show all posts

Wednesday, March 6, 2013

Mock Final Laboratory Exam Sample for Data Structures and Algorithm

The following is the link to the copy of mock test given in preparation for the final exams next week. (Note: click the smaller download link, not the big one in the ads):

Mock Programming Test

URL: http://www.2shared.com/file/3_e-C8Gg/Mock_Test.html

It contains the following:

      1. Abstract classes of the data structures' Array-Based Lists, Linked Lists, Stacks and Queues
      2. Sample programs of the said data structures as well as that of Recursion
      3. Sample test with instructions.

Note of the following laboratory exam schedules for the CCS 1300 S.Y. 2012-2013:
      1826 - March 15
      1827 - March 13
      1829 - March 19
      1830 - March 14

These will be during your laboratory schedule. Admittance only for those who arrive 15 minutes after the time.

Good luck!

Wednesday, February 20, 2013

Queues Example

The following is the link to the sample program demonstrating how queues work. (Note: click the smaller download link, not the big one in the ads):

Queues
http://www.2shared.com/file/XC5kxDuv/Queues.html

Monday, December 10, 2012

Research Assignment for CCS 1300

Research Assignment for CCS 1300

Define, identify the functions and methods(and their purpose), and give concrete examples (both in real life and in programming) of the basic types of data structures:

1.     Array – Based Lists
2.     Linked – Lists
3.     Recursion
4.     Stacks
5.     Queues

Pass with your full name, subject description, stub code and lecture schedule at the top of the document.

Format: Short Bond Paper
            Margins: 1” in 4 corners
            Font: Arial
            Size: 11

Deadline: for soft copies, email to cpuccs@yahoo.com with the subject “1300 Research” until January 3, 2013. If the subject is incorrect, your email will be ignored.

For hard copies, pass your work on or before January 8, 2013. Late papers will not be accepted and would automatically merit a score of ZERO. No need to place in a folder but keep the papers neat and stapled properly.

Note: Plagiarism would not merit any score. Although noting references is allowed, copy/paste method is NOT.

- Sir Rod.


Thursday, September 27, 2012

Data Structures and Algorithm Using Java Sample Program

Data Structures and Algorithm Using Java Sample Program

Click Here or

Here is the link:
http://www.2shared.com/file/zzLAufJu/Sample_Prog.html

Samples of Stacks and Queues are present with the filename Test_Lastname.java

Goodluck with the final exams!