ACADEMICS
Course Detail

ELE 411 Data Structures
2016-2017 Summer term information

The course is not open this term

Timing data are obtained using weekly schedule program tables. To make sure whether the course is cancelled or time-shifted for a specific week one should consult the supervisor and/or follow the announcements.

Course definition tables are extracted from the ECTS Course Catalog web site of Hacettepe University (http://ects.hacettepe.edu.tr) in real-time and displayed here. Please check the appropriate page on the original site against any technical problems.

ELE411 - DATA STRUCTURES

Course Name Code Semester Theory
(hours/week)
Application
(hours/week)
Credit ECTS
DATA STRUCTURES ELE411 7th Semester 3 0 3 6
Prerequisite(s)ELE118 Computers and Programming II
Course languageEnglish
Course typeElective 
Mode of DeliveryFace-to-Face 
Learning and teaching strategiesLecture
Question and Answer
Problem Solving
 
Instructor (s)Faculty members 
Course objectiveThe course aims at teaching students programming tools, programming structures, models, analysis and applications.  
Learning outcomes
  1. Know programming tools and analyses programs.
  2. Uses Data Structures in Programming Applications.
  3. Implements algorithms in engineering area.
  4. Designs algorithms and programs using techniques taught in the class.
Course Content1.Data Structures; Concepts and Review
2. Effective Programming Techniques
3. Stack, Recurson and Queues
4. Searching Algorithms
5. Linked Lists and Applications
6. Sorting Algorithms
7. Tree Structures
 
ReferencesFord W., Topp W., Data Structures with C++, Prentice Hall, 1996.
Sedgewick R., Algorithms in C, Addison Wesley, 1990.
 

Course outline weekly

WeeksTopics
Week 1Data Structures; Intręduction, Definitions, Concepts
Week 2Stack, Recursion and Queues; Applicatioins
Week 3Queues; Calssification, Types and Applications
Week 4Lists, Linked Lists and Applications
Week 5Searching Algorithms
Week 6Hash Algorithms
Week 7Sorting Algorithms; Simple Algorithms, Algorithm Analysis
Week 8Bubble Sort, Smple Selection Sort and Insertion Sort
Week 9Quick Sort, HeapSort, Merge Sort and Shell Sort Algorithms
Week 10Radix Sort, Bucket Sort and Counting Sort
Week 11Midterm
Week 12Tree; Definition and Applications
Week 13Binary Trees; Analysis and Applications
Week 14AVL Trees; Analysis and Applications
Week 15Preparation for Final exam
Week 16Final Exam

Assesment methods

Course activitiesNumberPercentage
Attendance00
Laboratory00
Application00
Field activities00
Specific practical training00
Assignments110
Presentation00
Project00
Seminar00
Midterms140
Final exam150
Total100
Percentage of semester activities contributing grade succes150
Percentage of final exam contributing grade succes150
Total100

Workload and ECTS calculation

Activities Number Duration (hour) Total Work Load
Course Duration (x14) 14 3 42
Laboratory 0 0 0
Application000
Specific practical training000
Field activities000
Study Hours Out of Class (Preliminary work, reinforcement, ect)13339
Presentation / Seminar Preparation000
Project000
Homework assignment155
Midterms (Study duration)13535
Final Exam (Study duration) 13535
Total Workload3081156

Matrix Of The Course Learning Outcomes Versus Program Outcomes

D.9. Key Learning OutcomesContrubition level*
12345
1. PO1. Possesses the theoretical and practical knowledge required in Electrical and Electronics Engineering discipline.    X 
2. PO2. Utilizes his/her theoretical and practical knowledge in the fields of mathematics, science and electrical and electronics engineering towards finding engineering solutions.    X
3. PO3. Determines and defines a problem in electrical and electronics engineering, then models and solves it by applying the appropriate analytical or numerical methods.     X
4. PO4. Designs a system under realistic constraints using modern methods and tools.  X  
5. PO5. Designs and performs an experiment, analyzes and interprets the results.   X 
6. PO6. Possesses the necessary qualifications to carry out interdisciplinary work either individually or as a team member.  X   
7. PO7. Accesses information, performs literature search, uses databases and other knowledge sources, follows developments in science and technology.   X 
8. PO8. Performs project planning and time management, plans his/her career development.  X  
9. PO9. Possesses an advanced level of expertise in computer hardware and software, is proficient in using information and communication technologies.    X
10. PO10. Is competent in oral or written communication; has advanced command of English.    X
11. PO11. Has an awareness of his/her professional, ethical and social responsibilities.  X  
12. PO12. Has an awareness of the universal impacts and social consequences of engineering solutions and applications; is well-informed about modern-day problems. X   
13. PO13. Is innovative and inquisitive; has a high level of professional self-esteem.   X 

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest

General Information | Course & Exam Schedules | Real-time Course & Classroom Status
Undergraduate Curriculum | Academic Calendar | Open Courses, Sections and Supervisors | Weekly Course Schedule | Examination Schedules | Information for Registration | Prerequisite and Concurrent Courses | Legal Info and Documents for Internship | Information for ELE 401-402 Graduation Project | Program Educational Objectives & Student Outcomes | ECTS Course Catalog | HU Registrar's Office
Graduate Curriculum | Open Courses and Supervisors | Weekly Course Schedule | Final Examinations Schedule | Schedule of Graduate Thesis Defences and Seminars | Information for Registration | ECTS Course Catalog - Master's Degree | ECTS Course Catalog - PhD Degree | HU Graduate School of Science and Engineering