<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/">
	<channel>
		<title><![CDATA[MKLab - COURSES-TUTORIALS]]></title>
		<link>https://mklab.gr/</link>
		<description><![CDATA[MKLab - https://mklab.gr]]></description>
		<pubDate>Wed, 29 Jul 2026 19:20:21 +0000</pubDate>
		<generator>MyBB</generator>
		<item>
			<title><![CDATA[6.006 Introduction to Algorithms]]></title>
			<link>https://mklab.gr/showthread.php?tid=835</link>
			<pubDate>Sat, 04 Jul 2026 12:30:06 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=835</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">6.006 Introduction to Algorithms</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">The MIT OpenCourseWare 6.006: Introduction to Algorithms course is a comprehensive undergraduate introduction to the fundamental ideas behind efficient problem solving in computer science. Designed for students with prior knowledge of Python and discrete mathematics, it explores essential data structures such as dynamic arrays, heaps, balanced binary search trees, and hash tables, along with core algorithmic techniques including sorting, graph traversal, and dynamic programming.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"> The course emphasizes not only how to implement algorithms but also how to analyze their correctness and efficiency using mathematical reasoning, helping learners develop the skills needed to tackle complex computational problems. Through lectures, problem sets, quizzes, and exams, students gain a solid foundation in algorithm design and performance analysis that is valuable for software development, competitive programming, and advanced computer science studies. </span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/pages/syllabus/" target="_blank" rel="noopener" class="mycode_url">COURSE</a></span>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">6.006 Introduction to Algorithms</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">The MIT OpenCourseWare 6.006: Introduction to Algorithms course is a comprehensive undergraduate introduction to the fundamental ideas behind efficient problem solving in computer science. Designed for students with prior knowledge of Python and discrete mathematics, it explores essential data structures such as dynamic arrays, heaps, balanced binary search trees, and hash tables, along with core algorithmic techniques including sorting, graph traversal, and dynamic programming.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"> The course emphasizes not only how to implement algorithms but also how to analyze their correctness and efficiency using mathematical reasoning, helping learners develop the skills needed to tackle complex computational problems. Through lectures, problem sets, quizzes, and exams, students gain a solid foundation in algorithm design and performance analysis that is valuable for software development, competitive programming, and advanced computer science studies. </span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-spring-2020/pages/syllabus/" target="_blank" rel="noopener" class="mycode_url">COURSE</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[6.851: Advanced Data Structures [MIT]]]></title>
			<link>https://mklab.gr/showthread.php?tid=814</link>
			<pubDate>Fri, 03 Jul 2026 18:39:33 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=814</guid>
			<description><![CDATA[<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font"><span style="font-weight: bold;" class="mycode_b">6.851: Advanced Data Structures</span></span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font"><span style="font-weight: bold;" class="mycode_b">Summary</span></span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font">The <span style="font-weight: bold;" class="mycode_b">6.851: Advanced Data Structures</span> scribe notes provide a comprehensive collection of student-written lecture summaries from a graduate-level course taught by Professor Erik Demaine. Covering topics such as advanced search trees, fusion trees, suffix trees and arrays, succinct data structures, compression algorithms, cache-oblivious data structures, external-memory algorithms, and fault-tolerant data structures, the notes blend theoretical foundations with practical algorithmic techniques. </span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font">Each lecture is carefully organized to explain the motivation behind the concepts, the underlying proofs, and their real-world applications, making the collection a valuable resource for students, researchers, and anyone looking to deepen their understanding of modern data structures and algorithm design. </span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><a href="https://courses.csail.mit.edu/6.851/spring21/" target="_blank" rel="noopener" class="mycode_url">COURSE PAGE</a></span>]]></description>
			<content:encoded><![CDATA[<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font"><span style="font-weight: bold;" class="mycode_b">6.851: Advanced Data Structures</span></span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font"><span style="font-weight: bold;" class="mycode_b">Summary</span></span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font">The <span style="font-weight: bold;" class="mycode_b">6.851: Advanced Data Structures</span> scribe notes provide a comprehensive collection of student-written lecture summaries from a graduate-level course taught by Professor Erik Demaine. Covering topics such as advanced search trees, fusion trees, suffix trees and arrays, succinct data structures, compression algorithms, cache-oblivious data structures, external-memory algorithms, and fault-tolerant data structures, the notes blend theoretical foundations with practical algorithmic techniques. </span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><span style="font-family: 'Times New Roman';" class="mycode_font">Each lecture is carefully organized to explain the motivation behind the concepts, the underlying proofs, and their real-world applications, making the collection a valuable resource for students, researchers, and anyone looking to deepen their understanding of modern data structures and algorithm design. </span></span><br />
<br />
<span style="color: #000000;" class="mycode_color"><a href="https://courses.csail.mit.edu/6.851/spring21/" target="_blank" rel="noopener" class="mycode_url">COURSE PAGE</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[The Missing Semester of Your CS Education [mit]]]></title>
			<link>https://mklab.gr/showthread.php?tid=495</link>
			<pubDate>Thu, 18 Jun 2026 23:33:58 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=495</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">The Missing Semester of Your CS Education </span><br />
<span style="font-weight: bold;" class="mycode_b">by [mit]</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><span style="font-style: italic;" class="mycode_i">The Missing Semester of Your CS Education</span> is a free course created by researchers and former students at Massachusetts Institute of Technology to teach practical computing skills that are often overlooked in traditional computer science curricula.</span><br />
<span style="font-weight: bold;" class="mycode_b"> Instead of focusing on theory, it covers essential tools and workflows such as the command line, shell scripting, version control with Git, debugging, profiling, development environments, code quality, packaging software, and effective collaboration.</span><br />
<span style="font-weight: bold;" class="mycode_b"> The course aims to help students and professionals become more productive by mastering the tools they use every day, reducing repetitive work, automating tasks, and developing better software engineering habits.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://missing.csail.mit.edu/" target="_blank" rel="noopener" class="mycode_url">COURSE</a></span>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">The Missing Semester of Your CS Education </span><br />
<span style="font-weight: bold;" class="mycode_b">by [mit]</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b">Summary</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><span style="font-style: italic;" class="mycode_i">The Missing Semester of Your CS Education</span> is a free course created by researchers and former students at Massachusetts Institute of Technology to teach practical computing skills that are often overlooked in traditional computer science curricula.</span><br />
<span style="font-weight: bold;" class="mycode_b"> Instead of focusing on theory, it covers essential tools and workflows such as the command line, shell scripting, version control with Git, debugging, profiling, development environments, code quality, packaging software, and effective collaboration.</span><br />
<span style="font-weight: bold;" class="mycode_b"> The course aims to help students and professionals become more productive by mastering the tools they use every day, reducing repetitive work, automating tasks, and developing better software engineering habits.</span><br />
<br />
<span style="font-weight: bold;" class="mycode_b"><a href="https://missing.csail.mit.edu/" target="_blank" rel="noopener" class="mycode_url">COURSE</a></span>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[But what is quantum computing? [3Blue1Brown]]]></title>
			<link>https://mklab.gr/showthread.php?tid=376</link>
			<pubDate>Sun, 14 Jun 2026 21:25:51 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=376</guid>
			<description><![CDATA[<span style="font-weight: bold;" class="mycode_b">Summary </span><br />
<br />
The video <span style="font-style: italic;" class="mycode_i">“But what is quantum computing? (Grover’s Algorithm)”</span> by 3Blue1Brown explains the core ideas behind quantum computing using visual intuition rather than heavy formalism. It introduces how quantum states differ from classical bits by allowing superposition, where information is represented as probability amplitudes instead of definite 0s and 1s. The video then builds up the idea of quantum interference and shows how algorithms can manipulate these amplitudes to amplify the probability of correct answers while canceling wrong ones. This is illustrated through <span style="font-weight: bold;" class="mycode_b">Grover’s algorithm</span>, which provides a quadratic speedup for searching an unsorted database by repeatedly “rotating” the state toward the correct solution. Overall, the video emphasizes that the power of quantum computing comes not from parallel universes or brute-force checking, but from carefully engineered interference patterns in high-dimensional state spaces.<br />
<br />
<a href="https://www.youtube.com/watch?v=RQWpF2Gb-gU" target="_blank" rel="noopener" class="mycode_url"><span style="font-weight: bold;" class="mycode_b">VIDEO LECTURE</span></a>]]></description>
			<content:encoded><![CDATA[<span style="font-weight: bold;" class="mycode_b">Summary </span><br />
<br />
The video <span style="font-style: italic;" class="mycode_i">“But what is quantum computing? (Grover’s Algorithm)”</span> by 3Blue1Brown explains the core ideas behind quantum computing using visual intuition rather than heavy formalism. It introduces how quantum states differ from classical bits by allowing superposition, where information is represented as probability amplitudes instead of definite 0s and 1s. The video then builds up the idea of quantum interference and shows how algorithms can manipulate these amplitudes to amplify the probability of correct answers while canceling wrong ones. This is illustrated through <span style="font-weight: bold;" class="mycode_b">Grover’s algorithm</span>, which provides a quadratic speedup for searching an unsorted database by repeatedly “rotating” the state toward the correct solution. Overall, the video emphasizes that the power of quantum computing comes not from parallel universes or brute-force checking, but from carefully engineered interference patterns in high-dimensional state spaces.<br />
<br />
<a href="https://www.youtube.com/watch?v=RQWpF2Gb-gU" target="_blank" rel="noopener" class="mycode_url"><span style="font-weight: bold;" class="mycode_b">VIDEO LECTURE</span></a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[College Calculus with Python [freecodecamp.org]]]></title>
			<link>https://mklab.gr/showthread.php?tid=51</link>
			<pubDate>Wed, 30 Apr 2025 22:51:18 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=51</guid>
			<description><![CDATA[A course on Calculus using Python Programming from freecodecamp.org<br />
<br />
<a href="https://www.youtube.com/watch?v=VDFRpjQVaME" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/watch?v=VDFRpjQVaME</a>]]></description>
			<content:encoded><![CDATA[A course on Calculus using Python Programming from freecodecamp.org<br />
<br />
<a href="https://www.youtube.com/watch?v=VDFRpjQVaME" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/watch?v=VDFRpjQVaME</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Ελληνικά Κανάλια Προγραμματισμού ΗΥ στο Youtube]]></title>
			<link>https://mklab.gr/showthread.php?tid=45</link>
			<pubDate>Sun, 30 Mar 2025 13:59:45 +0300</pubDate>
			<dc:creator><![CDATA[<a href="https://mklab.gr/member.php?action=profile&uid=1">mklabgr</a>]]></dc:creator>
			<guid isPermaLink="false">https://mklab.gr/showthread.php?tid=45</guid>
			<description><![CDATA[Μια προσπάθεια καταγραφής ελληνικών καναλιών που ασχολούνται με τον προγραμματισμό Η/Υ . <br />
<br />
1) Το κανάλι της Καρατερζίδη Σοφία που είναι η δημιουργός του GreekCodeCamp και ασχολείται με τον προγραμματισμό σε διάφορες γλώσσες.<br />
<br />
<a href="https://www.youtube.com/c/GreekCodeCampOfficial/videos" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/c/GreekCodeCampOfficial/videos</a><br />
<br />
2) Το κανάλι του Δημήτρη Ψούνη που ασχολείται και αυτό με προγραμματισμό σε διάφορες γλώσσες πχ Python, Java, C++<br />
<br />
<a href="https://www.youtube.com/c/%CE%94%CE%B7%" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/c/%CE%94%CE%B7%</a> ... %82/videos]]></description>
			<content:encoded><![CDATA[Μια προσπάθεια καταγραφής ελληνικών καναλιών που ασχολούνται με τον προγραμματισμό Η/Υ . <br />
<br />
1) Το κανάλι της Καρατερζίδη Σοφία που είναι η δημιουργός του GreekCodeCamp και ασχολείται με τον προγραμματισμό σε διάφορες γλώσσες.<br />
<br />
<a href="https://www.youtube.com/c/GreekCodeCampOfficial/videos" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/c/GreekCodeCampOfficial/videos</a><br />
<br />
2) Το κανάλι του Δημήτρη Ψούνη που ασχολείται και αυτό με προγραμματισμό σε διάφορες γλώσσες πχ Python, Java, C++<br />
<br />
<a href="https://www.youtube.com/c/%CE%94%CE%B7%" target="_blank" rel="noopener" class="mycode_url">https://www.youtube.com/c/%CE%94%CE%B7%</a> ... %82/videos]]></content:encoded>
		</item>
	</channel>
</rss>