COMP 202 • Midterm • Data Structures and Algorithms
Eğitmen
Ertuğrul Altun
BSCS
Marmara Üniversitesi Bilgisayar Bilimi ve Mühendisliği bölümünden 2019 yılında mezun oldum. C/C++, Java, JavaScript ve TypeScript dillerinde ileri seviye programlama yapıyorum. 2020 yılından beri Software Engineer olarak bir özel şirkette çalışmaktayım. Okuduğum süre içerisinde ve sonrasında Bilgisayar Mühendisliği alanında çeşitli konularda özel ders verdim.
Konular
Algorithm Analysis
Motivation
Big-O Notation
Big-Omega Notation
Big-Theta Notation
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Fundamental Rules
Analyzing Complexity
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Recurrences
Example
Solving Recurrences
Example
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
LinkedList
Introduction
Singular LinkedList
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Doubly LinkedList
Exam-like Question
Exam-like Question
Circular LinkedList
Exam-like Question
Exam-like Question
Stacks and Queues
Stacks
Array Implementation of Stacks
LinkedList Implementation of Stacks
Exam-like Question
Queues
Array Implementation of Queues
LinkedList Implementation of Queues
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Trees
Tree as a Data Structure
Terminology
Binary Trees / Binary Search Trees
Example
Insertion/Deletion/Traversal
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Heaps - Priority Queues
Introduction
Fundamental Properties
Example 1
Example 2
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Hashtables
Patron çıldırdı, O(1) istiyor!
Handling Collusions
Example
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Değerlendirmeler
Henüz hiç değerlendirme yok.
Sıkça Sorulan Sorular
Örneğin, Koç Üniversitesi - MATH 101 (Calculus) veya başka bir okulun benzer dersi olsun, paketlerimiz tam da o derse göre tasarlanır. Böylece nokta atışı çalışır, zaman kazanırsın.
Sınava özel videolar —konu anlatımları, çıkmış sorular ve çözümleri, özet notlar—içerir. Sınavda sıkça çıkan soruları hedefler. Eğitmenlerimiz, üniversitenin akademik takvimini takip ederek paketleri sürekli günceller. Böylece, gereksiz detaylarla vakit kaybetmeden başarını artırmaya odaklanabilirsin.
Ders İçeriği
Algorithm Analysis
Motivation
Big-O Notation
Big-Omega Notation
Big-Theta Notation
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Fundamental Rules
Analyzing Complexity
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Recurrences
Example
Solving Recurrences
Example
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
LinkedList
Introduction
Singular LinkedList
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Doubly LinkedList
Exam-like Question
Exam-like Question
Circular LinkedList
Exam-like Question
Exam-like Question
Stacks and Queues
Stacks
Array Implementation of Stacks
LinkedList Implementation of Stacks
Exam-like Question
Queues
Array Implementation of Queues
LinkedList Implementation of Queues
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Trees
Tree as a Data Structure
Terminology
Binary Trees / Binary Search Trees
Example
Insertion/Deletion/Traversal
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Heaps - Priority Queues
Introduction
Fundamental Properties
Example 1
Example 2
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question
Hashtables
Patron çıldırdı, O(1) istiyor!
Handling Collusions
Example
Exam-like Question
Exam-like Question
Exam-like Question
Exam-like Question