# data[].attributes.body
B031510239 B B D C C C D C A A B D A A C

# data[].attributes.attachment_link.readable_text
B031610227 C A D C C C A C A D B C B A C

# data[].attributes.body
b031510341  A B D C C C C C A D C C C A C

# data[].attributes.body
answer

# data[].attributes.attachment_link.readable_text
B031610246 C B D C C C C D A B C C B C C 

# data[].attributes.body
B031510309 A B D C C C C C A D C C C A C

# data[].attributes.attachment_link.readable_text
B031610198 A B D C C C C C B D C C B D C 

# data[].attributes.attachment_link.readable_text
b031610156 A B D C C C C C A D C C C D C 

# data[].attributes.attachment_link.readable_text
B031610072   A B D C C C C C A D D C D C C   

# data[].attributes.body
B031610122 B B D C C C C C A D A C B D C

# data[].attributes.attachment_link.readable_text
B031610271 A B D C C C C C A D C C A D C 

# data[].attributes.attachment_link.readable_text
B031510335 A B D C C C C D A D C D C A c

# data[].attributes.attachment_link.readable_text
B031610219 A B D C C C C C A D C C B D C 

# data[].attributes.attachment_link.readable_text
B031610040 C B D C C C C C B A C C C A C

# data[].attributes.attachment_link.readable_text
B 031610209  A B D A C C C A A D C C B D C 


# data[].attributes.attachment_link.readable_text
B031610131 A B D C C C C D B C C C D D C

# data[].attributes.attachment_link.readable_text
B031510020 A B D C C C C D A D C C C A C 

# data[].attributes.attachment_link.readable_text
B031610102 A B D C C C C C A D C C B D C 

# data[].attributes.attachment_link.readable_text
B031610136 B B D C C C C C B D A C B D C 

# data[].attributes.attachment_link.readable_text
B031610139 A B D C C C C D A C A C B D C

# data[].attributes.attachment_link.readable_text
B031610125	A	B	D	C	C	C	C	D	A	A	B	C	B	D	C

# data[].attributes.body
ANSWER

# data[].attributes.attachment_link.readable_text
B031610223 A B D C C C C C B A C C C A C 

# data[].attributes.attachment_link.readable_text
B031610434		C B D C C C B C A A C C A A C

# data[].attributes.attachment_link.readable_text
B0301610138 A B D C C C C C A C B C B D C 

# data[].attributes.attachment_link.readable_text
B031610228 A B D C C C C C A D C C B D C 

# data[].attributes.attachment_link.readable_text
B031610082 A A D C C C C A A D C A A A C 

# data[].attributes.body
BITZ pretest answer

# data[].attributes.attachment_link.readable_text
B031610128  A B D C C C D C A A A D B A C 

# data[].attributes.body
ans

# data[].attributes.attachment_link.readable_text
B031610044 A B D C C C C C A D C C C A C 

# data[].attributes.body
B031610150   B B D C C C C C A D A C D A C

# data[].attributes.attachment_link.readable_text
B031610150   B B D C C C C C A D A C D A C 

# data[].attributes.attachment_link.readable_text
B031610166 B B B C C C C C A D C C D D C

# data[].attributes.body
B031610439 B B D C C C C C B D B C D A C

# data[].attributes.attachment_link.readable_text
B031610439 B B D C C C C C B D B C D A C

# data[].attributes.body
the anwer of quiz

# data[].attributes.attachment_link.readable_text
B031610046 A B D C C C C A A A D C C A C 

# data[].attributes.attachment_link.readable_text
B031610270 C B D C C C C C A D C C D B A

# data[].attributes.body
The answer of the pretest

# data[].attributes.attachment_link.readable_text
//One Dimensional Array
#include <iostream>
using namespace std;
int main()
{
	const int size = 5;
	double price[size], cost[size];
	double total = 0, average = 0;
	int unit[size];
	cout << "Enter price and unit for " << size
		<< " item:\n";
		
	for (int i=0; i < size; i++) 
	{
		cout << "Item price " << i + 1 << ": " ;
		cin >> price[i];
		cout << "Item unit " << i + 1 << ": " ;
		cin >> unit[i];
		cost[i] = price[i] * unit [i];
		total += cost[i];
		average = total / size;
	}
	
	cout << "\n\tPrice" << "\tUnit" << "\tCost\n";

	for (int a=0; a < size; a++)
	{
		cout << "\t" << price[a] << "\t" << unit[a]
				<< "\t" << cost[a] << "\n";
	}
		cout << "\nTotal\t\t\t" << total << endl;
		cout << "\nAverage : " << average << endl;

	return 0;
} //end main

# data[].attributes.body
Download the file and answer the question.

# data[].attributes.body
Download and Complete the code given.

# data[].attributes.body
Complete List.h as given in attachment

# data[].attributes.attachment_link.readable_text
//File List.h
//By Muhammd Suryanata - FTMK UTem
//email: muhammad.suryanata@utem.edu.my
// date: 4 Aug 2016

#ifndef LIST_H
#define LIST_H

const int MAXIMUMSIZE = 1000;

template <class T>		//indicates this is a template definition
class List{				//declaration for the class List

	private:
	int number_of_item;
	T array[MAXIMUMSIZE];
	
	public:
	List();
	~List();
	int get_number_of_item();
	void add_item(T item); //add item to rear
	
	void insert (T item, int indexWanted); //add item at indexWanted

	T get_item(int indexItem);
	void update_item(T updated_item, int indexItem); //to update item at indexITem
	
	//delete methods:
	void delete_item(); //delete last item
	void delete_item(int indexWanted); //delete item at indexWanted
	bool delete_target(T target); //delete target in the list.
	
	
	//Search methods:
	//to find item or target in the List, return true if found, otherwise false.
	bool find_item(T target, int& indexWanted); 

	

}; //end class
#endif


//body or definition for each methods
#include <iostream>
using namespace std;


template <class T>
List<T>::List()
{
	number_of_item = 0;
}

template <class T>
List<T>::~List() { }

template <class T>
int List<T>::get_number_of_item()
{
	//write your code below:
	
}

template <class T>
void List<T>::add_item(T item)
{
	//write your code below:
	
} //end add_item



//add item at indexWanted
template <class T>
void List<T>::insert (T item, int indexWanted)
{
	//write your code below:
	
} //end insert

//delete last item in the list
template <class T>
void List<T>::delete_item()
{
	//write your code below:

} //end delete_item


//delete last item at indexWanted
template <class T>
void List<T>::delete_item(int indexWanted)
{
	//write your code below:
	
} //end delte_item

//delete target in the list
template <class T>
bool List<T>::delete_target(T target)
{
	//write your code below:
	
} //end delete_target(T target)



//to find item or target in the List, return true if found 
//and output indexWanted,
//otherwise false.
template <class T>
bool List<T>::find_item(T target, int& indexWanted)
{
	//write your code below:

} //end find_item



template <class T>
T List<T>::get_item(int indexItem)
{
	//write your code below:
}


template <class T>
void List<T>::update_item(T updated_item, int indexItem)
{
	//write your code below:

} //end void update_item(T updated_item, indexItem)






# data[].attributes.body
Refer to page 94:
type Stack.h

Refer to page 110:
Write a program to convert binary to decimal.

# data[].attributes.body
https://www.cs.usfca.edu/~galles/visualization/DFS.html

# data[].attributes.body
What are the results of Preorder, Inorder and Postorder traversals for the tree of the expression below.

# data[].attributes.body
https://padlet.com/firdausabdullah/datastructure

# data[].attributes.body
https://padlet.com/syasyakira95/DataStructure

# data[].attributes.headline
Senarai Tampal Pelajar DIT Sem2 2015/2016

# data[].attributes.subject
Senarai Tampal Pelajar DIT Sem2 2015/2016

# data[].attributes.body
1. You have to learn 2 lectures and labs.
2. Write two questions and answers for each LO (LO1 and LO2) per lecture:
Example:
Lecture1 & Lab1-ONE QA for LO1 and ONE QA for LO2.
Lecture2 & Lab2-ONE QA for LO1 and ONE QA for LO2.

3. Upload or post in your padlet wall.

Note: QA = Question and Answer.

# data[].attributes.body
https://padlet.com/azreeaniazman/DataStructure

# data[].attributes.body
https://padlet.com/nadianaim318/DataStructure

# data[].attributes.body
https://padlet.com/Hafizah_Ismail/datastructure
B031310266

# data[].attributes.body
https://padlet.com/kyna93/datastructure
B031310214

# data[].attributes.body
https://padlet.com/atikahnaim15/DataStructure

# data[].attributes.headline
LO for BITP1123 Data Structure and Algorithm

# data[].attributes.subject
LO for BITP1123 Data Structure and Algorithm

# data[].attributes.body
1.0    LEARNING Outcomes

Upon completion this course, students will be able to:

i.    Illustrate the algorithm design and performance for different abstract data type operation. (C2, A2)

ii.    Apply the suitable data structures for an application that requires data structures. (C3, CTPS1)

iii.    Construct the data structures and algorithms in problem solving. (P4, LL1,CS1).

# data[].attributes.headline
Senarai Tampal Pelajar BITZ Sem2 2015/2016

# data[].attributes.subject
Senarai Tampal Pelajar BITZ Sem2 2015/2016

# data[].attributes.body
Stack: Stack(), Push(T item), Pop(), StackTop(), Empty().
Queue: Enqueu(T Item), Dequeue(), Empty(), Full(),  queueFront(), queueRear().
Circular Queue.
Stack, Queue and Circular Queue are implemented using ARRAY.
Tree: binary tree, preorder traversal, inorder traversal, postorder traversal.
Graph: digraph, breadth-first traversal, maximum heap, minimum heap, draw the heap from the array.

# data[].attributes.body
Illustrate means draw the diagram/figure.
Identify means determine.
dequeue the element means number_of_item = number_of_item -1.
"show the step" draw the diagram for each step.

# data[].attributes.body
sir macam mana nak jawab soaln nie
Jawab:
F - HI - GD - EBA - C

# data[].attributes.body
Tolong hantar CD yang sudah ada assignment 1 dan assignment2 dalam kadar segera.

# data[].attributes.headline
DIT - Student: Latihan Peperiksaan Akhir

# data[].attributes.subject
DIT - Student: Latihan Peperiksaan Akhir

# data[].attributes.body
Download and try to answer. If you have any problems, then write your questions on the padlet wall.

# data[].attributes.body
Pelajar di bawah ini:
1. AZURA A/P TAN
2. FARAH SYAHIRAH BINTI GHAPAR
3. NURUL IZZATI BINTI AHMAD
4. NORSHAZLYANA BINTI HARITH FAIZAN
5. NORHAYATI ANAK MATAU
Sila berjumpa saya pada:
Hari Jumaat, 17 Jun 2016 pukul 10.00
di lobi FTMK.

# data[].attributes.body
Dear Students,
Your Lab Test will be scheduled as follows:
Day/Date: Thursday, 26 May 2016
Time: 11.00 - 13.00
Makmal: MKP2

Please be kindly informed.
Thank you.

# data[].attributes.body
Dear DIT Students,
Due to technical problems, the lecture will be held at Dewan Seminar.
Please be kindly informed.

Sorry for the short notice.
Thank you.

# data[].attributes.body
The system will simulate and calculate average_customer_waiting_time.

There are 5 tellers and one queue of customers. The system runs with assumption every minute one customer come to the bank. The customer will take queue number and will wait for his or her turn.

Modified the needed files using the system time. Customer's arrival time will be recorded based on the current time. Refer to thebankv2.exe.

Download the rar file "ass02.rar"  below and Extract the file in the same folder.

Open command prompt by double click "go.bat" or  by typing cmd [enter] . Once the command prompt opened, you can run thebank.exe by typing thebank.exe {enter].

# data[].attributes.headline
Lecture: Replacement Lecture (Monday, 2 May 2016)

# data[].attributes.subject
Lecture: Replacement Lecture (Monday, 2 May 2016)

# data[].attributes.body
S1G2 : Thursday, 5 May 2016 09.00 -11.00, Dewan Seminar.
S2G1: Friday, 6 May 2016 10.00-12.00, BK2.QUIZ will be conducted during the sessions.Please be kindly informed.