darkangel ^-^
12-11-2008, 14:27
السلام عليكم
ارجووووكم في حد يقدر يساعدني وان شاء الله ربنا يجازيه خير
انا عندي هالواجب الي طير عقلي وما في حد عارف يحله وما عندي احد يفهم في هالموضوع
فالي يقدر يحلله لي
ربنا يوفقه وان شاء الله بردها له
:ميت:
هذا هوه الواجب
(a) Add a member function ReturnLastItem () to the UnsortedType ADT that returns the last element in the list. The function has the following prototype:
ItemType ReturnLastItem();
Preconditions: List is initialized and not empty.
Postconditions: List is unchanged.
(b) Add a member function GreaterThanItem () to the UnsortedType ADT that returns the number of elements which are greater than a given item. The given item is passed as a parameter to the function. The function has the following prototype:
int GreaterThanItem(ItemType givenItem);
(c) Write a recursive client function that prints the elements of a stack (linked implementation) in reverse order (from bottom to top). The function has the following specification:
void printStackReverse(StackType stack)
Function: Prints the elements of stack in reverse order (from bottom to top).
Precondirtion: Stack is not empty.
Postcondition: Stack is not changed.
Note: Assume that ItemType is defined as
typedef int ItemType;
يقدر يحل يحل الي يهاهم كلهم:D
او على الاقل واحد منهم::جيد::
ومشكوووووووووووووورين :ميت:
ساعدوني :بكاء:
ارجووووكم في حد يقدر يساعدني وان شاء الله ربنا يجازيه خير
انا عندي هالواجب الي طير عقلي وما في حد عارف يحله وما عندي احد يفهم في هالموضوع
فالي يقدر يحلله لي
ربنا يوفقه وان شاء الله بردها له
:ميت:
هذا هوه الواجب
(a) Add a member function ReturnLastItem () to the UnsortedType ADT that returns the last element in the list. The function has the following prototype:
ItemType ReturnLastItem();
Preconditions: List is initialized and not empty.
Postconditions: List is unchanged.
(b) Add a member function GreaterThanItem () to the UnsortedType ADT that returns the number of elements which are greater than a given item. The given item is passed as a parameter to the function. The function has the following prototype:
int GreaterThanItem(ItemType givenItem);
(c) Write a recursive client function that prints the elements of a stack (linked implementation) in reverse order (from bottom to top). The function has the following specification:
void printStackReverse(StackType stack)
Function: Prints the elements of stack in reverse order (from bottom to top).
Precondirtion: Stack is not empty.
Postcondition: Stack is not changed.
Note: Assume that ItemType is defined as
typedef int ItemType;
يقدر يحل يحل الي يهاهم كلهم:D
او على الاقل واحد منهم::جيد::
ومشكوووووووووووووورين :ميت:
ساعدوني :بكاء: