CS 300 • Midterm IData Structures

Çok beklettik biliyoruz. Sonunda burdayız, üzerine koyarak hem de.

2499 TL

833 TL a month, 3 instalments at no extra cost

40 students took this course
42 past exam questions with solutions
36 topic lessons · 4 h 42 min
4.8 rating
Access for the whole term

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.

Topics

Course introduction

Time Complexity

Free

Big-O Notation

Big-Omega Notation

Big-Theta Notation

Fundamental Rules

Algorithm Analysis

Analyzing Complexity

Example

Exam-like Question

Recurrences

Example

Algorithm Analysis

Solving Recurrences

Example

Algorithm Analysis

Introduction

Singular LinkedList

Doubly LinkedList

Circular LinkedList

Exam-like Question

Stack

Array Implementation

LinkedList Implementation

Exam-like Question

Queue

Array Implementation

LinkedList Implementation

Exam-like Question

Tree as a Data Structure

Terminology

Free

Binary Trees / Binary Search Trees

Implementation

Exam-like Question

Exam-like Question

Exam-like Question

Exam-like Question

Why AVL Trees?

Height

Implementation 1

Implementation 2

Exam-like Question

Exam-like Question

Patron çıldırdı, O(1) istiyor!

Handling Collusions

Seperate Chaining

Open Addressing

Exam-like Question

Exam-like Question

Exam-like Question

Introduction

Fundamental Properties

Free

Implementation

Exam-like Question

Exam-like Question

Big-O Analysis

Big-O Analysis

Free

Time Complexity

Time Complexity

Time Complexity

Recursion

Free

Recursion

Linked List

Linked List

Stack

Stack / Queue

Stack / Queue

Linked List / Stack / Queue

Linked List / Stack / Queue

Trees / BST

Free

Trees / BST

Trees / BST

Trees / BST

Trees / BST

Trees / BST

Free

Trees / BST

Linked List / Stack / Queue / BST

AVL Trees

AVL Trees

Free

AVL Trees

AVL Trees

BST / AVL Trees

BST / AVL Trees

Hashing

Free

Hashing

Hashing

Hashing

Hashing

True/False Question

True/False Question

True/False Question

Free

True/False Question

Heaps

Heaps

Heaps

Heaps

Heaps

Free

Algorithm Complexity

Recursion 1

Recursion 2

Recursion 3

Recursion 4

Linked Lists 1

Linked Lists 2

Linked Lists 3

Linked Lists 4

Linked Lists 5

Linked Lists 6

Linked Lists 7

Array + LL + Stack 1

Array + LL + Stack 2

Stack 1

Stack 2

Stack 3

Queue 1

Queue 2

Queue 3

Trees / BST 1

Trees / BST 2

Trees / BST 3

Trees / BST 4

AVL Trees 1

AVL Trees 2

AVL Trees 3

AVL Trees 4

Hashing 1

Hashing 2

Heaps 1

Heaps 2

Reviews

4.8

3 student reviews

Only students who have this course can review it.

Ad Soyad

Bought the course

Mühendislik ve Doğa Bilimleri Programları

15 days ago

Onur Tekin

Bought the course

Bilgisayar Bilimi ve Mühendisliği

8 months ago

Efe Kaan Baydan

Bought the course

Mühendislik ve Doğa Bilimleri Programları

12 months ago

Buy both together

🎓 92% of Sabancı Üniversitesi students study with the whole bundle.

Data Structures

CS 300 • Midterm I

Data Structures

4.8(3)
2099 TL2499 TL16%
Data Structures

CS 300 • Midterm II + Final

Data Structures

4.8(3)
2099 TL2499 TL16%
799 TL off
Total:4998 TL4199 TL

Frequently asked questions about CS 300 Midterm I

Frequently asked questions about Unicourse

2499 TL
40 students took this course