csi2103-01 ( 1st semester, 2020 - provapps.gmu.edu

3
Syllabus Search CSI2103-01 ( 1ST SEMESTER, 2020 ) Created Date 2019-12-31 12:31:08 Last-Modified 2020-04-01 18:07:13 Course Title DATA STRUCTURES Credit 3 Location EngHD504 Time Mon6,Wed6,7 Instructor Yang Sung-Bong Department 공과대학 컴퓨터과학과 Office D803 Telephone 2123-7239 e-mail & Office Hour [email protected], after each class Core Competencies Target Students Computer Science students who had taken Object-Oriented Programming (CSI2012) course. Course Description & Goals This is a course on the study of fundamental data structures such as lists, stacks, queues, tree/search trees, hashing, and graphs, as well as sorting algorithms. The goal is to teach students data structures so that they are able to utilize various data structures to maximize the efficiency of programs. Prerequisite You should study Java programming language before you take this course, if you are not confident in Java coding. All programming HWs should be coded with ONLY Java. Course Requirements All the lectures are conducted in English only. Grading Policy(Absolute) Midterm Exam 30% May 06(Wed) During Class Hrs Final Exam 35% June 24(Wed) During Class Hrs Assignment 30% Programming HWs (Java language ONLY) Attendance 5% Texts & References Any Data Structures Books refs: Undamentals of Data Structures, Horowitz, Sahni, Mehta Data structures and algorithms in JAVA, Goodrich and Tamassia Data Structures, Algorithms and Applications in JAVA, Sahni Instructor's Profile Prof. Sung-Bong Yang Offce : D803 email: [email protected] TA's Name & Contact Information CS Graduate Students: Syllabus in English This is a course on the study of fundamental data structures such as lists, stacks, queues, tree/search trees, hashing, and graphs. The goal is to teach students data structures so that they are able to utilize various data structures to maximize the efficiency of programs. This course is for the Undergraduate CS students who had taken Object-Oriented Programming course.

Upload: others

Post on 20-Dec-2021

3 views

Category:

Documents


0 download

TRANSCRIPT

     Syllabus Search  

 CSI2103-01 ( 1ST SEMESTER, 2020 )

Created Date 2019-12-31 12:31:08  Last-Modified 2020-04-01 18:07:13 

Course Title DATA STRUCTURES  Credit 3 

Location EngHD504  Time Mon6,Wed6,7  

Instructor Yang Sung-Bong  Department 공과대학 컴퓨터과학과 

Office D803  Telephone 2123-7239 

e-mail & Office Hour [email protected], after each class

 

Core Competencies

Target StudentsComputer Science students who had taken Object-Oriented Programming (CSI2012) course.

Course Description & Goals

This is a course on the study of fundamental data structures such as lists, stacks, queues, tree/search trees, hashing, and graphs, as well as sorting algorithms. The goal is to teach students data structures so that they are able to utilize various data structures to maximize the efficiency of programs.

PrerequisiteYou should study Java programming language before you take this course, if you are not confident in Java coding. All programming HWs should be coded with ONLY Java.

Course Requirements All the lectures are conducted in English only.

Grading Policy(Absolute)

Midterm Exam 30% May 06(Wed) During Class Hrs Final Exam 35% June 24(Wed) During Class Hrs Assignment 30% Programming HWs (Java language ONLY) Attendance 5%

Texts & References

Any Data Structures Books refs:Undamentals of Data Structures, Horowitz, Sahni, Mehta Data structures and algorithms in JAVA, Goodrich and Tamassia Data Structures, Algorithms and Applications in JAVA, Sahni

Instructor's ProfileProf. Sung-Bong Yang Offce : D803 email: [email protected]

TA's Name & ContactInformation

CS Graduate Students:

Syllabus in English

This is a course on the study of fundamental data structures such as lists, stacks, queues, tree/search trees, hashing, and graphs. The goal is to teach students data structures so that they are able to utilize various data structures to maximize the efficiency of programs.

This course is for the Undergraduate CS students who had taken Object-Oriented Programming course.

Week Period Weekly Topic & Contents Course Material Range& Assignments

Reference

1 2020-03-162020-03-22

Introduction Basic Concpets Lists 

 

(3.16.) 개강(3.19. - 3.23.) 수강신청확인 및 변경 * 비대면·온라인 강의Online/Non-face-to-faceclasses 

2 2020-03-232020-03-29

Stacks   

(3.19. - 3.23.) 수강신청확인 및 변경 * 비대면·온라인 강의Online/Non-face-to-faceclasses 

3 2020-03-302020-04-05

Queues Trees 

 * 비대면·온라인 강의Online/Non-face-to-faceclasses 

4 2020-04-062020-04-12

Trees   * 비대면·온라인 강의Online/Non-face-to-faceclasses 

5 2020-04-132020-04-19

Heaps   (4.14. - 4.17.) Coursewithdrawal period(4.15.) Tentative holiday 

6 2020-04-202020-04-26

Binary Search Trees   (4.21.) One third of thesemester ends 

7 2020-04-272020-05-03

Binary Search Trees    (4.30.) Buddha`s Birthday 

8 2020-05-042020-05-10

May 6, Wed. (mid-Term Exam) during the class hours 

 (5.5.) Children`s Day(5.6. - 5.12.) MidtermExaminations 

9 2020-05-112020-05-17

Graphs   (5.6. - 5.12.) MidtermExaminations 

10 2020-05-182020-05-24

Graphs     

11 2020-05-252020-05-31

Hashing   (5.29.) Second third of thesemester ends 

12 2020-06-012020-06-07

Sorting    (6.6.) Memorial Day 

13 2020-06-082020-06-14

Sorting Priority Queues 

   

14 2020-06-152020-06-21

Priority Queues     

15 2020-06-222020-06-27

Other advanced topics if time allows   

(6.22. - 6.27.) FinalExaminations* 2020-1학기는 15주에종강합니다.Spring 2020 is a 15-weeksemester. 

16 2020-06-222020-06-27

Final Exam, June 24 (Wed) During Class Hrs 

 

(6.22. - 6.27.) FinalExaminations* 2020-1학기는 15주에종강합니다.Spring 2020 is a 15-weeksemester. 

* Changes in Management of Academic Semester During the midterm examinations (2020.10.20. - 10.26.) and final examinations (2020.12.8. - 12.21.) period, classes or self-study should becontinued unless there is an exam scheduled during the week. * According to the University regulation section 57-2, students with disabilities can request special support related to attendance, lectures,assignments, or exams by contacting the course professor at the beginning of semester.Upon request, students can receive such support fromthe course professor or from the Center for Students with Disabilities(OSD). The following are examples of types of support available in thelectures, assignments, and exams:(However, actual support may vary depending on the course.)[Lecture]- Visual Impairment: alternative, braille, enlarged reading materials, note-taker- Physical Impairment: alternative reading materials, access to classroom, note-taker, assigned seat- Hearing Impairment: note-taker/stenographer, recording lecture- Intellectual Disability/Autism: note-taker, study mentor[Assignments and Exam]- Visual, Physical, Hearing Impairment: extra days for submission, alternative type of assignment, extended exam time, alternative type ofexam, arranging separate exam room, and proctors, note-taker- Intellectual Disability/Autism: personalized assignments, alternative type of evaluation