CMPE 242 • Midterm I • Data 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.
499 TL a month, 3 instalments at no extra cost
Instructors

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
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
Arrays in C++
4 topic lessons
Built-in Arrays
Array Properties
Example 1
Example 2
Pointers and Dynamic Memory Allocation
15 topic lessons · 3 questions
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
Static Array vs Dynamic Array
2D Static Arrays
2D Dynamic Arrays
Efficiency of Pointers
Example 3
Classes and Object Oriented Programming
13 topic lessons
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
Inheritance
9 topic lessons
Introduction
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
Template Functions/Classes
5 topic lessons
Function Overloading
Template Functions 1
Template Functions 2
Template Classes 1
Template Classes 2
Complexity Analysis
13 topic lessons
Motivation
Big-O Notation
Big-Omega Notation
Big-Theta Notation
Fundamental Rules
Analyzing Complexity
Example 1
Example 2
Example 3
Recurrences
Example 4
Solving Recurrences
Example 5
Linked Lists ÖZET!
4 topic lessons
Introduction
Singular LinkedList
Doubly LinkedList
Circular LinkedList
Linked Lists: Single - Detay
11 topic lessons
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
Linked Lists: Circular - Detay
7 topic lessons
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
Linked Lists: Doubly - Detay
8 topic lessons
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
Stack - ÖZET!
3 topic lessons
What is a Stack?
Array Implementation
LinkedList Implementation
Stack - Detay!
6 topic lessons
What is a Stack?
Stack.h
Implementation
Example 1
Example 2
Example 3
Queue - ÖZET!
3 topic lessons
Introduction
Array Implementation
LinkedList Implementation
Queue - Detay!
6 topic lessons
What is a Queue?
Queue.h
Implementation
Example 1
Example 2
Example 3
Trees and Binary Trees
18 topic lessons
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
Past Exam Problems
50 questions
Pointers
Pointers
Pointers
Pointers
Pointers
Pointers
Classes - Part 1
Classes - Part 2
Classes - Part 1
Classes - Part 2
Classes - Part 3
Classes
Classes
Classes
Classes
Classes
Inheritance
Inheritance
Inheritance
Complexity Analysis
Complexity Analysis
Complexity Analysis
Complexity Analysis
Complexity Analysis
Complexity Analysis
Complexity Analysis
Linked Lists
Linked Lists
Linked Lists
Linked List
Linked List
Linked List
Linked Lists
Linked Lists
Linked Lists
Stack / Queue
Stack / Queue
Stack / Queue
Stack / Queue
Stack / Queue
Stack / Queue
Linked List/Stack/Queue
Linked List/Stack/Queue
Linked List/Stack/Queue
Trees
Trees
Trees
Trees
Trees
Trees
Buy both together
🎓 92% of Kadir Has Üniversitesi students study with the whole bundle.
