COMP 2233 • Final • Data Structures
Yaşar Üniversitesi COMP 2233 (Data Structures) Final sınavına hazırlık paketi.
İşlenen konular: Stack, Queue, Trees & BST, Graphs - Basics, Graphs - Shortest Path Problem, Graphs - Minimum Spanning Tree, Hashtables, Search Algorithms, Sort Algorithms.
499 TL a month, 3 instalments at no extra cost
Instructor

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.
Pass guarantee
We trust our courses. If you prepare for your exams with us and still fail the course, you can get a refund. Terms
Topics
Stack
3 topic lessons
Introduction
Array Implementation
LinkedList Implementation
Queue
3 topic lessons
Introduction
Array Implementation
LinkedList Implementation
🦄🦄 EXAM PRACTICE - PART 1 🦄🦄
18 questions
Stack 1
Stack 2
Stack 3
Stack 4
Stack 5
Stack 6
Stack 7
Queue 1
Queue 2
Queue 3
Queue 4
Queue 5
Queue 6
Queue 7
Stack / Queue 1
Stack / Queue 2
Linked List / Stack / Queue 1
Linked List / Stack / Queue 2
Trees
4 topic lessons
Tree as a Data Structure
Terminology
Binary Trees / Binary Search Trees
Implementation
Graphs - Basics
4 topic lessons
Introduction and Graph Types
Path, Cycle, Degree
Graph Representations
Example
Graphs - Shortest Path, Traversals
7 topic lessons
Dijkstra's Algorithm
Example 1
Example 2
Breadth-First Search (BFS)
Example 3
Depth-First Search (DFS)
Example 4
Graphs - Minimum Spanning Tree
5 topic lessons
Minimum Spanning Tree Problem
Prim's Algorithm
Example 1
Kruskal's Algorithm
Example 2
🦄🦄 EXAM PRACTICE - PART 2 🦄🦄
24 questions
Trees 1
Trees 2
Trees 3
Trees 4
Trees 5
Trees 6
Trees 7
Trees 8
Graph Basics
Adjacency List/Matrix
Shortest Path 1
Shortest Path 2
Shortest Path 3
Shortest Path 4
Shortest Path 5
Graph Traversals 1
Graph Traversals 2
Graph Traversals 3
Minimum Spanning Tree 1
Minimum Spanning Tree 2
Minimum Spanning Tree 3
Minimum Spanning Tree 4
Minimum Spanning Tree 5
Graphs Overall
Hashtables
9 topic lessons
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
Search Algorithms
2 topic lessons
Linear v Binary
Codes
Sort Algorithms
7 topic lessons
Why is this important?
Selection Sort
Example
Selection Sort - Code
Quick Sort
Example
Quick Sort - Code
Reviews
1 student review
Only students who have this course can review it.
Pamira Koyuncu
Bought the courseBilgisayar Mühendisliği
Buy both together
🎓 92% of Yaşar Üniversitesi students study with the whole bundle.
