1 / 13

Teaching Discrete Mathematics and Algorithms & Data Structures Online

G.Mirkowska PJIIT. Teaching Discrete Mathematics and Algorithms & Data Structures Online. Discrete Mathematics course. Discrete Mathematics is a fundamental part of mathematical education for informatitions. It play an important role in Computer Science.

lotta
Download Presentation

Teaching Discrete Mathematics and Algorithms & Data Structures Online

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. G.Mirkowska PJIIT Teaching Discrete Mathematics and Algorithms & Data Structures Online Teaching MAD@ASDonline

  2. Teaching MAD@ASDonline Discrete Mathematics course Discrete Mathematics is a fundamental part of mathematical education for informatitions. It play an important role in Computer Science. The goal of the lecture is to introduce several fundamental notions and tools: functions, relations, graphs, models, satisfiability, induction etc. These notions are key components not only in theoretical computer science, but also in practical computing.

  3. Teaching MAD@ASDonline DM Aims The course is designed to: give a general knowledge about the area of discrete mathematics, more in-depth knowledge of selected topics, help students to understand abstract notions, introduce the methods of proving in mathematics and in computer science.

  4. Teaching MAD@ASDonline Learning outcomes After having followed this course, students should understand the basic definitions and concepts, have knowledge of the basic techniques and know how to apply them, be able to understand new situations and concepts, and relate them to existing knowledge; be able to model actual situations in a mathematical way.

  5. Teaching MAD@ASDonline DM - Topics covered Algebra of sets Graphs, basic notions Functions Relations (algebra of relations, orderings, equivalence ) Elements of classical logic Induction and recursion Combinatorics Elements of discrete probability

  6. Teaching MAD@ASDonline Algorithms and Data Structures course This course is an introduction to the design & analysis of wide variety of algorithms. The topic is often called `Algorithmics'. Emphasis is put on specification, matching the appropriate data structures and algorithms to application problems, correctness, complexity analysis.

  7. Teaching MAD@ASDonline ADS - Course objectives Study efficient algorithms for a number of fundamental problems, learn techniques for designing algorithms, learn fundamental data structures and how to use them in appropriate way, prove software correctness, analyze running time of algorithms.

  8. Teaching MAD@ASDonline Learning outcomes be able to develop efficient algorithms for simple tasks, be able to specify algorithms and data structures, be able to verify correctness of simple algorithms, understand the concepts of time and space complexity, know several representations of data structures and know how and when to use them, know and understand the idea of different methods of constructing algorithms, understand the notion of tractable and intractable problems.

  9. Teaching MAD@ASDonline ADS – Topics covered Preliminaries, specification, correctness, complexity Searching and Sorting algorithms Data structures (specification, implementation) Tables, stacks, queues Trees BST, AVL, Heap Dictionaries, Hash tables Priority queues, Heap Find-Union structure

  10. Teaching MAD@ASDonline ASD – Topics covered Algorithms on graphs Dijkstra, Kruskal, Prim, Huffman, etc. Methods of constructing algorithms Divide and conquer Dynamic programming Greedy strategies Algorithms in geometry Hard problems

  11. Teaching MAD@ASDonline Lectures Details The courses were divided on 15 lectures. Each lecture has 5-7 short sections. Pictures Questions @ Answers Problems Examples Presentations .ppt The last section is devoted to exercises. Each lecture is supported by a set of questions. lecture presentation Quiz aplet sort. aplet heap

  12. Teaching MAD@ASDonline DM Week schedule One lecture per week Test for 2-3 days (evaluated) usually 5 questions = 5 points many possible answers Homework (evaluated in iterative process) usually two problems the solutions of which should be written with explanation and sent to the theacher. homework tests solving reading lecture M T W T F S Su M T W T F S Su solve implement write documentation

  13. Teaching MAD@ASDonline Evaluation -> Conclusion Half of the total number of points allows a student to be accepted for the final exam. exams 40 points accepted 20/40 It is a hard work to study by internet but this work gives satisfaction both to students and teachers

More Related