BSc:PhilosophyI - Revision history

M.petrishchev: M.petrishchev moved page BSc:PhilosophyI.F21 to BSc:PhilosophyI

2022-04-03T13:41:04Z

M.petrishchev moved page BSc:PhilosophyI.F21 to BSc:PhilosophyI

← Older revision	Revision as of 13:41, 3 April 2022
(No difference)

N.askarbekuly: Replaced content with "[https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics Logic and Discrete Mathematics]"

2022-04-01T08:18:05Z

Replaced content with "[https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics Logic and Discrete Mathematics]"

Show changes

R.sirgalina: /* Typical questions for seminar classes (labs) within this section */

2022-02-09T13:17:52Z

Typical questions for seminar classes (labs) within this section

← Older revision		Revision as of 13:17, 9 February 2022
Line 441:		Line 441:
	#Dijkstra’s algorithm		#Dijkstra’s algorithm
	#Maximum flow problem		#Maximum flow problem
−

	=== Test questions for final assessment in this section ===		=== Test questions for final assessment in this section ===

R.sirgalina: /* Typical questions for ongoing performance evaluation within this section */

2022-02-09T13:17:44Z

Typical questions for ongoing performance evaluation within this section

← Older revision		Revision as of 13:17, 9 February 2022
Line 433:		Line 433:
	#Why do we consider weighted graphs?		#Why do we consider weighted graphs?
	#What practical problems are solved using Dijkstra's algorithm?		#What practical problems are solved using Dijkstra's algorithm?
−	#What is the maximum flow problem?	+	#What is the maximum flow problem?
−

	=== Typical questions for seminar classes (labs) within this section ===		=== Typical questions for seminar classes (labs) within this section ===

R.sirgalina: /* What should a student be able to apply at the end of the course? */

2022-02-09T13:15:44Z

What should a student be able to apply at the end of the course?

← Older revision		Revision as of 13:15, 9 February 2022
Line 59:		Line 59:

	By the end of the course, the students should be able to apply the content of this course in all areas of their academic study but also in their working life, with special reference to the following disciplines:		By the end of the course, the students should be able to apply the content of this course in all areas of their academic study but also in their working life, with special reference to the following disciplines:
−
−
	*computer science		*computer science
	*engineering		*engineering

R.sirgalina: /* Course characteristics */

2022-02-09T13:15:23Z

Course characteristics

← Older revision		Revision as of 13:15, 9 February 2022
Line 12:		Line 12:

	The second part of the is designed for students to teach them basic notions of graph theory, discrete optimization and dynamic programming. This part will give practical experience with basic algorithms in discrete mathematics.		The second part of the is designed for students to teach them basic notions of graph theory, discrete optimization and dynamic programming. This part will give practical experience with basic algorithms in discrete mathematics.
−

	=== Key concepts of the class ===		=== Key concepts of the class ===
Line 24:		Line 23:
	*Planar Graphs		*Planar Graphs
	*Algorithms on Graphs		*Algorithms on Graphs
−

	=== What is the purpose of this course? ===		=== What is the purpose of this course? ===
Line 31:		Line 29:

	The Discrete Math part of the course introduces students to the basic concepts of structuring algorithms through graph theory. This gives students the skills of deep algorithmic thinking. Thus, the successful completion of the course by students will give them the skills for further deep mastering of computer science courses.		The Discrete Math part of the course introduces students to the basic concepts of structuring algorithms through graph theory. This gives students the skills of deep algorithmic thinking. Thus, the successful completion of the course by students will give them the skills for further deep mastering of computer science courses.
−

	=== Course Objectives Based on Bloom’s Taxonomy ===		=== Course Objectives Based on Bloom’s Taxonomy ===
Line 45:		Line 42:
	*how to use Dijkstra’s algorithm		*how to use Dijkstra’s algorithm
	*how to solve maximum flow problem		*how to solve maximum flow problem
−

	=== What should a student be able to understand at the end of the course? ===		=== What should a student be able to understand at the end of the course? ===

N.askarbekuly at 06:42, 2 December 2021

2021-12-02T06:42:11Z

← Older revision		Revision as of 06:42, 2 December 2021
Line 1:		Line 1:
	= Philosophy 1: Logic and Discrete Mathematics =		= Philosophy 1: Logic and Discrete Mathematics =

−	* <span>'''Course name:'''</span> Philosophy 1: Logic and Discrete ~~Mathematic~~	+	* <span>'''Course name:'''</span> Philosophy 1: Logic and Discrete Mathematics
	* <span>'''Course number:'''</span> n/a		* <span>'''Course number:'''</span> n/a
	* <span>'''Subject area:'''</span> n/a		* <span>'''Subject area:'''</span> n/a

N.askarbekuly at 06:41, 2 December 2021

2021-12-02T06:41:53Z

← Older revision		Revision as of 06:41, 2 December 2021
Line 1:		Line 1:
−	= Philosophy 1: Logic and Discrete ~~Mathematic~~ =	+	= Philosophy 1: Logic and Discrete Mathematics =

	* <span>'''Course name:'''</span> Philosophy 1: Logic and Discrete Mathematic		* <span>'''Course name:'''</span> Philosophy 1: Logic and Discrete Mathematic

I.konyukhov: I.konyukhov moved page BSc:PhilosophyI Fall 2020 to BSc:PhilosophyI.F21

2021-11-07T09:15:53Z

I.konyukhov moved page BSc:PhilosophyI Fall 2020 to BSc:PhilosophyI.F21

← Older revision	Revision as of 09:15, 7 November 2021
(No difference)

10.90.136.10: /* What forms of evaluation were used to test students’ performance in this section? */

2021-08-16T09:41:58Z

What forms of evaluation were used to test students’ performance in this section?

← Older revision		Revision as of 09:41, 16 August 2021
Line 403:		Line 403:
	=== What forms of evaluation were used to test students’ performance in this section? ===		=== What forms of evaluation were used to test students’ performance in this section? ===

−	<div class="tabular">
−
−	<span>\|a\|c\|</span> & '''Yes/No'''<br />
−	Development of individual parts of software product code & 0<br />
−	Homework and group projects & 1<br />
−	Midterm evaluation & 0<br />
−	Testing (written or computer based) & 1<br />
−	Reports & 0<br />
−	Essays & 0<br />
−	Oral polls & 1<br />
−	Discussions & 1<br />
−
−	</div>

	{\|		{\|
Line 429:		Line 416:
	\|-		\|-
	\| Midterm evaluation		\| Midterm evaluation
−	\|align="center"\| 1	+	\|align="center"\| 0
	\|-		\|-
	\| Testing (written or computer based)		\| Testing (written or computer based)
−	\|align="center"\| 0	+	\|align="center"\| 1
	\|-		\|-
	\| Reports		\| Reports
Line 446:		Line 433:
	\|align="center"\| 1		\|align="center"\| 1
	\|}		\|}
−

	=== Typical questions for ongoing performance evaluation within this section ===		=== Typical questions for ongoing performance evaluation within this section ===