CMP 2003 • Final • Data Structures and Algorithms (C++)
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.
Paketi Tamamla
🎓 Bahçeşehir Üniversitesinde öğrencilerin %92'si tüm paketi alarak çalışıyor.

CMP 2003 • Final
Data Structures and Algorithms (C++)
Ertuğrul Altun
1599 TL

CMP 2003 • Midterm
Data Structures and Algorithms (C++)
Ertuğrul Altun
1599 TL
Konular
Midterm Konuları Konsept Sorular
Linked List - Conceptual 1
Linked List - Conceptual 2
Stack/Queue - Conceptual 1
Stack/Queue - Conceptual 2
Linked List/Stack/Queue - True/False 1
Linked List/Stack/Queue - True/False 2
Linked List/Stack/Queue - Conceptual 1
Linked List/Stack/Queue - Conceptual 2
Searching
Linear v Binary
Codes
Hashing
Patron çıldırdı, O(1) istiyor!
Handling Collusions
Example 1
Hashtable.h (Seperate Chaining version)
Seperate Chaining Implementation
Example 2
Hashtable.h (Open Addressing version)
Open Addressing Implementation
Example 3
Sorting
Why is this important?
Selection Sort
Example 1
Selection Sort - Code
Insertion Sort
Example 2
Insertion Sort - Code
Heap Sort
Example 4
Heap Sort - Code
Merge Sort
Example 5
Merge Sort - Code
Quick Sort
Example 6
Quick Sort - Code
Trees
Tree as a Data Structure
Terminology
How do we implement Trees?
Binary Trees / Binary Search Trees
Example 1
BST.h
Implementation - Constructors/Copying
Implementation - Destructors
Implementation - Find
Implementation - FindMin/FindMax
Implementation - Insert/Remove
Implementation - Printing
Example 2
Example 3
Example 4
Example 5
Example 6
AVL Trees
Why AVL Trees?
Height
AvlTree.h
Insertion - Part 1
Insertion - Part 2
Insertion - Part 3
Remove
Example 1
Example 2
B-Trees
What is it?
Properties
Example 1
Searching
Insertion
Example 2
Deletion - Case I
Deletion - Case II - III
Example 3
Sample Exam Questions
Searching - Hand Implementation
Searching - Conceptual
Hashing - Hand Implementation 1
Hashing - Hand Implementation 2
Hashing - Hand Implementation 3
Hashing - Coding
Sorting - Hand Implementation 1
Sorting - Hand Implementation 2
Sorting - Hand Implementation 3
Sorting - Hand Implementation 4
Sorting - Hand Implementation 5
Sorting - Hand Implementation 6
Sorting - Hand Implementation 7
Sorting - Hand Implementation 8
Sorting - Hand Implementation 9
Sorting - Hand Implementation 10
Sorting - Conceptual 1
Sorting - Conceptual 2
Sorting - Conceptual 3
Sorting - Conceptual 4
Sorting - Conceptual 5
Sorting - Conceptual 6
Sorting - Conceptual 7
Sorting - Conceptual 8
Sorting - Conceptual 9
Trees - Hand Implementation 1
Trees - Hand Implementation 2
Trees - Hand Implementation 3
Trees - Coding 1
Trees - Coding 2
Trees - Coding 3
AVL Trees - Hand Implementation 1
AVL Trees - Hand Implementation 2
AVL Trees - Conceptual
AVL Trees - Coding
B-Trees - True/False
B-Trees - Hand Implementation 1
B-Trees - Hand Implementation 2
Değerlendirmeler
Ders İçeriği
Midterm Konuları Konsept Sorular
Linked List - Conceptual 1
Linked List - Conceptual 2
Stack/Queue - Conceptual 1
Stack/Queue - Conceptual 2
Linked List/Stack/Queue - True/False 1
Linked List/Stack/Queue - True/False 2
Linked List/Stack/Queue - Conceptual 1
Linked List/Stack/Queue - Conceptual 2
Searching
Linear v Binary
Codes
Hashing
Patron çıldırdı, O(1) istiyor!
Handling Collusions
Example 1
Hashtable.h (Seperate Chaining version)
Seperate Chaining Implementation
Example 2
Hashtable.h (Open Addressing version)
Open Addressing Implementation
Example 3
Sorting
Why is this important?
Selection Sort
Example 1
Selection Sort - Code
Insertion Sort
Example 2
Insertion Sort - Code
Heap Sort
Example 4
Heap Sort - Code
Merge Sort
Example 5
Merge Sort - Code
Quick Sort
Example 6
Quick Sort - Code
Trees
Tree as a Data Structure
Terminology
How do we implement Trees?
Binary Trees / Binary Search Trees
Example 1
BST.h
Implementation - Constructors/Copying
Implementation - Destructors
Implementation - Find
Implementation - FindMin/FindMax
Implementation - Insert/Remove
Implementation - Printing
Example 2
Example 3
Example 4
Example 5
Example 6
AVL Trees
Why AVL Trees?
Height
AvlTree.h
Insertion - Part 1
Insertion - Part 2
Insertion - Part 3
Remove
Example 1
Example 2
B-Trees
What is it?
Properties
Example 1
Searching
Insertion
Example 2
Deletion - Case I
Deletion - Case II - III
Example 3
Sample Exam Questions
Searching - Hand Implementation
Searching - Conceptual
Hashing - Hand Implementation 1
Hashing - Hand Implementation 2
Hashing - Hand Implementation 3
Hashing - Coding
Sorting - Hand Implementation 1
Sorting - Hand Implementation 2
Sorting - Hand Implementation 3
Sorting - Hand Implementation 4
Sorting - Hand Implementation 5
Sorting - Hand Implementation 6
Sorting - Hand Implementation 7
Sorting - Hand Implementation 8
Sorting - Hand Implementation 9
Sorting - Hand Implementation 10
Sorting - Conceptual 1
Sorting - Conceptual 2
Sorting - Conceptual 3
Sorting - Conceptual 4
Sorting - Conceptual 5
Sorting - Conceptual 6
Sorting - Conceptual 7
Sorting - Conceptual 8
Sorting - Conceptual 9
Trees - Hand Implementation 1
Trees - Hand Implementation 2
Trees - Hand Implementation 3
Trees - Coding 1
Trees - Coding 2
Trees - Coding 3
AVL Trees - Hand Implementation 1
AVL Trees - Hand Implementation 2
AVL Trees - Conceptual
AVL Trees - Coding
B-Trees - True/False
B-Trees - Hand Implementation 1
B-Trees - Hand Implementation 2
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.