HiIm Michael im here to study ICT with

Project Assignment Instructions Digital Design (Quartus II & ModelSim)

You are required to complete a full digital design project that includes design, implementation, simulation, report writing, and presentation. The project consists of two main sections: Dice Game and GCD Calculator. Make sure all work is accurate, complete, and professionally presented.

—

# Section 1: Electronic Dice Game Design

Design and implement an electronic dice game using VHDL based on the given rules.

## Steps to follow:

### 1. Understand the System

– Two counters simulate two dice (values from 1 to 6).

– The sum ranges from 2 to 12.

– Apply the game rules exactly as described.

—

### 2. Design the System Architecture

You must divide the system into:

– Data Path:

– Two counters (16)

– Adder (sum)

– Comparator

– Point Register

– Control Unit (FSM):

– Design an ASM (Algorithmic State Machine)

—

### 3. FSM States (Required)

Include at least the following states:

– IDLE

– ROLL

– CHECK_FIRST

– STORE_POINT

– CHECK_NEXT

– WIN

– LOSE

—

### 4. VHDL Implementation

– Write clean, modular VHDL code:

– Separate files for datapath and control unit

– Use meaningful signals and proper naming

– Add clear comments

—

### 5. Simulation (ModelSim)

– Create a testbench

– Verify:

– Dice rolling

– Sum calculation

– Win/Lose conditions

– Provide waveform screenshots

—

—

# Section 2: GCD Calculator Design

Design a digital circuit to compute the GCD of two N-bit numbers (e.g., 8-bit) using the Euclidean algorithm.

—

## Steps to follow:

### 1. Understand the Algorithm

Repeat:

– If A < B B = B – A

– Else A = A – B

Until A = B

—

### 2. Design the Architecture

– Registers: A, B

– Subtractor

– Comparator

– MUX

– Control Unit (FSM)

—

### 3. FSM States

– IDLE

– LOAD

– COMPARE

– SUBTRACT

– DONE

—

### 4. VHDL Implementation

– Modular design (datapath + control unit)

– Use clocked processes

– Ensure correct reset behavior

—

### 5. Simulation

– Apply different test cases

– Show:

– Input values

– Iterations

– Final GCD

– Done signal

—

—

# Quartus II Requirements

– Compile all designs successfully

– Show:

– RTL Viewer screenshots

– No critical errors

—

# ModelSim Requirements

– Full simulation for both sections

– Include waveform results

– Clearly label signals

—

—

# Report Requirements (Max 10 Pages)

## Must include:

### 1. Introduction

– Brief explanation of both systems

### 2. Design Approach

– Explain architecture (datapath + control)

– Include block diagrams

### 3. ASM / FSM Diagrams

– Clearly drawn and explained

### 4. VHDL Code

– Well-commented

– Organized into modules

### 5. Simulation Results

– Waveforms (ModelSim)

– Explanation of results

### 6. Discussion

– Challenges faced

– How they were solved

—

—

# Presentation Requirements

## Slides must include:

1. Project Title & Team Members

2. Overview of Dice Game

3. Dice Game Design (FSM + Diagram)

4. Simulation Results

5. GCD Algorithm Explanation

6. GCD Hardware Design

7. Simulation Results

8. Conclusion

—

## Important:

– Include live demonstration (Quartus or ModelSim)

– Each member must explain their part

– Keep slides simple and visual

—

—

# Work Quality Requirements

– No errors in logic

– Clean and readable code

– Accurate simulations

– Professional report formatting

– Clear explanation in presentation

—

—

# Final Deliverables

– VHDL files (Dice + GCD)

– ModelSim simulations

– Report (WORD, 10 pages)

– Presentation slides

– Demonstration ready

—

Make sure everything is complete, tested, and matches the assignment requirements exactly before submission.

Description and Instructions

1. Objective

The primary objective of this project is to gain proficiency in the design and development of algorithmic solutions through the application of data structures concepts.

2. Introduction

In this project, student groups will collaboratively solve a problem designed to assess their comprehension of data structures. Each group, consisting of three to four students, will consolidate their work into a single report, which will be submitted alongside the other project materials.

3. Required work

Select an algorithmic problem pertaining to data structure concepts (specifically one covered during class lectures) and formulate a comprehensive problem statement addressing it.

Examples of project topics:

Problem Name	Problem Description
Task Scheduling System	Schedule tasks while respecting priorities or arrival orders.
Route Planning System	Determine the optimal route between two locations on a given map.
Dictionary Word Lookup	Check whether words exist in a dictionary (set of sample words) and suggest corrections.
Book Inquiry System	Organize, search, and retrieve book names.

1. Choose a project from the table provided above or propose an original project idea.
2. Analyze and comprehend the selected problem thoroughly.
3. Implement at least two different solutions to the problem using data structures.
4. At least one data structure must be incorporated into each proposed solution.
5. Solutions must be implemented in separate methods, and they should be demonstrated and tested in a main method.
6. Provide a comprehensive analysis of the algorithmic complexity for both implemented solutions.

Note: You may choose a project from the table above or propose an original idea. If you propose your own topic, you must receive confirmation from your instructor before proceeding.

4. What to submit?

1.Project Report

a)Describe the problem.

b)Describe the algorithm used to solve the problem.

c)Analyze the algorithmic complexity of your solutions.

d)Screenshots showing the output produced during program execution.

2.Source Code

A complete, executable Java program.

The source code must be well documented.

Marking Criteria

#	Criteria	Marks
1	Project Report	6
1.1	Description of the problem	1
1.2	Description of the algorithm used in solution 1	1
1.3	Description of the algorithm used in solution 2	1
1.4	Analysis of the algorithm complexity of your solution 1	1
1.5	Analysis of the algorithm complexity of your solution 2	1
1.6	Screenshots	1
2	Source Code	8
2.1	Java code to solve the problem. (Solution 1)	3
2.2	Java code to solve the problem. (Solution 2)	3
2.3	A main method to demonstrate and test the solutions.	2
Total		14

Annual Report FY [Year] [Add a quote here from one of your company executives or use this space for a brief summary of the document content.]

Data Structure IT245

Instructions:

You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format. It is your responsibility to check and make sure that you have uploaded both the correct files. Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation). Email submission will not be accepted. You are advised to make your work clear and well-presented. This includes filling your information on the cover page. You must use this template, failing which will result in zero mark. You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question. Late submission will result in ZERO mark. The work should be your own, copying from students or other resources will result in ZERO mark. Use Times New Roman font for all your answers.

Name: Name: Name: ID: ID: ID:

CLO6: Illustrate data structure problems and their designed solutions in the form of a group project.

Description and Instructions

1. Objective

The primary objective of this project is to gain proficiency in the design and development of algorithmic solutions through the application of data structures concepts.

2. Introduction

In this project, student groups will collaboratively solve a problem designed to assess their comprehension of data structures. Each group, consisting of three to four students, will consolidate their work into a single report, which will be submitted alongside the other project materials.

3. Required work

Select an algorithmic problem pertaining to data structure concepts (specifically one covered during class lectures) and formulate a comprehensive problem statement addressing it.

Examples of project topics:

Problem Name	Problem Description
Task Scheduling System	Schedule tasks while respecting priorities or arrival orders.
Route Planning System	Determine the optimal route between two locations on a given map.
Dictionary Word Lookup	Check whether words exist in a dictionary (set of sample words) and suggest corrections.
Book Inquiry System	Organize, search, and retrieve book names.

1. Choose a project from the table provided above or propose an original project idea.
2. Analyze and comprehend the selected problem thoroughly.
3. Implement at least two different solutions to the problem using data structures.
4. At least one data structure must be incorporated into each proposed solution.
5. Solutions must be implemented in separate methods, and they should be demonstrated and tested in a main method.
6. Provide a comprehensive analysisof the algorithmic complexity for both implemented solutions.

Note: You may choose a project from the table above or propose an original idea. If you propose your own topic, you must receive confirmation from your instructor before proceeding.

4. What to submit?

• Project Report
• Source Code

• Describe the problem.
• Describe the algorithm used to solve the problem.
• Analyze the algorithmic complexity of your solutions.
• Screenshots showing the output produced during program execution.

• A complete, executable Java program.
• The source code must be well documented.

Marking Criteria

#	Criteria	Marks
1	Project Report	6
1.1	Description of the problem	1
1.2	Description of the algorithm used in solution 1	1
1.3	Description of the algorithm used in solution 2	1
1.4	Analysis of the algorithm complexity of your solution 1	1
1.5	Analysis of the algorithm complexity of your solution 2	1
1.6	Screenshots	1
2	Source Code	8
2.1	Java code to solve the problem. (Solution 1)	3
2.2	Java code to solve the problem. (Solution 2)	3
2.3	A main method to demonstrate and test the solutions.	2
Total		14

ATTACHMENTS

Annual Report FY [Year] [Add a quote here from one of your company executives or use this space for a brief summary of the document content.]

Data Structure IT245

Instructions:

You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format. It is your responsibility to check and make sure that you have uploaded both the correct files. Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation). Email submission will not be accepted. You are advised to make your work clear and well-presented. This includes filling your information on the cover page. You must use this template, failing which will result in zero mark. You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question. Late submission will result in ZERO mark. The work should be your own, copying from students or other resources will result in ZERO mark. Use Times New Roman font for all your answers.

Name: Name: Name: ID: ID: ID:

CLO6: Illustrate data structure problems and their designed solutions in the form of a group project.

Description and Instructions

1. Objective

The primary objective of this project is to gain proficiency in the design and development of algorithmic solutions through the application of data structures concepts.

2. Introduction

In this project, student groups will collaboratively solve a problem designed to assess their comprehension of data structures. Each group, consisting of three to four students, will consolidate their work into a single report, which will be submitted alongside the other project materials.

3. Required work

Select an algorithmic problem pertaining to data structure concepts (specifically one covered during class lectures) and formulate a comprehensive problem statement addressing it.

Examples of project topics:

Problem Name	Problem Description
Task Scheduling System	Schedule tasks while respecting priorities or arrival orders.
Route Planning System	Determine the optimal route between two locations on a given map.
Dictionary Word Lookup	Check whether words exist in a dictionary (set of sample words) and suggest corrections.
Book Inquiry System	Organize, search, and retrieve book names.

1. Choose a project from the table provided above or propose an original project idea.
2. Analyze and comprehend the selected problem thoroughly.
3. Implement at least two different solutions to the problem using data structures.
4. At least one data structure must be incorporated into each proposed solution.
5. Solutions must be implemented in separate methods, and they should be demonstrated and tested in a main method.
6. Provide a comprehensive analysis of the algorithmic complexity for both implemented solutions.

Note: You may choose a project from the table above or propose an original idea. If you propose your own topic, you must receive confirmation from your instructor before proceeding.

4. What to submit?

• Project Report
• Source Code

• Describe the problem.
• Describe the algorithm used to solve the problem.
• Analyze the algorithmic complexity of your solutions.
• Screenshots showing the output produced during program execution.

• A complete, executable Java program.
• The source code must be well documented.

Marking Criteria

#	Criteria	Marks
1	Project Report	6
1.1	Description of the problem	1
1.2	Description of the algorithm used in solution 1	1
1.3	Description of the algorithm used in solution 2	1
1.4	Analysis of the algorithm complexity of your solution 1	1
1.5	Analysis of the algorithm complexity of your solution 2	1
1.6	Screenshots	1
2	Source Code	8
2.1	Java code to solve the problem. (Solution 1)	3
2.2	Java code to solve the problem. (Solution 2)	3
2.3	A main method to demonstrate and test the solutions.	2
Total		14

Annual Report FY [Year] [Add a quote here from one of your company executives or use this space for a brief summary of the document content.]

Data Structure IT245

Instructions:

You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format. It is your responsibility to check and make sure that you have uploaded both the correct files. Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets, convert text into image or languages other than English or any kind of manipulation). Email submission will not be accepted. You are advised to make your work clear and well-presented. This includes filling your information on the cover page. You must use this template, failing which will result in zero mark. You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question. Late submission will result in ZERO mark. The work should be your own, copying from students or other resources will result in ZERO mark. Use Times New Roman font for all your answers.

Name: Name: Name: ID: ID: ID:

CLO6: Illustrate data structure problems and their designed solutions in the form of a group project.

Description and Instructions

1. Objective

The primary objective of this project is to gain proficiency in the design and development of algorithmic solutions through the application of data structures concepts.

2. Introduction

In this project, student groups will collaboratively solve a problem designed to assess their comprehension of data structures. Each group, consisting of three to four students, will consolidate their work into a single report, which will be submitted alongside the other project materials.

3. Required work

Select an algorithmic problem pertaining to data structure concepts (specifically one covered during class lectures) and formulate a comprehensive problem statement addressing it.

Examples of project topics:

Problem Name	Problem Description
Task Scheduling System	Schedule tasks while respecting priorities or arrival orders.
Route Planning System	Determine the optimal route between two locations on a given map.
Dictionary Word Lookup	Check whether words exist in a dictionary (set of sample words) and suggest corrections.
Book Inquiry System	Organize, search, and retrieve book names.

1. Choose a project from the table provided above or propose an original project idea.
2. Analyze and comprehend the selected problem thoroughly.
3. Implement at least two different solutions to the problem using data structures.
4. At least one data structure must be incorporated into each proposed solution.
5. Solutions must be implemented in separate methods, and they should be demonstrated and tested in a main method.
6. Provide a comprehensive analysis of the algorithmic complexity for both implemented solutions.

Note: You may choose a project from the table above or propose an original idea. If you propose your own topic, you must receive confirmation from your instructor before proceeding.

4. What to submit?

• Project Report
• Source Code

• Describe the problem.
• Describe the algorithm used to solve the problem.
• Analyze the algorithmic complexity of your solutions.
• Screenshots showing the output produced during program execution.

• A complete, executable Java program.
• The source code must be well documented.

Marking Criteria

#	Criteria	Marks
1	Project Report	6
1.1	Description of the problem	1
1.2	Description of the algorithm used in solution 1	1
1.3	Description of the algorithm used in solution 2	1
1.4	Analysis of the algorithm complexity of your solution 1	1
1.5	Analysis of the algorithm complexity of your solution 2	1
1.6	Screenshots	1
2	Source Code	8
2.1	Java code to solve the problem. (Solution 1)	3
2.2	Java code to solve the problem. (Solution 2)	3
2.3	A main method to demonstrate and test the solutions.	2
Total		14

What is graphical representation of an algorithm

1) Matrix 2) Graph

3) Flowchart 4) Solution

Project Assignment Instructions Digital Design (Quartus II & ModelSim)

You are required to complete a full digital design project that includes design, implementation, simulation, report writing, and presentation. The project consists of two main sections: Dice Game and GCD Calculator. Make sure all work is accurate, complete, and professionally presented.

—

# Section 1: Electronic Dice Game Design

Design and implement an electronic dice game using VHDL based on the given rules.

## Steps to follow:

### 1. Understand the System

– Two counters simulate two dice (values from 1 to 6).

– The sum ranges from 2 to 12.

– Apply the game rules exactly as described.

—

### 2. Design the System Architecture

You must divide the system into:

– Data Path:

– Two counters (16)

– Adder (sum)

– Comparator

– Point Register

– Control Unit (FSM):

– Design an ASM (Algorithmic State Machine)

—

### 3. FSM States (Required)

Include at least the following states:

– IDLE

– ROLL

– CHECK_FIRST

– STORE_POINT

– CHECK_NEXT

– WIN

– LOSE

—

### 4. VHDL Implementation

– Write clean, modular VHDL code:

– Separate files for datapath and control unit

– Use meaningful signals and proper naming

– Add clear comments

—

### 5. Simulation (ModelSim)

– Create a testbench

– Verify:

– Dice rolling

– Sum calculation

– Win/Lose conditions

– Provide waveform screenshots

—

—

# Section 2: GCD Calculator Design

Design a digital circuit to compute the GCD of two N-bit numbers (e.g., 8-bit) using the Euclidean algorithm.

—

## Steps to follow:

### 1. Understand the Algorithm

Repeat:

– If A < B B = B – A

– Else A = A – B

Until A = B

—

### 2. Design the Architecture

– Registers: A, B

– Subtractor

– Comparator

– MUX

– Control Unit (FSM)

—

### 3. FSM States

– IDLE

– LOAD

– COMPARE

– SUBTRACT

– DONE

—

### 4. VHDL Implementation

– Modular design (datapath + control unit)

– Use clocked processes

– Ensure correct reset behavior

—

### 5. Simulation

– Apply different test cases

– Show:

– Input values

– Iterations

– Final GCD

– Done signal

—

—

# Quartus II Requirements

– Compile all designs successfully

– Show:

– RTL Viewer screenshots

– No critical errors

—

# ModelSim Requirements

– Full simulation for both sections

– Include waveform results

– Clearly label signals

—

—

# Report Requirements (Max 10 Pages)

## Must include:

### 1. Introduction

– Brief explanation of both systems

### 2. Design Approach

– Explain architecture (datapath + control)

– Include block diagrams

### 3. ASM / FSM Diagrams

– Clearly drawn and explained

### 4. VHDL Code

– Well-commented

– Organized into modules

### 5. Simulation Results

– Waveforms (ModelSim)

– Explanation of results

### 6. Discussion

– Challenges faced

– How they were solved

—

—

# Presentation Requirements

## Slides must include:

1. Project Title & Team Members

2. Overview of Dice Game

3. Dice Game Design (FSM + Diagram)

4. Simulation Results

5. GCD Algorithm Explanation

6. GCD Hardware Design

7. Simulation Results

8. Conclusion

—

## Important:

– Include live demonstration (Quartus or ModelSim)

– Each member must explain their part

– Keep slides simple and visual

—

—

# Work Quality Requirements

– No errors in logic

– Clean and readable code

– Accurate simulations

– Professional report formatting

– Clear explanation in presentation

—

—

# Final Deliverables

– VHDL files (Dice + GCD)

– ModelSim simulations

– Report (WORD, 10 pages)

– Presentation slides

– Demonstration ready

—

Make sure everything is complete, tested, and matches the assignment requirements exactly before submission.

Step 1-pic two numbers (C+C)

Step 2-sum the numbers C+C=F

step 3- print the number

A logistics company needs to select a subset of items, each with a weight and value, to maximize total value without exceeding a fixed capacity.

Critically evaluate how Dynamic Programming can be applied to solve this problem, and evaluate this approach in comparison with Greedy and Divide and Conquer strategies.

Your discussion should clearly determine:

• how Dynamic Programming solves the problem and why it is suitable
• how Greedy and Divide and Conquer approaches would handle the same problem
• a critical evaluation of the strengths and limitations of each approach
• justification of which strategy is most appropriate and why

• Rubrics:CLO 5: Evaluate dynamic programming, divide and conquer, andgreedy approach strategies for algorithmic design in solving computationalproblems, using critical thinking.

• Evaluation of Dynamic Programming	Thorough and accurate evaluation with strong justification of effectiveness
  Comparison with Greedy & Divide and Conquer	Clear, critical comparison highlighting strengths and limitations of each approach
  Justification & Critical Thinking	Strong reasoning with well-supported conclusions