Scribd Logo
Загрузить

Добро пожаловать в Scribd!

  • CS-225 Computer Science II Fall 2012 Homework 3 Due: Friday, Oct 26, at 12 Noon

    Загружено:

    sckleymann
    25 просмотров1 страница
    This document provides instructions for homework 3 in CS-225, which is due on October 26th at noon. Students are asked to implement a deque (double-ended queue) ADT as a linked structure by modifying an existing linked list queue implementation file to support deque operations at both ends, and thoroughly test their code with a driver program.

    Исходное описание:

    Оригинальное название

    HW3

    Авторское право

    © Attribution Non-Commercial (BY-NC)

    Доступные форматы

    DOC, PDF, TXT или читайте онлайн в Scribd

    Этот документ был вам полезен?

    Это неприемлемый материал?

    Пожаловаться на этот документ
    This document provides instructions for homework 3 in CS-225, which is due on October 26th at noon. Students are asked to implement a deque (double-ended queue) ADT as a linked structure by modifying an existing linked list queue implementation file to support deque operations at both ends, and thoroughly test their code with a driver program.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате DOC, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    25 просмотров1 страница

    CS-225 Computer Science II Fall 2012 Homework 3 Due: Friday, Oct 26, at 12 Noon

    Загружено:

    sckleymann
    This document provides instructions for homework 3 in CS-225, which is due on October 26th at noon. Students are asked to implement a deque (double-ended queue) ADT as a linked structure by modifying an existing linked list queue implementation file to support deque operations at both ends, and thoroughly test their code with a driver program.

    Авторское право:

    Attribution Non-Commercial (BY-NC)
    Скачайте в формате DOC, PDF, TXT или читайте онлайн в Scribd
    Отметить как неприемлемый контент
    из 1

    CS-225 Computer Science II Fall 2012 Homework 3 Due: Friday, Oct 26, at 12 noon

    A deque (double-ended queue) is a queue in which insertions and deletions can occur at either end. Create and implement a deque ADT. The DeQueType class that you create must be implemented as a linked structure. Start with the files in: I:\ACADEMIC\Math-CS-Stat\cs-225\hw\fall 2012\hw3 Modify the DeQueType implementation file (hw3 DeQue.cpp) so that it supports the DeQueType specification file (hw3 DeQue.h). Note:

    hw3 DeQue.cpp contains just the standard linked list implementation of a queue, so you will have to rename many items. You are not allowed to modify the DeQueType specification file. Thoroughly test your deque ADT with your own driver.

    Your code should be well documented. Do not use any global variables. Email your code ( hw3 DeQue.cpp) to me (thostetl@coe.edu) prior to the due date given above.

    Вам также может понравиться