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

2023-09-06 02:49:00 UTC

Saya belajar pasal data structure ada 5 contoh iaitu array,link listed,tree,queue anda stack

2023-09-06 02:51:10 UTC

I learned about type and examples of data structure. I also learned on how to do declaration for array

2023-09-06 02:51:31 UTC

Data structure show ways to store and organise data to use it more efficiently.
Also learn about the types of data structure like static vs dynamic, linear and nonlinear, primitive and no primitive.Moreover learn the example of data structure that is array.

2023-09-06 02:52:34 UTC

i learn how to differentiate 6types of data structure which is linear, non-linear, primitive, non-primitive, static and dynamic.

2023-09-06 02:52:53 UTC

there are 6 types of data structure :

1. linear - straight line
2. non-linear - multi-leveled
3. static - fixed size
4. dynamic - not fixed size
5. primitive - single value
6. non-primitive - groups of values

2023-09-06 02:53:00 UTC

I learn definition of data structure, example of structure and types of structure

what i learned:

rinithatamilselvam20 — 2023-09-06 02:57:03 UTC

- data structure is a way of storing and organising data in computer.
- 3 types of data structure: linear/non-linear, primitive/non-primitive, static/dynamic.
- examples of data structure: array,linked list,stack,tree
- array store data collection of same variable

Ooi Jia Yi

ooijy03 — 2023-09-06 02:59:03 UTC

Yang I pelajar dalam topik satu ialah data structure is a organising data in a computer.Data structure have 6 data type it is static, dynamic, linear, non linear, primitive, non primitive.That have 5 example of data structures it is array, stack, tree, queue, linked list

I have learn how to get the different between three structure, include:

2023-09-06 03:06:46 UTC

Structure name.
Structure member.
Variable structure.

2023-09-06 03:07:39 UTC

I learn about struct name , data member, and object/ structure variable

Learn about type of data structures and how to write data structures

2023-09-06 03:08:39 UTC

Saya berlajar tentang :

2023-09-06 03:09:54 UTC

Array ,Type of structure ,Type of data structure

Data structures

2023-09-06 03:11:18 UTC

I learn about what data structures and what example it

Chapter 1

2023-09-06 03:13:03 UTC

I learn about what data structures and what example it

Saya bljr tentang list and linked list dan node dan head , null

2023-09-20 02:37:37 UTC

Ada insert , delete, retrieval dan traversal

2023-09-20 02:38:01 UTC

2023-09-20 02:38:25 UTC

i learn how to differentiate push (insert) , pop (delete) , top (atas), isempty (kosong) and isfull (penuh)

List operation :

2023-09-20 02:38:50 UTC

Insertion,deletion,traversal, retrieval

belajar list, linear linked list, singly linked list, doubly linked list, circular linked list, doubly circular linked list

2023-09-20 02:38:58 UTC

2023-09-20 02:39:04 UTC

Saya bljr tentang Stack, LIFO dan Top , Push Pop

Node ada 2 iaitu data dan next

2023-09-20 02:39:10 UTC

2023-09-20 02:39:47 UTC

Ada array stack dan linked list stack utk array ada size dan list xde size

2023-09-20 02:39:52 UTC

push = masuk
pop = buang

2023-09-20 02:39:57 UTC

I learned about operation in linked list and list, the difference between them and type of linked list

2023-09-20 02:40:05 UTC

There is list and linked list. list have 4 operations while linked list have 5 operations. There are differences between the two and linked list have types.

2023-09-20 02:40:36 UTC

operation of linked list
1. create node
2.create linked list
3.check linked list
4.insert node in the list
5.delete node in the list

Topic 3

2023-09-20 02:41:40 UTC

I get knowledge about linked list and I can draw stack with correct.

2023-09-20 02:41:48 UTC

I learned about protcol in LIFO

2023-09-20 02:43:39 UTC

Stack basically is we put things on top that apply concept LIFO(Last In First Out). It have 5 operations and there are two potential problems might occur.

2023-09-26 03:49:26 UTC

i learn that queue has 4 operation:
Enqueue
Dequeue
isFull
isEmpty

Can be do in Array, Linked List, and Stack

Queue

rinithatamilselvam20 — 2023-09-26 03:51:16 UTC

- first in first out(item)
-enqueue(insert)(f)
-dequeue(delete)(r-last or after last)
-implementation(array,stack,linked list)

Queue

2023-09-26 03:55:46 UTC

Queue is a typical waiting line. Can access both ends. Add at the back and delete at the front. Using concept FIFO. Can implement using array,stack and linked list.

Insert data

2023-09-26 03:55:51 UTC

Rear +1

Delete data

Front +1

QUEUE

mfmuhdfarhan777 — 2023-09-26 03:56:48 UTC

i understand that queue use front to delete and rear to insert

2023-09-26 03:57:11 UTC

We can do 3 implementation using queue. The implementation is stack, stack, and linked list

Queue

2023-09-26 03:57:27 UTC

Queue in stack
Queue in linked list
Queue in circular list

2023-09-26 03:57:44 UTC

delete at the front
insert at the back

2023-09-26 03:57:53 UTC

I learn about Queue , how to Dequeu and Enqueu

2023-09-26 03:58:05 UTC

Understand queue , how to draw

2023-09-26 03:58:21 UTC

I learn about queue and circular queue

2023-09-26 03:58:36 UTC

FIRST IN FIRST OUT

2023-09-26 03:59:02 UTC

I learn about queue, that can be used with array, linked list and stack, btw today i can spell queue correctly

2023-09-26 03:59:08 UTC

Implementation of queue
-stack
-Array
-Linked list

2023-09-26 03:59:13 UTC

we learn about aray and how to convert stack into linklist in queue.

Know about

2023-09-26 03:59:35 UTC

-queue
-stack
Link list

Kenal tentang cara masuk item dlm circulars using concept queue

2023-09-26 04:00:11 UTC

2023-09-26 04:01:36 UTC

i learn for queue is enqueue & dequeue , isempty and isfull

ooijy03 — 2023-09-26 04:08:11 UTC

Concept of queue is first in first out
Enqueus is insert item
Dequeue is remove item

Queue

2023-09-26 04:58:59 UTC

Delete at front, insert at back

Tree

2023-11-01 13:05:10 UTC

nilai kecil belah kiri

nilai besar @ sama dengan belah kanan

Response

2023-11-01 13:05:32 UTC

Delete node kalau kiri amik besar

Delete node kalau kanan amik kecik

tree

2023-11-01 13:06:13 UTC

binary tree

-root

-left subtree/right subtree

-left child/right child

Tree

2023-11-01 13:06:32 UTC

Binary tree

Insert node

Delete node

2023-11-01 13:07:16 UTC

Saya belajar tentang delete node, insert node, binary tree

2023-11-01 13:07:42 UTC

preorder , inorder , postorder . 3 ni berlainan arah node

2023-11-01 13:07:59 UTC

Tree. Nonlinear. Have node,root,parent,child,sibling,leaf.

Binary tree.Maximum of 2 children. Operations are tree traversal,insert node,delete node.

tree traversal

2023-11-01 13:08:06 UTC

preorder - sebelum

inorder - tengah

postorder - selepas

Untuk binary tree,anak dia mesti tak boleh lebih daripada 2.

2023-11-01 13:08:18 UTC

Untuk tree arrangement,nombor yang lebih kecil daripada root akan dimasukkan panda bahagian kiri,yang lebih besar daripada root akan pergi ke kanan

Binary Tree

2023-11-01 13:08:30 UTC

A binary tree is a tree data structure composed of nodes, each of which has at most, two children, referred to as left and right nodes.

concepts of tree

2023-11-01 13:08:43 UTC

root : top
parent : atleast one child
child : got parents
leaf : end
siblings : 2 or more with same parent

2023-11-01 13:09:12 UTC

-yg faham

Root blh ada 1 ja
Leaf yg ada pada hujung node dn tk ada child bwh dia

-binary tree

Mula hilang duplicate
Lps tu bhgi yg mana kecil kiri yg besar kanan

-traversal tree

preorder sblm
Inorder skrg
Postorder selepas

tree

2023-11-01 13:09:16 UTC

-binary tree

-nilai kecik sebelah kiri

-nilai besar sebelah kanan

Tree

2023-11-01 13:10:04 UTC

Preoder = sebelum

Inorder = tengah

Postorder = selepas

2023-11-01 13:10:04 UTC

tree - boleh ada banyak children

Binary tree - ada 2 children sahaja

Right tree - kalau nak delete node ambik ganti no yang paling besar

Left tree - kalau nak delte node ganti no yang kecik

2023-11-01 13:10:11 UTC

Preorder , inorder , postorder

2023-11-01 13:10:49 UTC

Tree is a non-linear structure. Binary tree every node can have a maximum of 2 children.Binary Tree Operation have siblings,tree traversal,insert node,delete node ,search node,copy tree

Tree traversal

2023-11-01 13:11:11 UTC

Preorder

Belah kiri dan start dari root

Inorder

Bawah dan start dari kiri sekali

Postorder

Belah kanan dan start dari root

2023-11-21 02:09:45 UTC

ada 5 sorting

insertion sort
merge sort
quick sort
selection sort
bubble sort

Type of sorting

2023-11-21 02:10:05 UTC

1.Selection sort

2.Insertion sort

3.Bubble sort

4.Quick sort

5.Merge sort

Searching

2023-11-21 02:10:40 UTC

Linear search method
Binary search method

2023-11-21 02:10:52 UTC

Sorting

Bubble sort
Selection sort
Insertion sort
Quick sort
Merge sort

Searching

Linear search
Binary search

2023-11-21 02:11:07 UTC

searching

linear search

binary search

Sorting and searching

2023-11-21 02:11:41 UTC

Sorting is basically arrange a sequence of datas.There are 5 types of sorting.Selection,insertion,bubble,merge and quick sort.

Searching is finding a target key in a sequence of data. There are 2 types of searching.Linear and non-linear.

SORTING & SEARCHING

2023-11-21 02:11:56 UTC

5 types of sorting

2 types of searching

SORTING & SEARCHING

2023-11-21 02:12:31 UTC

Sorting

i) selection sort

ii) insertion sort

iii) bubble sort

iv) merge sort

v) quick sort

Searching

i)linear search

ii) binary search

Two types of searching algorithm:

2023-11-21 02:12:39 UTC

i) Linear search

ii) Binary search

types of sorting

2023-11-21 02:12:43 UTC

selection : compare & swap
insertion palang
bubble : compare sebelah, one by one
merge : pecah stay, gabung susun
quick : choose pivot

searching

linear : random number, one by one
binary : sorting number, (1st index+ last index) / 2

sorting and searching

hannanisheikh — 2023-11-21 02:12:51 UTC

-binary search

-linear search

-merge sort

-selection sort

-bubble sort

-insertion sort

-quick sort

Bubble sort

2023-11-21 02:13:32 UTC

Bubble sort is the slowest type of sort

sorting & searching

2023-11-21 02:14:21 UTC

sorting

•selection

•bubble

•quick

•merge

•insertation

searching

•linear

•binary

Sorting & Searching

2023-11-21 02:15:20 UTC

Type of sorting

Selection
Insertion
Bubble
Merge
Quick

Searching

Binary
Linear

2023-11-21 02:17:32 UTC

Five type of sorting

selection sort
insertion sort
bubble sort
merge sort
quick sort.

Two types of searching algorithm

-Linear search

-Binary search