DFC30233 - DATA STRUCTURES - DDT3A SESI 1 2023 2024 by Noramirah `Atiqah Durahim

2023-08-30 03:50:20 UTC

Hye, nama saya intan 🦋 orangnye berasal dari ipoh, xpi semua orang tahu saya area tanjong rambutan 🍒 walaupun saya tak faham course yg sya ambekni, xpi allhamdulilah rezeki sya dpat jga pointer saya ❤️ saya suka kawan" polimas semua baik" ❤️ terutama kelas DDT3A ❤️ last but not least FIGHTING!!!!! 🤍💕

2023-08-30 03:55:04 UTC

Assalamualaikum! Nama saya Zulfa Husna, asal dari Kepala Batas, Kedah. Saya ambil course ni sebab saya dah penat dengan course Sains Tulen!! 😭 Allhamdulilah mental saya semakin better belajar course ni dan saya suka course ni <3

MUHAMMAD FIRDAUS BIN ABD RAZAK (03DDT22F1079)

2023-08-30 03:55:51 UTC

19
Langkawi
Taman belimbing
Car enthusiast
Try my best to proud my parents 🤧👍
IT? My fav laa 😎🗿👍

2023-08-30 04:01:13 UTC

My name is Norfasya Hanoom bt Ahmad Nazri Khan call me Fasya , I am from Sungai Petani and is 19 years old , sorry nk english ii sikit 😝 xminat sangat course It nih tapi alhamdulillah dpt kawan semua jenis yg pandai ii dan rajin dlm course nih

2023-08-30 04:37:52 UTC

Hi, my name is Nur Alyaa Qistina Bt Mohd Dzulkarnain and everyone calls me Alyaa. I'm turning 19 years old this year🤫 Takpela tukar balik Melayu HAHAHA. Asal dari Jitra, Kedah, dkt sngat further study pun😂 Actually course ni dh pilihan bawah dh dlm upu tu but since dari smk dh belajar science comp so why not sambung je lagi kan? FIGHTING for another sem together DDT3A!❤️

2023-08-30 09:57:48 UTC

Assalamualaikum dan Salam Sejahtera , nama diberi Nurul Asmalyyana Binti Abdul Mohamad Nasir. Berasal dari kacukkan Kedah + Kelantan...tapi saya menetap di Bukit Kayu Hitam , Kedah. Umur masih 18 sebab tak befday lagi , tapi kalau ikutkan tahun dah 19 laa tahun nih. Akhir kata dari saya , selamat maju jaya semua💪🩵

AMIRUL HAKIMI BIN ROSLI (03DDT22F1001)

2023-08-30 10:33:31 UTC

Boleh panggil Mirul jee
•Seri Iskandar , Perak.
•19
•Jenis susah senyum tapi dalam hati ada taman
•otw professional web designer

My Profile

2023-08-30 10:55:03 UTC

Hi Puan，my name is Lim Jun Hwa and Puan can call me Jun Hwa. I’m 19 years old. I’m from Alor setar, Kedah. I hope I can enjoy Puan's class.

MUHAMMAD AFIQ FARHAN BIN MAT YUSOFF {03DDT22F1082}

2023-08-30 10:59:50 UTC

=>Afiq.
=>19.
=>Sp,Kedah.
=>Taman Belimbing.
=>IT is something that I find fascinating.

MOHAMAD AIDIL AMIN BIN ABD MANAF (03DDT22F1025)

aidilamin8734 — 2023-08-30 11:03:53 UTC

Boleh panggil Aidil
° Asal Ayer Hitam,Kedah
° Not really a social person
° Hope can improve my social skills in the future
° Try to past this semester with flying colours

NOR IMANINA BINTI IBRAHIM (03DDT22F1011)

2023-08-30 11:10:33 UTC

Assalamualaikum, Nama saya Nor Imanina Binti Ibrahim , asal dari jitra Kedah, umur 19 tahun pada tahun 2023😉

AIMAN AQIL BIN LA'ANAIN

2023-08-30 11:12:18 UTC

Nama diberi AIMAN 'AQIL BIN LA'ANAIN
03DDT22F1015
Berasal dari alor setar
hobi bowling and game
panda parttime

NURUL HANISAH BINTI NORDIN (03DDT22F1009)

2023-08-30 11:38:14 UTC

-Hanisah
-Bedong, Kedah
-19

ADLIN NURDINIE BINTI MOHD BURHAN (03DDT22F1003)

2023-08-30 11:40:45 UTC

- Adlin
- Gurun, Kedah
- 19

NUR AQILAH BINTI MD A’ULA (03DDT22F1004)

2023-08-30 11:41:32 UTC

-Aqilah
-18
-Yan, Kedah

2023-08-30 11:43:11 UTC

- Siti Umairah binti NajwiFuad
- 19 years old
- Alor Setar, Kedah

nurulnabilamk — 2023-08-30 11:45:00 UTC

-Nabila
-19
-Pendang,Kedah

NAUFAL BIN SAIFUL KHOHAR (03DDT22F1018)

2023-08-30 12:28:30 UTC

• Naufal
• Asal Alor Setar, Kedah
• 19

2023-08-30 13:28:38 UTC

Ahmad Asyaf bin Rosli
19
Kuala Kangsar, Perak

MUHAMMAD ANIQ RAIZAL BIN ABDULLAH (03DDT22F1012)

2023-08-30 13:30:14 UTC

Assalamualaikum. Nama diberi Muhammad Aniq Raizal bin Abdullah boleh panggil saya Aniq. Saya berumur 19 tahun. Berasal dan tinggal di Ayer Hitam,Kedah.

SYLVIA SUGIN ANAK LIAM (03DDT22F1999)

sylviasugin — 2023-08-30 16:21:34 UTC

Hi nama saya Sylvia Sugin Anak Liam, berasal dari Sibu, Sarawak. Umur 20 tahun (tahun ini). Sebenarnya sejak saya di sekolah menengah, saya tiada pengalaman dalam pembelajaran IT (dulu ambil seni). Tapi sejak dari kecil saya memang minat pasal komputer dan hendak buat aplikasi saya sendiri. Dan harap ibu bapa saya sedar dan bangga akan bidang yang saya pilih.

2023-08-30 16:59:34 UTC

Nama saya Muhammad Azim bin Ismail, boleh panggil Muhammad Azim bin Ismail atau Azim. Berumur 19 tahun dan berasal dari Yan Kedah. Selalu masa sekolah menengah bila projector problem orang suruh saya baiki, jadi dari situ mula minat saya dengan IT. Saya juga pernah membina sebuah PC. Sebenarnya bukan pilihan pertama untuk masuk IT tetapi cukuplah memadai dengan hati.

F1002

2023-08-31 06:03:49 UTC

Beh Hao Zhe
19
Ulu Tiram, Johor

F1002

2023-09-20 03:01:17 UTC

There are six type of data structure which are linear, non-linear, primitive, non-primitive, static and dynamic

Example of Data Struct

2023-09-20 03:02:49 UTC

F1012

2023-09-20 03:03:27 UTC

Example of data structure:

Array
Linked List
Stack
Tree
Queue

Type of data structure:

Linear
Non-Linear
Primitive
Non-Primitive
Static
Dinamic

F1015

2023-09-20 03:05:20 UTC

introduction
type of data structure
primitive data type
non primitive data type
linear and non linear
array
static and dymic
data structure

Difference List and Linked List F1079

2023-09-20 03:05:56 UTC

• List :
1. Static size of list
2. Easy program update
3. Easy program process

•Linked List :
1. Dynamic size of list
2.Complicated program updates
3.Complex program process

Topic 1 Summary F1013

2023-09-20 03:05:58 UTC

Data Structure: way of storing and organizing data to be used effectively.

Examples of Data Structure:
-Array
-Tree
-Stack
-Linked List
-Queue

5 Types of Data Structure:
-Linear
-Non-Linear
-Primitive
-Non-Primitive
-Dynamic
-Static

Array: used to store a collection of data
-Single-dimensional array

Topic 1 F1018

2023-09-20 03:06:07 UTC

1. Example of data structure
Array, Tree, Queue, Linked list, Stack

2. Type of data structure
Linear, Non Linear, Primitive, Non Primitive, Static, Dynamic

3. Accessing Structure members

F1023

2023-09-20 03:06:18 UTC

6 type of data structure : Linear, Non-Linear, Primitive, Non-Primitive, Static and Dynamic

F1002

2023-09-20 03:07:41 UTC

List is collection of data element, component or objects of the same type

Operation in List
1. Insertion - add item
2. Deletion - delete item
3. Retrieval - searching
4. Traversal - list in order and strctured

F1001

2023-09-20 03:07:44 UTC

3 things in data structure
1.Structure name
2.Data member/member of struct
3.object/structure variable

YANA (F1007)

2023-09-20 03:08:08 UTC

Maksud data stucture :
- menyimpan dan menyusun data boleh digunakan secara efficiently.

Example :
- stack , array , queve , link list and tree

Type :
1) linear / non linear
2) primitive / non primitive
3) static / dynamic

Array :
- ada index
- start 0
- last index [n-1]

Data stucture systax :
1) structure name
2) data number
3) object or stucture variable

zulfa husna

2023-09-20 03:08:11 UTC

-Data structure is a particular way to store and organising data
- types of data struct :
1) linear ( data tersusun) and non linear (tak tersusun, example : tree)
2) primitive (single value) and non primitive ( group value)
3) static (data size are fix)
4) dynamic ( flexible to store any size of data)

F1010

2023-09-20 03:08:16 UTC

> Type of data structure
- linear (sequence)
- non-linear (multi-leveled)
- primitive (char,int,float,bolean)
- non-primitive (group value)
- static (size fixed)
-dynamic (size not fixed)

> Example of Data Structure
-array
- queue
- stack
- tree
- linked list

> Coding structure
Struct structure name
{
datatype num1;
datatype num2;
datatype num3;
} Object_name @ variable of struct;

>

F1015

2023-09-20 03:09:08 UTC

concept of list
array analogy
list operation
concept of linked list
properties of linked list
differences between list and linked list
operation of linked list
type of linked list

F1009

2023-09-20 03:09:50 UTC

-linear , non-linear , static , non-primitive , primitive
Linear(tersusun )

Array,Linked list,Queue

Non-linear (multilevel)

Tree

Primitive (single value)

Character
Integer
Float
Boolean

Non-primitive(group value)
Static & dynamic(not fixed/flexible)
Data structures syntax

Structure name
Data member
Object/structure variable

F1001

2023-09-20 03:09:52 UTC

•Singly Linked list
•Doubly Linked list
•Circular Linked list
•Doubly Circular Linked list

Topic 1 (F1008)

2023-09-20 03:09:56 UTC

Jenis ii
- Static (xgerak ,xflexible)
- Dynamic (Gerak nk fix size ,flexible)
- Linear (Sequence , jujukan)
- Non linear (multileveled)
- Primitive (Char , Int , Float , Boolean)
- Non primitive (store group values) - Array , queue , link list

Contoh ii
- Array (yg int [])
-Queue
- Tree
- Stack
- Link list (topic 2)

Nk tau last elemen dlm array
= n-1
First elemen dlm array mesti 0
Jtmk[0] , Jtmk[1], Jtmk [2] = 3

Struct : Structure name , object , Data member

F1022

2023-09-20 03:09:57 UTC

Topic 1 summary
- Data structure definition: A particular way of storing and organizing data in a computer so that it can be used efficiently.

- Data declaration: char, int, double, float, string...

- Types of data structure: Linear/Non-Linear, Primitive/Non-Primitive, Static/Dynamic.

- Examples of data structure: Array, Stack, Linked List, Queue, Tree.

-Array definition: used to store a collection of data collection of variables of the same type.

F1025

2023-09-20 03:10:02 UTC

Introduction to data structure.

Example of data structure
- array
- queue
- stack
-linked list
- tree

Primitive data structure

Non primitive data structure

Static
-fixed size
-waste memory

Dynamic
-sized not fixed

F1003

2023-09-20 03:10:08 UTC

Type of data structure

Linear - satu garis lurus
Non-Linear - multilevel
Primitive - only single values
Non-Primitive - to store the group of values
Static - fixed
Dynamic - not fixed

Example of Data Structure

Array
Stack
Queue
Tree
Linked List

Data Structure Syntax

Structure name
Data member/variable
Object/Structure variable

Sylvia F1999

sylviasugin — 2023-09-20 03:10:44 UTC

A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.

F1004

2023-09-20 03:10:45 UTC

Types of data structure
•Linear
•Non-linear
•Primitive
•Non-primitive
•Static
•Dynamic

Example of data structure
•array
•stack
•queue
•tree

nurulnabilamk — 2023-09-20 03:10:50 UTC

F1006

TYPES OF DATA STRUCTURE
-linear (satu garis lurus)
-Non linear (tidak tersusun)
-Primitive (data single value)
-Non primitive (group values)
-Static (fixed data)
-Dynamic (Not fixed)

DATA STRUCTURE SYNTAX
-Structure name
-Data member
-Object/Structure variables

EXAMPLE OF DATA STRUCTURE
-Array
-Linked list
-Stack
-Queue
-Tree

Umairah F1016

2023-09-20 03:11:05 UTC

Data structure:

-Array

-stack

-queue

-tree

-linked list

Types of data structure:

-Linear

-Non-linear

-Primitive

-Non primitive

-Static

-Dynamic

Array

-structure name

-variable

-object

F1082

2023-09-20 03:11:54 UTC

Array
=>Single Dimension
=>Structure name
=>Data member
=>Object/Structure variable

F1019

2023-09-20 03:12:36 UTC

Example of Data Structure
6 types of data structure( linear vs non linear, primitive vs non primitive, static vs dinamic)
define data structure in C++ language.

F1012

2023-09-20 03:12:50 UTC

I learned about operation of List,properties of Linked List, operation of Linked List,Different between list & Linked list and also type of linked list.

Topic 2 F1018

2023-09-20 03:12:53 UTC

- List operations
- Linked List operations
- Differences between List & Linked List
- Type of Linked List
- Properties of Linked List

F1005

2023-09-20 03:13:14 UTC

List and linked list
- collection of data components

4 list of operation
1) insertion
2) deletion
3) retrieval ( search item)
4) traversal (data in order)

Properties
head, node, data, next, bull, figure

- single linked list
- doublly inked list
- circular linked list
- double circular linked list

F1010

2023-09-20 03:13:49 UTC

> List
- static (array)
- list operation
* Insertion(add)
* Deletion (delete)
* Traversal (data dlam sequences)
* Retrieval (search)

> linked list
- dynamic
-properties
* Head
* Null
* Node
* Next
* Data

> Type of linked list
- Linear linked list
- Sequence linked list
- Doubly linked list
- Double circular linked list

Topic 2 Summary F1013

2023-09-20 03:14:15 UTC

List: collection of data element, components and object of the same type -> like a record

List: Static
Size: Fixed

List operation
-Insertion
-Deletion
-Traversal
-Retrieval

Linked List: sequence of data structure

Properties
-Head
-NULL
- Node
-Data
-Next

Linked List Operation
-Create node
-Create linked list
-Check linked list
-Insertion node
-Deletion

Type of linked list
-Linear Linked List
-Circular Linked List
-Doubly Linked List

F1025

2023-09-20 03:14:17 UTC

Operation of list
Operation of linked list
Properties of linked list
Type of linked list
Difference between list and linked list

F1004

2023-09-20 03:14:17 UTC

1. Operation of list
(Insertion, Deletion, Retrival, Traversal)
2. Properties of Linked list
3. Operation of Linked List
4. Different list and linked list

YANA [F1007]

2023-09-20 03:14:57 UTC

Link :
- static and fixed
- contoh , array anology
- operation (insertion , deletetion , retrieval and traversal

Linked list :
- dynamic and not fixed
- tak ada maximum size
- properties (head , null , node , data n next)
- operation (create node , create link list , ckeck link list , insertion note in the list and delete or removed)
- type (single , doubly , cirular , doubly cirular)

Umairah F1016

2023-09-20 03:15:09 UTC

Operation list:

-insertion

-deletion

-retrieval

-traversal

Properties linked list

-head

-null

-next

-node

-data

Operation linked list:

-create node

-create linked list

-check linked list:empty

-insertion node dlm list

-delete node dlm list

Type linked list:

-linear

-doubly

-circular

F1009

2023-09-20 03:15:19 UTC

List
-Collection of data element, component or objects of the same type.
Linked List
-A sequence of data structures , connected together via links.

OPERATION IN LIST:
-INSERTION

-TRAVERSAL
-DELETION
-RETRIEVAL

PROPERTIES

-Head
-NULL
-Node
-Data
-Next
TYPE OF LINKED LIST
1.Singly linked list
2.Doubly linked list
3.Circular linked list
4.Doubly circular linked list

F1008

2023-09-20 03:15:22 UTC

Link operation
- Insertion
- Deletion
- Traversal
- Retrieval

Properties
Head , Null , Nod , Data , Next

Operation Linked list
1) Create node
2) Create link list
3) Check if empty
4) Insertion node in list
5) Delete node in the list

Types Link list
-Linear, Circular , Doubly ,

F1003

2023-09-20 03:17:06 UTC

Concept of List
Operation in List - Insertion, Deletion, Retrieval and Traversal
Concept of Linked List
Properties of Linked List - Head, NULL, Node, Data and Next
Differences between list and linked list
Operation of Linked List
Type of Linked List - Singly Linked List, Doubly Linked List, Circular Linked List and Doubly Circular Linked List

nurulnabilamk — 2023-09-20 03:17:24 UTC

F1006

Concepts of list and linked list
List operation
-insertion
-retrieval
-deletion
-traversal

Properties of linked list
-head
-null
-data
-next
-node

Types of linked list
-singly linked list
-doubly linked list
-circular linked list
-doubly circular linked list

F1023

2023-09-20 03:18:07 UTC

There are 4 list operation : Insertion, Deletion, Traversal, Retrieval.

There are 5 operation of linked list : 1.Create Node 2.Create linked list 3.Check linked list :empty 4. Insertion of node in list 5. Deletion of node in list

F1022

2023-09-20 03:18:17 UTC

Topic 2 summary
List:
- A collection of data element, components or objects of the same type like a record.
- List is a static data structure so the size is fixed.

Operations in List:
- Insertion
- Deletion
- Retrieval
- Traversal

Linked List:
- A sequence of data structures, which are connected together via links.
- Linked list is a dynamic data structure so the size is not fixed.

Properties of Linked List:
- Head
- NULL
- Node
- Data
- Next

Operations in Linked List:
- Create node
- Create linked list
- Check the linked list: empty
- Insertion node in the list
- Delete node in the list

Sylvia F1999

sylviasugin — 2023-09-20 03:18:20 UTC

Operation of Linked List
●Create node
●Create linked list
●Check the linked list
●Insertion node in the list
●Delete node in the list

F1019

2023-09-20 03:19:10 UTC

List, Linked List

operation
-list(insertion, deletion, retrieval, traversal)
-linked list(create node, create linked list, create the linked list: empty, Insertion in the list, deletion in the list)

properties of linked list (head, node, null)

type of linked list
1. Single linked list
2. doubly linked list
3. Circular linked list
4. Doubly circular linked list

F1082

2023-09-20 04:21:05 UTC

LIST
=>List is static, size is fixed.
List operation
=>Insertion
=>Deletion
=>Retrieval
=>Traversal
=>Static Size
=>Easy program update
=>waste memory space

LINKED LIST
=>Head, Node, Data, Next, Null
=>Dynamic Size
=>Complex program update
=>Don't waste memory space

TYPES Linked List
=>Singly
=>Doubly
=>Circular
=>Doubly Circular

F1025

2023-09-21 02:00:13 UTC

Stack array
Stack linked list
Operation of stack
-push
-pop
-top
-isempty
-isfull
Stack underflow
Stack overflow

F0179

2023-09-21 02:00:59 UTC

POP - delete
PUSH - insert
TOP - Point latest value, Hold current value, Point last value
ISEMPTY() - check empty or not
ISFULL() - check full or not

Array - Fixed
Linked list - unlimited

F1001

2023-09-21 02:01:34 UTC

4 Protocols in LIFO (Last In First Out)
1.PUSH
2.POP
3.IsEMPTY
4.IsFULL

F1022

2023-09-21 02:01:49 UTC

Topic 3 summary
- definition of stack
- concepts of stack
- stack in daily life
- operations in stack
- stack using linked list form

Sylvia Sugin (F1999)

sylviasugin — 2023-09-21 02:02:01 UTC

5 operations in a stack
○ Push
Insert an item into a stack.

○Pop
Remove or delete items from stack.

○Top
Holds the current valie at the top of stack.

○IsEmpty
Checking whether the stack is empty or not.

○IsFull
Checking whether the stack is full or not.

F1019

2023-09-21 02:02:25 UTC

Operation
Pop, Push,top, isEmpty, isFull

Underflow, overflow

Operation in array and linked lists

F1015

2023-09-21 02:02:37 UTC

definition stack
concept of stack
operations in stack
example stack in real life
basic operation of stack using array

F1012

2023-09-21 02:03:07 UTC

Stack

definiton,concept,operation in stack,checking operation,potiental problem in stack

Stack Array -fix size
Stack Linked List-not fix size

F1004

2023-09-21 02:03:10 UTC

1. Definition Stack
2. Concept of stack (LIFO)
3. Operation in stack (push,pop,top,isempty,isfull)
4. Potential problem occur in stack

F1006

nurulnabilamk — 2023-09-21 02:03:10 UTC

1.Define a stack
2.the concept of stack
3.example of stack in real life
4.Operation of stack
5.potential problem of stack
6.basic operation of stack using array and linked list

F1005

2023-09-21 02:03:10 UTC

1) concept of stack
( LIFO) Last In First Out
2) 5 operations
- push (insert item)
- pop (remove)
- top ( latest item)
- IsEmpty (check empty or not)
- IsFull (check full or not)
3) we learn about how to convert stack into linked list diagram. :)

F1010

2023-09-21 02:03:11 UTC

About stack!

1) concept= LIFO(Last In First Out)
2) 4 protocol
- push
- pop
- ISEMPTY
- ISFULL

3) 5 operation
- push(insert)
- pop(delete/remove)
- top (latest value)
- isempty (empty or not)
- isfull (full or not)

4) potential problem
- stack underflow (empty, but try to pop)
- stack overflow (full,but try to push)

Topic 3 F1018

2023-09-21 02:03:20 UTC

- Concept of stack
- Operations in stack
- Potential problem
- Operation of stack using array & linked list

F1002

2023-09-21 02:03:21 UTC

Stack has one open end called TOP which used for PUSH and POP

It also formally known as LIFO

There are five operation related stack
- PUSH
- POP
- TOP
- ISEMPTY
- ISFULL

Topic 3 Summary F1013

2023-09-21 02:03:32 UTC

Stack: homogenous collection of items of any one type

LIFO (Last In First Out)
Element which is last inserted is accessed first

PUSH
POP
ISEMPTY
ISFULL
TOP

Stack Underflow
Stack Overflow

F1023

2023-09-21 02:04:11 UTC

Concept of stack

5 stack operations

Issues that can be encountered in stack

Stack linked list and stack array

F1003

2023-09-21 02:04:31 UTC

Definition Stack
Concept of Stack - LIFO
Last In First Out Protocol - Push, Pop, IsEmpty and IsFull
Stack Implementation That Relates in Real Life
Operations in Stack - PUSH, POP, TOP, ISEMPTY() and ISFULL()

F1009

2023-09-21 02:05:39 UTC

stacks

Homogeneous collection of items of any one type.

Concept

LIFO(Last in First Out)

Operation

PUSH
POP
TOP
ISEMPTY()
ISFULL()

Potential problem

Stack underflow
Stack overflow

Protocol

Push
Pop
isEmpty
isFull

Imanina (F1011)

2023-09-21 02:25:29 UTC

DATA STRUCTURE

Types of Data Structure

Linear -satu garis lurus

-tersusun

-Array,linked list,Queue,Stack

Non linear-multi leveled

-Tak tersusun

-Tree & graph

Dynamic

-berubah

-not fixed

-not waste extra memory

-flexible to rearrange item

Static

-tidak berubah

-saiz is fixed

-Waste extra memory

-Not flexible to rearrange item

Easy to programming prosess

Primitive

Only single value

Do not have special capabilities

Non primitive

To store the group

ARRAY AND DATA STRUCTURE

array

-Fixed size

-static

Single Dimensial Array

Array name [array size];

First index start with 0 not 1

Data Structure

Struct Structure name

{

Data type Member;

} Object / structure variable;

Accessing Structure member

VariableStructure•memberofstructure

F1011

2023-09-21 02:26:13 UTC

LIST & LINKED LIST

List Operation
Deletion-delete item from list
Insertion-add item into lost
Retrieval-searching & list &display

Linked List
Properties of linked list
Head-first node of the list
Node-have data and next
Data-information
Next-reference of the other node
NULL-the last item (x)

Different link and linked list
List
Static size of list
Easy programming process
Not flexible to rearrange item
Waste extra memory space

Linked list
Dynamic size of list
Complex programming process
Flexible to rearrange item
Not waste extra memory space

Linked list operation
Create node
Create linked list
Check the linked list
Insertion node in the list
Delete node in the list

Type of linked list
Singly linked list
Doubly linked list
Circular linked list
Doubly Circular linked list

Imanina(F1011)

2023-09-21 02:26:44 UTC

Stack-bertindih
•a homogeneous collection of items of any one type

Concept of stack
-formally knows as LIFO(Last In First Out)

Protocol of stack
-Push
-Pop
-Is Empty
-Is Full

Operation In stack
-Push
-Pop
-Top
-IsEmpty
-IsFull

Potential Problem Occur In Stack
Stack underflow-kurang tapi terbuang lagi
Stack overflow-sudah penuh tapi tambah lagi

F1023

2023-09-25 14:16:16 UTC

Array queue, linked list queue, stack queue, circular queue

F1015

2023-09-25 14:16:47 UTC

definition queue
concept of queue
operation in queue
operation in queue(circular)

F1025

2023-09-25 14:16:54 UTC

Concept of queue
-FIFO
Operation of queue
-enqueue
-dequeue
-isempty
-isfull

Queue array
Queue linked list
Queue stack
Queue circular

F1004

2023-09-25 14:18:12 UTC

-Definition Queue
-Concept of queue (FIFO)
-Operation in Queue (Linear)
•Enqueue
•Dequeue
•Isempty
•Isfull
-Operation in Queue (Circular)

F1018

2023-09-25 14:18:37 UTC

- Concept of queue
- Queue using linked list
- Queue using stack
- Operation in queue
- Circular queue

F1008

2023-09-25 14:18:50 UTC

First come first in
Link list
Enqueue 1 - 2 3 4 = 2 3 4 1
Dequeue = 3(f) 4 1(r)
Front , rear

Front rear count for circle
-arah jam

Queue F1079

2023-09-25 14:18:58 UTC

FIFO ( FIRST IN FIRST OUT )
Implemented with Linked List
Implemente with Circular

F1006

nurulnabilamk — 2023-09-25 14:19:11 UTC

-definition of queue
-concept of queue
-operation in queue(LINEAR)
-operation in queue (CIRCULAR)

F1003

2023-09-25 14:19:13 UTC

Definition Queue
Concept of Queues - FIFO
Operations in Queue (Linear) - ENQUEUE, DEQUEUE, ISEMPTY and ISFULL
Operations in Queues (Circular)

F1009

2023-09-25 14:19:17 UTC

Definition of queue
Concept of queue
Operation in queue linear
Operation in queue circular

F1010

2023-09-25 14:19:24 UTC

QUEUES

- concept queque
* FIFO (First In First Out)

-operation in queque
* Enqueue (insert)
* Dequeue (removed or delete)

- head (front)
- tail (rear)

F1019

ljhwa2004 — 2023-09-25 14:19:26 UTC

FIFO

enqueue and dequeue
operation in array，linked list ，stack and circular queue

Sylvia Sugin (F1999)

sylviasugin — 2023-09-25 14:19:38 UTC

Enqueue
•Insert an item into a queue (from the tail)
Dequeue
•Remove an item from queue (from the head)

Topic 4 Summary F1013

2023-09-25 14:20:00 UTC

Queue: non-primitive data structure
-accesible from both ends

Concept: FIFO (First In First Out)

Operations:
-Enqueue
-Dequeue
Checking Op
: Isempty
: Isfull

F1002

2023-09-25 14:20:57 UTC

Queue is a non-primitive data structure

Concept of queue is formally known as FIFO(First In First Out)

Operation in Queue
- ENQUEUE - insert
- DEQUEUE - delete or remove
- ISEMPTY() - empty or not
- ISFULL() - full or not

F1022

2023-09-25 14:21:04 UTC

- Definition of queue
- Concepts in queue
- Operations in queue
=Enqueue
=Dequeue
=Isempty
=Isfull
-Operations in queue (Circular)

F1012

2023-09-25 14:22:11 UTC

Queue: Non-primitive data

concept of queus:
FIFO- First In first Out

Array
Linked List
Stack

f1016

2023-09-25 14:23:13 UTC

-definition queue
-concept of queue
-operation of queue
-enqueue
-dequeue
-isempty()
- isfull()
-front
-rear

YANA (F1007)

2023-09-25 14:25:00 UTC

Queue = non-primitive data

Concept of queue = FIFO

Enqueue = tambah
Dequeue = delete or buang

Front = dia ada kat depan and dia yang akan dibuang dulu
Rear = dia ada kat belakang and dia yang ditambah

Circular queue :
1. Selagi ada ruang dia blh diisi
2. Ikut arah jam
3. Ada front , rear and count

f1005

2023-09-25 14:27:14 UTC

definition of queue
-non primitive data struct
operation of queue
-enqeue
-dequeue
-isEmpty
-isFull

F1082

2023-09-25 14:30:39 UTC

A stack is a linear data structure that follows the LIFO (Last-In-First-Out) principle. It means that the last element added to the stack is the first element to be removed. A stack can be implemented using an array or a linked list.

=>Push
=>Pop
=>Top
=>ISEMPTY()
=>ISFULL()

=>Stack underflow
=>Stack Overflow

F1082

2023-09-25 14:40:09 UTC

A queue is a linear data structure that follows the FIFO (First-In-First-Out) principle. It means that the first element added to the queue is the first element to be removed.

=>Enqueue
=>Dequeue
=>ISEMPTY()
=>ISFULL()
=>Front/Rear

CIRCULAR QUEUE
=>Clockwise
=>Fill data until its full
=>Front
=>Rear
=>Count

F1015

2023-11-02 01:22:15 UTC

terminology of tree

binary tree

binary search tree

difference between normal tree and binary tree

tree traversal

Tree F1079

2023-11-02 01:22:18 UTC

Tree and binary tree

Insert Delete

Pre In Post order

Root

Parents

Children

Siblings

Leaf

Height

Depth

F1025

2023-11-02 01:22:21 UTC

-Terminology of tree

Root
Parent
Child
Sibling
Leaf
Height
Depth

-Difference between normal tree and binary tree

-Binary tree

-Binary search tree

-Tree traversal

Preorder
Inorder
Postorder

Aniq F1012

2023-11-02 01:22:28 UTC

Tree

-Root

-Parents

-Childrens

-Siblings

-Leaves

-Height & depth

normal tree vs binary tree

Traversal

-Preorder

-Inorder

-Postorder

F1022

2023-11-02 01:22:38 UTC

Tree

Non-Linear
Root
Parents
Children
Leaf
Siblings
Height
Depth

Binary Tree

Siblings
Tree traversal
Insert
Delete
Search
Copy

F1004

2023-11-02 01:22:48 UTC

•root, siblings, parent, leaf, height, depth

•Tree traversal: preorder, inorder, postorder.

F1023

2023-11-02 01:23:29 UTC

Tree, Binary Tree, Binary sewrch tree, Tree traversal preorder, inorder and post order. Tree characteristics : root, parents, siblings, childrens, leaves, height

Tree Traversal(F1001)

2023-11-02 01:23:35 UTC

Preorder ◀️

Inorder🔽

Postorder▶️

F1009

2023-11-02 01:23:40 UTC

Tree

Non- linear structure

Terminologies

Root
Parent
Child
Siblings
Leaf
Height
Depth

Binary tree operation

Siblings
Tree traversal
Insert node
Delete node
Copy tree

F1019

2023-11-02 01:23:43 UTC

root，parent，child， leaf， sibling，height，depth

insert，delete

inorder，preorder，postorder

F1003

2023-11-02 01:23:52 UTC

The Terminologies - root, parent, child, leaf, siblings, height and depth.
Binary Tree Operation - siblings, tree traversal (Preorder, Inorder and Postorder), insert node, delete node, search node and copy tree

F1008

2023-11-02 01:23:58 UTC

TOPIC 5

KALAU BINARY TREE - MAX ANAK BPLEH 2 SAJE

PARENT - ADA ANAK

CHILD - ADA PARENT

SIBLING- DARI PARENT YANG SAMA

LEAF - XDE ANAK

ROOT - YANG PERTAMA

HEIGHT - KIRA DARI BAWAH KE ATAS

WEIGHT - KIRA DARI ATAS KE BAWAH

NK BUAT BINARY TREE

DELETE DUPLICATE
CREATE TREE DENGAR KANAN PALING BESAR , KIRI PALING KECIL

ADA 6 OPERATION

INSERT

DELETE
SEARCH
COPY TREE
TREE TRAVERSAL
SIBLINGS

TREE TRAVERSALA ADA 6

PREEORDER (KIRI)
INORDER (BAWAH)
POSTORDER (KANAN)

F1002

2023-11-02 01:24:18 UTC

Trees are non-linear structure

Concepts of trees are :

ROOT

Parent

Child

Leaf

SIBLINGS

HEIGHT

DEPTH

Sylvia (F1999)

sylviasugin — 2023-11-02 01:24:36 UTC

Root - Single node.

Parent - The node which has child.

Children - Node which has a link from parent.

Leaf - Last node from tree diagram without add another node.

About Tree! (F1010)

2023-11-02 01:25:05 UTC

Tree

-root -parent -sibling

-child -leaf -height -depth

Tree Treaversel

-preorder(kiri)

-postorder(kanan)

-inorder

Binary search tree

1) delete duplicate num

2) greater num (belah kanan)

3) less num( belah kiri)

F1006

nurulnabilamk — 2023-11-02 01:25:29 UTC

TERMINOLOGIES TREE
-Root
-Parent
-Children
-Siblings
-Leaf
-Height
-Dept

MANIPULATE BINARY TREE
-insert node
-delete node

TREE TRAVERSAL
-preoder
-inoder
-postoder

Topic 5 Summary F1013

2023-11-02 01:25:37 UTC

Tree

-Root

-Child

-Parent

-Siblings

-Leaf

-Height

-Depth

Normal Tree and Binary Tree

-Normal tree can have unlimited child

-Binary tree can only have maximum of 2 child

Tree Traversal

-Preorder

-Inorder

-Postorder

Manipulate tree

-3 conditions:

node is a leaf
node only have one child
node have 2 children

Tree

2023-11-02 01:30:00 UTC

Tree

=>Root

=>Parents

=>Children

=>Siblings

=>Leaf

=>Height

=>Depth

Binary Tree

=>Only have 2 child per node

Manipulate Tree

=>Insert node

=>Delete node =>delete leaf

=>delete one child

=>delete two child

=>PREORDER=>

=>INORDER =>

=>POSTORDER =>

Tree

2023-11-02 01:30:45 UTC

-Root

-parent

-child

-leaf

-sibling

-height

-depth

Binary tree

-siblings

-tree traversal

-insert node

-delete node

-search node

-copy node

Manipulate binary tree

-delete leaf

-delete 1 child

-delete 2 child

Traversal

-preorder

-inorder

-postorder

Imanina(F1011)

2023-11-02 01:31:30 UTC

1.Root-node at the top

2.Parent-have a children

3.Children-have a parent

4.Siblings-more node that have same parent

5.leaf-node in the end

6.Height

7.Depth

Binary tree-can have maximum 2 children

To create binary tree

1.Delete duplicates number

2.letak kanan lebih daripada root letak kiri kalau kurang daripada root

Tree travelsal

Preorder
Inorder
Postorder

YANA [F1007]

2023-11-02 01:31:42 UTC

TREE :

ROOT
PARENTS
CHILDREN
SIBLINGS
LEAVES
HEIGHT
DEPHT

PERBEZAAN ANTARA TREE DENGAN BINARY TREE ADALAH :

i) TREE = anak dia blh banyak

ii) BINARY TREE = anak boleh 2 sahaja

JENIS BINARY TREE

1) BINARY SEARCH TREE

Contoh kalau root dia 5..no 4 akan ada disebelah kiri , manakala 6 akan ada di kanan

2) MANIPULATE BINARY TREE

i) INSERT

ii) DELETE

Leaves
One child
Two child

3) TREE TRRAVERSAL

i) pre = kiri

ii) in = bawah

iii) post = kanan

F1082

2023-11-02 03:21:00 UTC

Tree

=>Non linear

Terminologies

=>Root

=>Parents

=>Childrens

=>Siblings

=>Leaves

=>Height

=>Depth

Binary Tree

=> each node can only have 2 child

Binary Tree Operation

=>Siblings

=>Tree Traversal

=>Insert Node

=>Delete Node

=>Search Node

=>Copy tree

Binary Search Tree

=>Root value => less than (<) place in the left

=>greater or equal (>=) place in the right

Manipulate Binary Tree

=>Insert node

=>Delete node

=>delete leaf

=>delete one child

=>delete two child

Tree Traversal

=>Preorder >>left

=>Inorder >>below/mid

=>Postorder >>right

F1001 MIRUL

2023-11-16 02:44:28 UTC

Binary Search

Linear Search

F1022

2023-11-16 02:46:08 UTC

-Definition of Sorting

A process rearrange data item in certain order whether in ascending or descending order according to alphabet or number.

-Types of Sorting

Selection sort
Insertion sort
Bubble sort
Merge sort
Quick sort

-Definition of Searching

A process of finding the location of an element with a specific value or key within a collection of elements.

- Types of Searching

Linear search
Binary search

F1002

2023-11-16 02:46:11 UTC

Type of sorting :

Selection sort
Insertion sort
Bubble sort
Merge sort
Quick sort

F1025

2023-11-16 02:46:38 UTC

Sorting and Searching

Definition of sorting
Type of sorting(Selection,Insertion,Merge,Quick,Bubble)

Searching

Definition of searching
Type of searching(Linear,Binary)

Topic 6 F1018

2023-11-16 02:46:50 UTC

Sorting

Type of sorting

• Selection

• Quick

• Merge

• Bubble

• Insertion

Searching

Linear - Sorted / Unsorted

Binary - Sorted

F1023

2023-11-16 02:46:56 UTC

Bubble sort, quick sort, merge sort, binary search, linear search

Sort & Searching F1079

2023-11-16 02:46:56 UTC

Sort 5 type:

1. Selection

2. Insertion

3. Bubble

4. Merge

5. Quick

Searching 2 type:

1. Binary

2. Linear

F1003

2023-11-16 02:47:44 UTC

Type of Sorting

Selection Sort
Insertion Sort
Bubble Sort
Merge Sort
Quick Sort

Type of Searching

Linear Search
Binary Search

F1006

nurulnabilamk — 2023-11-16 02:47:51 UTC

Type of Sorting
•selection sort
•insertion sort
•bubble sort
•merge sort
•quick sort

Type of Searching
•linear search
•binary search

F1019

2023-11-16 02:47:57 UTC

Sort

Linear sort

selection sort

quick sort

insertion sort

bubble sort

binary search

linear search

F1013 Topic 6 Summary

2023-11-16 02:47:58 UTC

Types of Sorting:

-Selection

-Insertion

-Merge

-Bubble

-Quick

Two Types of Searching

-Linear

-Binary

YANA

2023-11-16 02:48:09 UTC

TYPE SORTING

selection sort
insert sort
bubble sort
merge sort
quiet sort

TYPE SEARCHING

linear search
binary search

Sylvia (F1999)

sylviasugin — 2023-11-16 02:48:53 UTC

Types of Sorting

Insertion sort, Selection sort, Bubble sort, Quick sort and Merge sort.

F1004

2023-11-16 02:49:00 UTC

Types of sorting

•selection sort

•insertion sort

•bubble sort

•merge sort

•quick sort

Types of searching

•Linear search

•Binary search

F1010

2023-11-16 02:49:19 UTC

SORTING & SEARCHING

SORTING= process rearranged

Type of Sorting

1- selection sort (bwa ke depan)

2- Insertion sort (ltak palang)

3- Bubble sort (value sebelah")

4- merge sort (ceraikan,kahwenkan balek)

5- quick sort (pivot can choose)

SEARCHING

Type of searching

1- linear search (search one by one)

2- Binary search (middle index =1st+last/2)

F1005

2023-11-16 02:50:29 UTC

we learned about type of sorting,

selection

insertion

bubble

merge

quick

we learned about searching

it have 2 types

linear and binary

Sorting and Searching (F1012)

2023-11-16 02:51:05 UTC

Sorting

Type pf sorting:

Selection sort
Insertion sort
Bubble sort
Merge sort
Quick sort

Searching

Type of searching:

Linear search
Binary search

F1008 FASYA

2023-11-16 02:51:20 UTC

Sorting - Rearrange data

Type -

Selection
Insertion
Quick
Bubble
Merge

Selection - yg kecil tukar tempat ngan tempat kedudukan yg depan

Insertion - Ada palang (insert masuk dlm)

Bubble - Compare sebelah ii

Merge - bahagikam kpd kecil lepas tuh gabung

Quick - ada pivot

Linear
Binary

Linear - simple but slow (cari satu per satu)

Binary - cari middle index dan data kena sorted dulu baru boleh buat

First index tambah last index bahagi dgn 2

(F1011)

2023-11-16 02:51:34 UTC

Sorting and searching

Sorting is a process rearranged data item in certain order, whether in ascending or descending

Types of sorting

1.Selection sort

Insertion sort
Bubble sort
Merge sort
Quick sort

Searching

Types of searching

Linear search
Binary search

F1082 (FIQH) ;

2023-11-16 02:51:57 UTC

Topic 6:Sorting

=>process of rearranging data in

ascending or descending order according to number or alphabets

=>Selection Sort

=>Insertion Sort

=>Bubble Sort

=>Merge Sort

=>Quick Sort

Searching

=>Linear Searching

=>Binary Searching

F1009

2023-11-16 02:58:36 UTC

Type of Sorting

Selection
Insertion
Quick
Bubble
Merge

Type of Searching

Linear
Binary