BSc: Data Structures Algorithms - Revision history

R.sirgalina at 12:49, 18 August 2022

2022-08-18T12:49:49Z

← Older revision		Revision as of 12:49, 18 August 2022
Line 122:		Line 122:
	== Activities and Teaching Methods ==		== Activities and Teaching Methods ==
	{\| class="wikitable"		{\| class="wikitable"
−	\|+ ~~Activities~~ within each section	+	\|+ Teaching and Learning Methods within each section
	\|-		\|-
−	! ~~Learning~~ ~~Activities~~ !! Section 1 !! Section 2 !! Section 3	+	! Teaching Techniques !! Section 1 !! Section 2 !! Section 3
	\|-		\|-
	\| Development of individual parts of software product code \|\| 1 \|\| 1 \|\| 1		\| Development of individual parts of software product code \|\| 1 \|\| 1 \|\| 1
Line 135:		Line 135:
	\|-		\|-
	\| Discussions \|\| 1 \|\| 1 \|\| 1		\| Discussions \|\| 1 \|\| 1 \|\| 1
		+	\|}
		+	{\| class="wikitable"
		+	\|+ Activities within each section
		+	\|-
		+	! Learning Activities !! Section 1 !! Section 2 !! Section 3
		+	\|-
		+	\| Question \|\| 0 \|\| 1 \|\| 0
	\|}		\|}
	== Formative Assessment and Course Activities ==		== Formative Assessment and Course Activities ==

N.askarbekuly at 10:24, 18 July 2022

2022-07-18T10:24:44Z

← Older revision		Revision as of 10:24, 18 July 2022
Line 6:		Line 6:

	== Short Description ==		== Short Description ==
		⚫	This course provides an intensive treatment of a cross-section of the key elements of algorithms and data-structures, with an emphasis on implementing them in modern programming environments, and using them to solve real-world problems. The course will begin with the fundamentals of searching, sorting, lists, stacks, and queues, but will quickly build to cover more advanced topics, including trees, graphs, and algorithmic strategies. It will also cover the analysis of the performance and tractability of algorithms and will build on the concept of Abstract Data Types. A key focus of the course is on effective implementation and good design principles.
⚫	This course ~~covers~~ the following concepts: Algorithms; Algorithm Analysis; Algorithmic Strategies; Data Structures.

	== Prerequisites ==		== Prerequisites ==
Line 47:		Line 47:

	=== What is the main purpose of this course? ===		=== What is the main purpose of this course? ===
		⚫	This course helps you master the following concepts: Algorithms; Algorithm Analysis; Algorithmic Strategies; Data Structures.
⚫	This course provides an intensive treatment of a cross-section of the key elements of algorithms and data-structures, with an emphasis on implementing them in modern programming environments, and using them to solve real-world problems. The course will begin with the fundamentals of searching, sorting, lists, stacks, and queues, but will quickly build to cover more advanced topics, including trees, graphs, and algorithmic strategies. It will also cover the analysis of the performance and tractability of algorithms and will build on the concept of Abstract Data Types. A key focus of the course is on effective implementation and good design principles.

	=== ILOs defined at three levels ===		=== ILOs defined at three levels ===

R.sirgalina at 09:57, 12 July 2022

2022-07-12T09:57:11Z

Show changes

M.petrishchev at 12:51, 26 April 2022

2022-04-26T12:51:51Z

← Older revision		Revision as of 12:51, 26 April 2022
Line 25:		Line 25:
	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 - Logic and Discrete Mathematics]		* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 - Logic and Discrete Mathematics]

−	=== Course Objectives Based on Bloom’s Taxonomy ===	+	== Course Objectives Based on Bloom’s Taxonomy ==

−	==== - What should a student remember at the end of the course? ====	+	==== What should a student remember at the end of the course? ====

	By the end of the course, the students should be able to recognize and define		By the end of the course, the students should be able to recognize and define
Line 38:		Line 38:
	* Amortized Analysis		* Amortized Analysis

−	==== - 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? ====

	By the end of the course, the students should be able to describe and explain (with examples)		By the end of the course, the students should be able to describe and explain (with examples)
Line 49:		Line 49:
	* Graphs, their properties, and related algorithms		* Graphs, their properties, and related algorithms

−	==== - What should a student be able to apply at the end of the course? ====	+	==== What should a student be able to apply at the end of the course? ====

	By the end of the course, the students should be able to apply		By the end of the course, the students should be able to apply

R.akhmetzyanov: /* Prerequisites */

2022-04-21T08:53:39Z

Prerequisites

← Older revision		Revision as of 08:53, 21 April 2022
Line 21:		Line 21:
	What the student must know to take the course		What the student must know to take the course

−	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgramming CSE101 Introduction to Programming]: OOP, Pointers, and Functional Programming	+	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgramming CSE101 - Introduction to Programming]: OOP, Pointers, and Functional Programming
−	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]	+	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 - Mathematical Analysis I]
−	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]	+	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 - Logic and Discrete Mathematics]

	=== Course Objectives Based on Bloom’s Taxonomy ===		=== Course Objectives Based on Bloom’s Taxonomy ===

M.petrishchev: M.petrishchev moved page BSc:DataStructuresAlgorithms to BSc: Data Structures Algorithms

2022-04-18T08:42:36Z

M.petrishchev moved page BSc:DataStructuresAlgorithms to BSc: Data Structures Algorithms

← Older revision	Revision as of 08:42, 18 April 2022
(No difference)

N.askarbekuly at 08:27, 1 April 2022

2022-04-01T08:27:30Z

← Older revision		Revision as of 08:27, 1 April 2022
Line 21:		Line 21:
	What the student must know to take the course		What the student must know to take the course

−	* [https://eduwiki.innopolis.university/index.php/BSc:~~IntroductionToProgrammingI.F21~~ CSE101 Introduction to Programming]: OOP, Pointers, and Functional Programming	+	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgramming CSE101 Introduction to Programming]: OOP, Pointers, and Functional Programming
	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]		* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]
	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]		* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]

N.askarbekuly at 08:23, 1 April 2022

2022-04-01T08:23:17Z

← Older revision		Revision as of 08:23, 1 April 2022
Line 21:		Line 21:
	What the student must know to take the course		What the student must know to take the course

−	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 CSE101 Introduction to Programming] ~~Topics~~	+	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 CSE101 Introduction to Programming]: OOP, Pointers, and Functional Programming
	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]		* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]
	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]		* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]

N.askarbekuly at 08:22, 1 April 2022

2022-04-01T08:22:11Z

← Older revision		Revision as of 08:22, 1 April 2022
Line 19:		Line 19:
	== Prerequisites ==		== Prerequisites ==

		+	What the student must know to take the course
⚫	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 CSE101 Introduction to Programming]
		+
		⚫	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 CSE101 Introduction to Programming] Topics
	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]		* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]
	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]		* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]

N.askarbekuly at 08:21, 1 April 2022

2022-04-01T08:21:08Z

← Older revision		Revision as of 08:21, 1 April 2022
Line 19:		Line 19:
	== Prerequisites ==		== Prerequisites ==

−	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 Introduction to Programming]	+	* [https://eduwiki.innopolis.university/index.php/BSc:IntroductionToProgrammingI.F21 CSE101 Introduction to Programming]
−	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 Mathematical Analysis I]	+	* [https://eduwiki.innopolis.university/index.php/BSc:MathematicalAnalysisI.F21 CSE201 Mathematical Analysis I]
		+	* [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 Logic and Discrete Mathematics]
−	*

	=== Course Objectives Based on Bloom’s Taxonomy ===		=== Course Objectives Based on Bloom’s Taxonomy ===