CS 300 • Final • Data Structures
Çok beklettik biliyoruz.
Sonunda burdayız, üzerine koyarak hem de.
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
🎓 Sabancı Üniversitesi öğrencilerinin %92'si tüm paketi alarak çalışıyor.
CS 300 • Midterm
Data Structures
1699 TL
CS 300 • Final
Data Structures
1699 TL
Konular
Heaps - Priority Queues
Introduction
Fundamental Properties
BinaryHeap.h
Implementation - Part 1
Implementation - Part 2
Example 1
Example 2
Example 3
Disjoint Sets
What is the point?
How does it work?
Implementation
Example 1
Optimizing Union
Optimizing Find
Sorting
Why is this important?
Insertion Sort
Example 1
Insertion Sort - Code
Shell Sort
Example 2
Shell Sort - Code
Heap Sort
Example 3
Heap Sort - Code
Merge Sort
Example 4
Merge Sort - Code
Quick Sort
Example 5
Quick Sort - Code
Graphs - Part I
Introduction and Graph Types
Path, Cycle, Degree
Graph Representations
Example 1
Topological Sort
Example 2
Graphs - Part II
Dijkstra's Algorithm
Example 1
Example 2
Breadth-First Search (BFS)
Example 3
Depth-First Search (DFS)
Example 4
Classification of Arcs
Example 5
Pre/Post Order Numbers
Example 6
Graphs - Part III
Minimum Spanning Tree Problem
Prim's Algorithm
Example 1
Kruskal's Algorithm
Example 2
Algorithm Paradigms
Algorithm Paradigms
Sample Exam Problems
Hash Tables 1
Hash Tables 2
Hash Tables 3
Hash Tables 4
Heaps 1
Heaps 2
Heaps 3
Heaps 4
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
Sorting - Conceptual 10
Sorting - True/False 1
Sorting - True/False 2
Graph Basics - Conceptual 1
Graph Basics - Hand Implementation 1
Graph Basics - Hand Implementation 2
Graph Basics - Conceptual 2
Shortest Path - Hand Implementation 1
Shortest Path - Hand Implementation 2
Shortest Path - Hand Implementation 3
Shortest Path - Conceptual 1
Shortest Path - Conceptual 2
Shortest Path - Conceptual 3
Shortest Path - Conceptual 4
Shortest Path - Conceptual 5
BFS/DFS - Hand Implementation 1
BFS/DFS - Hand Implementation 2
BFS/DFS - Hand Implementation 3
BFS/DFS - Hand Implementation 4
BFS/DFS - Hand Implementation 5
BFS/DFS - Hand Implementation 6
BFS/DFS - Conceptual 1
BFS/DFS - Conceptual 2
MST - Hand Implementation 1
MST - Hand Implementation 2
MST - Hand Implementation 3
MST - Hand Implementation 4
MST - Hand Implementation 5
MST - Hand Implementation 6
MST - Conceptual 1
Graphs - Conceptual 1
Graphs - Conceptual 2
Algorithm Paradigms 1
Algorithm Paradigms 2
Algorithm Paradigms 3
FALL 24 FINAL EXAM
True/False 1
Graphs
Disjoint Sets 1
Disjoint Sets 2
Heaps
Sorting 1
True/False 2
Sorting 2
Questions From Midterm Topics
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
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
Heaps - Priority Queues
Introduction
Fundamental Properties
BinaryHeap.h
Implementation - Part 1
Implementation - Part 2
Example 1
Example 2
Example 3
Disjoint Sets
What is the point?
How does it work?
Implementation
Example 1
Optimizing Union
Optimizing Find
Sorting
Why is this important?
Insertion Sort
Example 1
Insertion Sort - Code
Shell Sort
Example 2
Shell Sort - Code
Heap Sort
Example 3
Heap Sort - Code
Merge Sort
Example 4
Merge Sort - Code
Quick Sort
Example 5
Quick Sort - Code
Graphs - Part I
Introduction and Graph Types
Path, Cycle, Degree
Graph Representations
Example 1
Topological Sort
Example 2
Graphs - Part II
Dijkstra's Algorithm
Example 1
Example 2
Breadth-First Search (BFS)
Example 3
Depth-First Search (DFS)
Example 4
Classification of Arcs
Example 5
Pre/Post Order Numbers
Example 6
Graphs - Part III
Minimum Spanning Tree Problem
Prim's Algorithm
Example 1
Kruskal's Algorithm
Example 2
Algorithm Paradigms
Algorithm Paradigms
Sample Exam Problems
Hash Tables 1
Hash Tables 2
Hash Tables 3
Hash Tables 4
Heaps 1
Heaps 2
Heaps 3
Heaps 4
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
Sorting - Conceptual 10
Sorting - True/False 1
Sorting - True/False 2
Graph Basics - Conceptual 1
Graph Basics - Hand Implementation 1
Graph Basics - Hand Implementation 2
Graph Basics - Conceptual 2
Shortest Path - Hand Implementation 1
Shortest Path - Hand Implementation 2
Shortest Path - Hand Implementation 3
Shortest Path - Conceptual 1
Shortest Path - Conceptual 2
Shortest Path - Conceptual 3
Shortest Path - Conceptual 4
Shortest Path - Conceptual 5
BFS/DFS - Hand Implementation 1
BFS/DFS - Hand Implementation 2
BFS/DFS - Hand Implementation 3
BFS/DFS - Hand Implementation 4
BFS/DFS - Hand Implementation 5
BFS/DFS - Hand Implementation 6
BFS/DFS - Conceptual 1
BFS/DFS - Conceptual 2
MST - Hand Implementation 1
MST - Hand Implementation 2
MST - Hand Implementation 3
MST - Hand Implementation 4
MST - Hand Implementation 5
MST - Hand Implementation 6
MST - Conceptual 1
Graphs - Conceptual 1
Graphs - Conceptual 2
Algorithm Paradigms 1
Algorithm Paradigms 2
Algorithm Paradigms 3
FALL 24 FINAL EXAM
True/False 1
Graphs
Disjoint Sets 1
Disjoint Sets 2
Heaps
Sorting 1
True/False 2
Sorting 2
Questions From Midterm Topics
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