CMPE 242 • Midterm IData Structures and Algorithms

Kadir Has Üniversitesi CMPE 242 (Data Structures and Algorithms) Midterm I sınavına hazırlık paketi.

İşlenen konular: Arrays in C++, Pointers and Dynamic Memory Allocation, Classes and Object Oriented Programming, Inheritance, Template Functions/Classes, Complexity Analysis, Linked Lists ÖZET!, Linked Lists: Single - Detay, Linked Lists: Circular - Detay, Linked Lists: Doubly - Detay, Stack - ÖZET!, Stack - Detay!, Queue - ÖZET!, Queue - Detay!, Trees and Binary Trees.

1499 TL

499 TL a month, 3 instalments at no extra cost

50 past exam questions with solutions
125 topic lessons · 11 h 24 min
Access for the whole term

Pass guarantee

Instructors

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.

Ömer Faruk Altun

Ömer Faruk Altun

Co-founder & Head of Education

2011 yılında Endüstri Mühendisliği okumak için başladığım Sabancı Üniversitesi'nden 2018 yılında Bilgisayar Mühendisi olarak mezun oldum. 13 yıldır Altun ismiyle başta Sabancı Üniversitesi olmak üzere çeşitli okullarda Endüstri ve Bilgisayar Mühendisliği alanlarında ders vermekteyim. Unicourse'ta sunduğum derslerin yanında eğitim departmanının da sorumluluğunu üstlenmekteyim.

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

Built-in Arrays

Array Properties

Example 1

Example 2

Introduction

Definition and Declaration

Assignment and Dereference

Be Careful!

Pointer of Pointers - new Keyword

Pointers with Arrays

sizeof() - malloc() - free()

delete Keyword

Pointers as Function Parameters

Pointers of Functions

Pointers of User-Defined Classes

Example 1

Example 2

Free

Static Array vs Dynamic Array

2D Static Arrays

2D Dynamic Arrays

Efficiency of Pointers

Example 3

Introduction

Topic-wide Example: Set Class

Constructors

Copy Constructors

Destructors

this Keyword

Assignment (=) Operator

Add Assignment (+=) Operator

Addition (+) Operator

Addition (+) Operator: with a Foreign Object

Add Assignment (+=) Operator: with a Foreign Object

Equality (==) Operator

Output Stream (<<) Operator

Introduction

Free

New Classes from Old Ones

Access Control Under Inheritance

Access to Private Members of Base Class

Constructors/Destructors Under Inheritance

Some Important Points

Copy Constructors Under Inheritance

Overriding

Multiple Inheritance

Function Overloading

Template Functions 1

Template Functions 2

Template Classes 1

Template Classes 2

Motivation

Free

Big-O Notation

Free

Big-Omega Notation

Big-Theta Notation

Fundamental Rules

Analyzing Complexity

Example 1

Example 2

Example 3

Recurrences

Example 4

Solving Recurrences

Example 5

Introduction

Singular LinkedList

Doubly LinkedList

Circular LinkedList

Some Background Information

What is a linkedlist?

Reminder: Structs

Constructing Linkedlists

Head and Tail Pointers

Printing a Linkedlist

Adding a Node to the End

Adding a Node in between Two Nodes (Add to a Sorted List)

Finding a Node in the List

Deleting a Node

Deleting the List

What is a Circular Linkedlist?

Constructing the List

Adding a Node to the Beginning/End

Adding a Node in between Two Nodes (Add to a Sorted List)

Counting Number of Elements

Finding a Node in the List

Deleting a Node

Constructing the List

Adding a Node to the Beginning

Adding a Node In Between two Nodes (Add to a Sorted List)

Adding a Node to End of the List

Deleting a Node from the Beginning

Deleting a Node in between Two Nodes (Deleting from a Sorted List)

Deleting a Node from the End

Finding a Node in the List

What is a Stack?

Array Implementation

LinkedList Implementation

What is a Stack?

Stack.h

Implementation

Example 1

Example 2

Example 3

Introduction

Array Implementation

LinkedList Implementation

What is a Queue?

Queue.h

Implementation

Example 1

Example 2

Example 3

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

Example 7

Pointers

Free

Pointers

Pointers

Free

Pointers

Pointers

Pointers

Free

Classes - Part 1

Classes - Part 2

Classes - Part 1

Classes - Part 2

Classes - Part 3

Classes

Classes

Classes

Free

Classes

Free

Classes

Inheritance

Free

Inheritance

Inheritance

Complexity Analysis

Free

Complexity Analysis

Complexity Analysis

Free

Complexity Analysis

Complexity Analysis

Complexity Analysis

Free

Complexity Analysis

Linked Lists

Linked Lists

Linked Lists

Free

Linked List

Linked List

Free

Linked List

Linked Lists

Linked Lists

Linked Lists

Stack / Queue

Free

Stack / Queue

Free

Stack / Queue

Stack / Queue

Stack / Queue

Stack / Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Linked List/Stack/Queue

Trees

Trees

Trees

Free

Trees

Trees

Trees

Free

Buy both together

🎓 92% of Kadir Has Üniversitesi students study with the whole bundle.

Data Structures and Algorithms

CMPE 242 • Midterm II + Final

Data Structures and Algorithms

1249 TL1499 TL17%
Data Structures and Algorithms

CMPE 242 • Midterm I

Data Structures and Algorithms

1249 TL1499 TL17%
499 TL off
Total:2998 TL2499 TL

Frequently asked questions about CMPE 242 Midterm I

Frequently asked questions about Unicourse

Pass guarantee

1499 TL