Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3BBM203SOFTWARE LABORATORY I0+2+01206.09.2024

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program COMPUTER ENGINEERING
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course To enable the students in writing and executing sample programs using the concepts taught in Data Structures course.
Course Content The laboratory includes 4 programming assignments. The students are expected to present a well-designed documentary report with their assignments. The utilization of compilers, package programs and recent IDEs (Integrated Development Environments) are included in this laboratory.
Course Methods and Techniques Lecture, Experiment
Prerequisites and co-requisities ( BBM103 ) and ( BBM201 ) and ( BBM101 )
Course Coordinator None
Name of Lecturers Associate Prof.Dr. Adnan Özsoy
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Horowitz E., Sahni S. and Mehta D., Fundamentals of Data Structures in C++, Computer Science Press, 1995. Deitel H.M. and Deitel P.J., How to Program C++ and Java, Prentice-Hall, 2001. Problem Solving and Program Design in C, 7th Edition. Jeri Hanly and Elliot Koff-man, Pearson, 2013 Data Structures and Algorithm Analysis in C++. 4th Edition, Mark Allen Weiss, Pear-son, 2014
Course Notes 1. Horowitz E., Sahni S., Anderson S.,””Fundamentals of Data Structures in C”, Computer Scince Press, New York, 1993
2. Horowitz E., Sahni S., Mehta D.,”Fundamentals of Data Structures in C++”, Computer Scince Press, New York, 1995
3. Problem Solving and Program Design in C, 7th Edition. Jeri Hanly and Elliot Koffman, Pearson, 2013
4. Data Structures and Algorithm Analysis in C++. 4th Edition, Mark Allen Weiss, Pearson, 2014


Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Assignment 4 % 60
Final examination 1 % 40
Total
5
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 2 28
Assignments 4 6 24
General Exam Preparation 1 6 6
Total Work Load   Number of ECTS Credits 1,93333333333333 58

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Student will be able to develop an application.
2 Student will be able to produce algorithmic solutions for given problems.
3 Student will be able to use any programming language for the application that he/she develops
4 Student will be able to write reports for the applications he/she develops.
5  
6  
7  
8  

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Introduction to data structures
2 Examples of recursive algorithms
3 Presentation of the first experiment
4 Examples of multidimensional arrays
5 Presentation of the second experiment
6 Examples of stacks and queues
7 Examples of arithmetical/mathematical expressions? representation
8 Presentation of the third experiment
9 Examples of linked list applications
10 Examples of doubly linked lists
11 Presentation of the fourth experiment
12 Binary trees
13 Graphs
14 Solutions to sample problems
15 Final Exam Preparation
16 Final Exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
All 5 5 4 5 4 5 5 4 4 2 1
C1
C2
C3
C4
C5
C6
C7
C8

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://bilsis.hacettepe.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=2687580&lang=en