Subject

Working with Gifted Students

Course Title

Working with Gifted Students
Working with gifted students

Code

F23L3S057

Study Programme

Computer education

Organizer of the study programme (unit, institute, department or division)

Faculty of Computer Science and Engineering

Degree level (first, second, third cycle)

First Cycle

Academic year / semester

6 / Summer

Number of ECTS credits

Teacher

Ana Madevska Bogdanova

Prerequisites for enrolling in the course

Algorithms and Data Structures or Applied Algorithms and Data Structures

10.

Objectives of the course programme (competences)

Students are trained to become professors who can successfully identify students with the potential to expand their knowledge in computer science and solve algorithm-based problems, using advanced data structures and algorithms not covered by the regular curriculum. Future teachers are trained to impart foundational knowledge of the advanced program to students and to guide them in participating in national and international computer science competitions.

11.

Course content

Lectures:
1. Techniques for identifying gifted students
2. Techniques for Developing Motivation for Extracurricular Activities
with gifted students
3. Brainstorming technique for developing algorithms
4. Fundamentals of data structures and corresponding algorithms for competition tasks: (lists, trees, graphs);
5. Recursion, greedy algorithms, divide and conquer, dynamic programming
6. Types of competition tasks - mazes
7. Types of competition tasks - optimization
8. Types of competition tasks - logic games
9. Rules and regulations for participation in International Olympiads.
10. Solving contest problems
11. Introduction

Practical Classes:
1. Techniques for identifying gifted students
2. Techniques for Developing Motivation for Extracurricular Activities
with gifted students
3. Brainstorming technique for developing algorithms
4. List, tree, and graph problems adapted for high school students
5. Problems with greedy algorithms, divide-and-conquer, and dynamic programming tailored for high school students
6. Contest Tasks - Maze
7. Competition Tasks - Optimization
8. Contest Tasks - Logic Games
9. Rules and regulations for participation in International Olympiads.
10. Solving contest problems
11. Gifted students in the world

12.

Learning methods

Lectures using presentations, interactive lectures, exercises (using equipment and software packages), teamwork, case studies, guest lectures, independent preparation and defense of a project assignment and a seminar paper.

13.

Total available time

6 ECTS x 30 hours = 180 hours

14.

Distribution of available time

30 + 45 + 15 + 15 + 75 = 180 hours

15.

Forms of teaching activities

15.1.	Lectures - theoretical instruction	30 hours
15.2.	Exercises (laboratory, auditory), seminars, teamwork	45 hours

16.

Other forms of activities

16.1.	Project assignments	15 hours
16.2.	Independent assignments	15 hours
16.3.	Home study	75 hours

17.

Assessment method

17.1.	Tests	10 points
17.2.	Seminar paper / project (presentation: written and oral)	15 points
17.3.	Activities and learning	10 points
17.4.	Final exam	70 points

18.

Grading criteria (points / grade)

up to 50 points	5 (five) (F)
from 51 to 60 points	6 (six) (E)
from 61 to 70 points	7 (seven) (D)
from 71 to 80 points	8 (eight) (C)
from 81 to 90 points	9 (nine) (B)
from 91 to 100 points	10 (ten) (A)

19.

Requirement for obtaining a signature and taking the final exam

Activities 15.2 and 16.1 have been completed.

20.

Language of instruction

Macedonian and English

21.

Method for monitoring the quality of teaching

internal evaluation and survey mechanism

22.

Literature

22.1.	Required literature 1. Sandor Lehoczky, Richard Rusczyk \| The Art of Problem Solving: pt. 2 And beyond solutions manual \| AOPS Press \| 2006 2. Nicole Tetreault \| Insight Into a Bright Mind: A Neuroscientist's Personal Stories of Unique Thinking \| Gifted unlimited, LLC \| 2021 3. Emily Mofield \| Vertical Differentiation for Gifted, Advanced, and High-Potential Students \| Routledge \| 2023
22.2.	Additional literature No. Author Title Publisher Year