COMP 2233 • FinalData 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.

1499 TL

499 TL a month, 3 instalments at no extra cost

42 past exam questions with solutions
44 topic lessons · 6 h 23 min
5.0 rating
Access for the whole term

Pass guarantee

Instructor

Ertuğrul Altun

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

Course introduction

Introduction

Array Implementation

LinkedList Implementation

Introduction

Array Implementation

LinkedList Implementation

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

Tree as a Data Structure

Terminology

Binary Trees / Binary Search Trees

Implementation

Introduction and Graph Types

Free

Path, Cycle, Degree

Graph Representations

Example

Dijkstra's Algorithm

Example 1

Example 2

Breadth-First Search (BFS)

Example 3

Depth-First Search (DFS)

Example 4

Minimum Spanning Tree Problem

Prim's Algorithm

Example 1

Kruskal's Algorithm

Example 2

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

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

Linear v Binary

Codes

Why is this important?

Selection Sort

Example

Selection Sort - Code

Quick Sort

Example

Quick Sort - Code

Reviews

5

1 student review

Only students who have this course can review it.

Pamira Koyuncu

Bought the course

Bilgisayar Mühendisliği

23 days ago

Buy both together

🎓 92% of Yaşar Üniversitesi students study with the whole bundle.

Data Structures

COMP 2233 • Final

Data Structures

5.0(1)
1249 TL1499 TL17%
Data Structures

COMP 2233 • Midterm

Data Structures

5.0(1)
1249 TL1499 TL17%
499 TL off
Total:2998 TL2499 TL

Frequently asked questions about COMP 2233 Final

Frequently asked questions about Unicourse

Pass guarantee

1499 TL