COMP 2233 • Midterm • Data Structures
Yaşar Üniversitesi COMP 2233 (Data Structures) Midterm sınavına hazırlık paketi.
İşlenen konular: Arrays in C++, Vectors in C++, Pointers, Linked Lists, Circular Linked Lists, Doubly Linked Lists, Algorithm Analysis.
Eğitmen
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.
Geçme Garantisi
Derslerimize güveniyoruz. Olur da sınavlarına bizimle hazırlandığın halde dersten kalırsan, iade alabilirsin. Koşullar
Konular
C++ Intro with Questions
8 soru
Basics
Basics
Conditional Statements
Conditional Statements
Loops
Loops
Functions
Functions
Arrays in C++
5 konu anlatımı
Motivation
Built-in Arrays
Array Properties
Example 1
Example 2
Vectors in C++
7 konu anlatımı
Vectors
Defining a Vector
Adding/Removing Elements
Example 3
Example 4
Example 5
Example 6
Pointers
11 konu anlatımı
Introduction
Definition and Decleration
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
Linked Lists
11 konu anlatımı
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
Circular Linked Lists
7 konu anlatımı
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
Doubly Linked Lists
8 konu anlatımı
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
Algorithm Analysis
13 konu anlatımı · 6 soru
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
Exam Like Question 1
Exam Like Question 4
Exam Like Question 5
Exam Like Question 6
Exam Like Question 8
Exam Like Question 9
🦄 🦄 Exam Practice: Sınav Provası I 🦄 🦄
9 soru
C++ Intro
Arrays
Vectors
Pointers
Pointers
Single Linked List
Circular Linked List
Doubly Linked List
Algorithm Analysis
🦄 🦄 Exam Practice: Sınav Provası II 🦄 🦄
9 soru
C++ Intro
Arrays
Pointers
Pointers
Linked List
Single Linked List
Circular Linked List
Doubly Linked List - Two-Dimensional
Algorithm Analysis
🦄 🦄 Exam Practice: Sınav Provası III 🦄 🦄
9 soru
C++ Intro
Arrays
Pointers
Pointers
Algorithm Analysis
Linked List
Single Linked List - Two-Dimensional
Circular Linked List
Doubly Linked List
🦄 🦄 Exam Practice: Sınav Provası IV 🦄 🦄
9 soru
C++ Intro
Arrays
Vectors
Pointers
Pointers
Single Linked List - Two-Dimensional
Single Linked List
Doubly Linked List
Algorithm Analysis
Paketi Tamamla
🎓 Yaşar Üniversitesi öğrencilerinin %92'si tüm paketi alarak çalışıyor.
COMP 2233 • Final
Data Structures
1099 TL
COMP 2233 • Midterm
Data Structures
1099 TL