University :Damietta University |
Faculty :Faculty of Science |
Department :الرياضيات |
|
| 1- Course data :- |
| | Code: | 320ر | | Course title: | Data Structures-Calculus of Variation | | Year/Level: | ثالثة فيزياء وعلوم حاسب | | Program Title: | | | Specialization: | | | Teaching Hours: | Theoretical: | 4 | Tutorial: | 1 | Practical: | 2 |
|
| 2- Course aims :- |
| - Have the basic skills and knowledge (Mathematics and Computer Science, problem solving skills, analytical skills, communication skills and flexibility) necessary for a successful career in Mathematics/Computer Science.
- Are able to apply knowledge of Mathematics and Computer Science fundamentals, including programming, computer and data structures and computer networks.
|
| 3- Course Learning Outcomes :- |
| |
| 4- Course contents :- |
| | No | Topics | Week |
|---|
| 1 | Fundamentals of program | | | 2 | Soft ear devolpment in JAVA | | | 3 | Recurrsion | | | 4 | Stack | | | 5 | Quenes | | | 6 | searching | | | 7 | sorting | | | 8 | linked list | | | 9 | Extremum of a function of many variables | | | 10 | Conditional Extremum of a function of many variables | | | 11 | the functional | | | 12 | extremum of a functional | | | 13 | Conditional extremum of a functional | | | 14 | Moving Boundary problems | |
|
|
| 5- Teaching and learning methods :- |
| | S | Method |
|---|
| Discussion during the lectures | | Homework | | Short exam | | Solving problems |
|
|
| 6- Teaching and learning methods of disables :- |
| - لايوجد
|
|
| 7- Student assessment :- |
| A. Timing |
| | No | Method | Week |
|---|
| 1 | questions | first week | | 2 | mid exam | six | | 3 | solving problems | all | | 4 | final exam | last week |
|
| B. Degree |
| | No | Method | Degree |
|---|
| 1 | Mid_term examination | 2.5 | | 2 | Final_term examination | 90 | | 3 | Oral examination | 5 | | 4 | Practical examination | 0 | | 5 | Semester work | 2.5 | | 6 | Other types of asessment | 0 | | Total | 100% |
|
|
| 8- List of books and references |
| | S | Item | Type |
|---|
| 1 | S. Lipschutz, “ Data Structure”, McGraw-Hill,1986 | | | 2 | N.Dale, “ C++ Plus Data Structrues.” Jones and Barlett,2003. | | | 3 | A.Berman, “ Data Structure via C++”, Oxford Univ. Press, 1997. | |
|
|
| 9- Matrix of knowledge and skills of the course |
| | S | Content | Study week |
|---|
| Fundamentals of program | | | Soft ear devolpment in JAVA | | | Recurrsion | | | Stack | | | Quenes | | | searching | | | sorting | | | linked list | | | Extremum of a function of many variables | | | Conditional Extremum of a function of many variables | | | the functional | | | extremum of a functional | | | Conditional extremum of a functional | | | Moving Boundary problems | |
|
|
| Course Coordinator(s): - |
| - رانيا محمد عبده الطنطاوى
|
| Head of department: - |
| محمد أحمد أنور محمد الشهاوى |
