Algorithms and Data Structures

General data

Course ID:	0600-IS1-2ASD#a
Erasmus code / ISCED:	11.101 The subject classification code consists of three to five digits, where the first three represent the classification of the discipline according to the Discipline code list applicable to the Socrates/Erasmus program, the fourth (usually 0) - possible further specification of discipline information, the fifth - the degree of subject determined based on the year of study for which the subject is intended. / (0541) Mathematics The ISCED (International Standard Classification of Education) code has been designed by UNESCO.
Course title:	Algorithms and Data Structures
Name in Polish:	Algorithms and Data Structures
Organizational unit:	(in Polish) Instytut Informatyki.
Course groups:
ECTS credit allocation (and other scores):	(not available) Basic information on ECTS credits allocation principles: the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS; the student’s weekly hourly workload is 45 h; 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes; weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS; work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load. view allocation of credits
Language:	English
Type of course:	obligatory courses
Requirements:	Elements of Logic and Set Theory 0600-IS1-1PLTM Introduction to Structured Programming 0600-IS1-1PPS#a Mathematical Analysis 1 0600-IS1-1AM1
Prerequisites:	Introduction to Object-Oriented Programming 0600-IS1-1WPO#a
Short description:	The aim of the course is to familiarize students with the basic data structures (lists, stacks, queues, hash tables, trees, graphs), algorithms (graph algorithms, pattern matching in strings) and differnt methods of their design (“devide and concuer”, dynamic programming, greedy methods) and also estimation of their complexity.
Full description:	Course profile: General Academic Form of study: Full-time studies Course type: Obligatory Year/semester of study: 2 / 3 Prerequisites (sequential system of courses and exams): Items introducing: Mathematical analysis 1, Elements of Logic and Set Theory, Introduction to Structural Programming, Introduction to Object-Oriented Programming, Lecture: 30 Exercise classes: 30 Teaching methods: Lecture, exercises ECTS credits: 5 Balance of student workload: Class attendance: - lecture 30h - exercise classes: 30h Course preparation: - lecture 15h - exercise classes: 15h Literature study: 5h Reports, homeworks: 10h Preparation for tests: 8h Preparation for the exam: 15h Exam duration: 2h Individual consultation with the teacher: 3h Student workload: Direct interaction with the teacher: 65, 2 ECTS Practical exercises: 45, 2 ECTS
Bibliography:	Bibliography: T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, „Introduction to Algorithms”, MIT, 1994
Learning outcomes:	Learning outcomes: The student knows the basic notions and methods of algorithm design and analysis. K_W03 The student knows the basic data structures and selected algoritms using them. K_W03 The student can estimate the complexity of simple algorithm K_U06 The student can applay and analise the selected algorithms that base on the method “devide and concuer” in the field of sorting and searching. K_U06, K_U08 The student can perform basic dictionary operations on the selected data structures. K_U06 The student can applay the selected pattern matching algorithm. K_U06, K_U08 The student understands the necessity of permanent studying. K_K02
Assessment methods and assessment criteria:	Form of assessment: written test

This course is not currently offered.

Course descriptions are protected by copyright.
Copyright by University of Bialystok.