Download Algorithms and Data Structures with Selected Issues of Databases

Code ......
Course item: .....
1. INFORMATION ABOUT THE COURSE
A. Basic information
Name of course
Study level
Unit running the study
programme
Study programme
Speciality
Name of teacher (s) and
his academic degree
Introductory courses
Prerequisites
Algorithms and Data Structures with Selected Issues of Databases
First degree
Faculty of Telecommunication, Computer Science and Electrical
Engineering
Electronics and Telecommunications
Jaroslaw Zdrojewski, PhD
Fundamentals of Relational Database
No prerequisites
B. Semester/week schedule of classes
Semester
Lectures
winter or
summer
15
Classes
Laboratories
Project
Seminars
15
Field
exercises
ECTS
8
2. EFFECTS OF EDUCATION (acc. to National Qualifications Framework)
Knowledge
Skills
Competences
on successful completion of the course student is supposed to: describe the
basic sorting and searching algorithms. Will be able to define algorithm
design paradigm based on multi-branched recursion: divide and conquer.
Student will have the knowledge to the discussion of the complexity of the
algorithms, will be able to explain the concept of a graph and minimum
spanning tree. It will also have the skills to create queries in SQL
on successful completion of the course student is supposed to: characterize
the sorting and searching algorithms, to analyse the performance of
algorithms and save them in the desired form, to solve problems, which
selects a suitable method of data search, to create and describe a relational
database, to write basic SQL queries as well as complex
on successful completion of the course student is supposed to: work in a
team creating relational databases, analyse the performance of algorithms
will be able to implement the algorithms presented in either the flowchart as
well as a list of steps. It will have the skills to develop algorithms for searching
for alphanumeric data in the databases
3. TEACHING METHODS
multimedia lecture, lab
4. METHODS OF EXAMINATION
written exam at the end of lecture, oral reply at the end of lab
5. SCOPE
Lectures
Basic sorting algorithms (bubble, by inserting, fast, by choice, haystacks,
merge) and searches (of maximum / minimum, binary search in the sorted
collection.) Basic methods of algorithms: greedy and "divide and conquer".
Understanding the complexity of certain algorithms (time, memory,
computing). Discussion of the concept graph and minimum spanning tree.
Presentation of algorithms: Dijkstra, Bellman-Ford, Kruskal and Prima. A
Laboratories
revision about the basics of relational databases. Basics of SQL queries.
Implementation of the lecture discussed algorithms. The use of different data
structures: one-dimensional and multidimensional arrays, vectors, and
containers. Creating different queues: FIFO, LIFO cyclic and simple and use
them in algorithms. Implementation of structures such as list, stack, heap,
tree and graph. The syntax of SQL queries. Create a query to an existing
database. The use of sorting and searching algorithms in an existing
database
6. LITERATURE
Basic literature
Supplementary
literature
Ellis Horowitz, Sartaj Sahni ,Susan Anderson-Freed, 2007. Fundamentals of
Data Structures in C, Silicon Press Summit
Zbigniew Michalewicz, 1996. Genetic algorithms + data structures. Springer