Task 111 Example Program Program 111c Menu Driven C Program Based Dynamic Memory Allocatio Q43813211

c programming

Task 11.1 - Example Program Program 11.1.c is a menu driven C program based on dynamic memory allocation. On start, this prog.NE. The program should allow the following four options 1. Add new student 2. Display all students Delete student by Id 4. D

Task 11.1 – Example Program Program 11.1.c is a menu driven C program based on dynamic memory allocation. On start, this program displays the following menu 1- Add new item 2- Display items 3. Delete 4. Quit When option 1 is selected, the program reads an integer and store it. When option 2 is selected, the program displays all the stored integers. When option 3 is selected, the program reads an integer and searches for it in the previously stored integers, if found deletes it from the list. When option 4 is selected, the program closes. The program displays the menu repeatedly until option 4 is selected. The program has been designed to store any number of integers. Task 11.2 Rewrite tasks 11.1 by enabling the program to store a structure instead of integer. The structure to be of the following type struct student char name[10]; char id[10] char address(100); .NE. The program should allow the following four options 1. Add new student 2. Display all students Delete student by Id 4. Delete student by Name Quit When option 3 is selected, the program should read a student Id and search for that is in the stored list of student details. If found, that student record should be deleted. Similar approach is to be taken for option 4. Show transcribed image text Task 11.1 – Example Program Program 11.1.c is a menu driven C program based on dynamic memory allocation. On start, this program displays the following menu 1- Add new item 2- Display items 3. Delete 4. Quit When option 1 is selected, the program reads an integer and store it. When option 2 is selected, the program displays all the stored integers. When option 3 is selected, the program reads an integer and searches for it in the previously stored integers, if found deletes it from the list. When option 4 is selected, the program closes. The program displays the menu repeatedly until option 4 is selected. The program has been designed to store any number of integers. Task 11.2 Rewrite tasks 11.1 by enabling the program to store a structure instead of integer. The structure to be of the following type struct student char name[10]; char id[10] char address(100);
.NE. The program should allow the following four options 1. Add new student 2. Display all students Delete student by Id 4. Delete student by Name Quit When option 3 is selected, the program should read a student Id and search for that is in the stored list of student details. If found, that student record should be deleted. Similar approach is to be taken for option 4.

Expert Answer


Answer to Task 11.1 – Example Program Program 11.1.c is a menu driven C program based on dynamic memory allocation. On start, this…

Task 2 125 Marks Identify Analyze Original Boolean Expression Implemented Circuit Shown 1 Q43858746

Task 2 125 marks Identify and analyze the original Boolean expression implemented by the circuit shown: 1. F= ? Express in te

Task 2 125 marks Identify and analyze the original Boolean expression implemented by the circuit shown: 1. F= ? Express in terms of input variables A, B, C 2. Simplify the original Boolean expression using Boolean algebra identities. 3. Show a truth table for the acquired function. 4. Draw a new circuit diagram for the acquired function. Do not forget to label inputs/output, similar to the way they are labeled in the picture above. Show transcribed image text Task 2 125 marks Identify and analyze the original Boolean expression implemented by the circuit shown: 1. F= ? Express in terms of input variables A, B, C 2. Simplify the original Boolean expression using Boolean algebra identities. 3. Show a truth table for the acquired function. 4. Draw a new circuit diagram for the acquired function. Do not forget to label inputs/output, similar to the way they are labeled in the picture above.

Expert Answer


Answer to Task 2 125 marks Identify and analyze the original Boolean expression implemented by the circuit shown: 1. F= ? Express …

Task 2 25 Marks Identify Analyze Original Boolean Expression Implemented Circuit Shown Il Q43861375

Task 2 [25 marks Identify and analyze the original Boolean expression implemented by the circuit shown: IL P NY & 1. F= ? Exp

Task 2 [25 marks Identify and analyze the original Boolean expression implemented by the circuit shown: IL P NY & 1. F= ? Express in terms of input variables A, B, C 2. Simplify the original Boolean expression using Boolean algebra identities. 3. Show a truth table for the acquired function. 4. Draw a new circuit diagram for the acquired function. Do not forget to label inputs/output, similar to the way they are labeled in the picture above. Show transcribed image text Task 2 [25 marks Identify and analyze the original Boolean expression implemented by the circuit shown: IL P NY & 1. F= ? Express in terms of input variables A, B, C 2. Simplify the original Boolean expression using Boolean algebra identities. 3. Show a truth table for the acquired function. 4. Draw a new circuit diagram for the acquired function. Do not forget to label inputs/output, similar to the way they are labeled in the picture above.

Expert Answer


Answer to Task 2 [25 marks Identify and analyze the original Boolean expression implemented by the circuit shown: IL P NY & 1. F= …

Task 2 Create 4 Variables Distinct Data Types Python Language Task 3 Output Variable Conca Q43830769

Task 2

Create 4 variables with distinct data types in Pythonlanguage

Task 3

Output each variable concatenated with a different data type.Variables are those that were created in Task 2. There are sixcombinations possible in Python language

Expert Answer


Answer to Task 2 Create 4 variables with distinct data types in Python language Task 3 Output each variable concatenated with a di…

Task 2 Logbook Based Illustration Iphone Shown Draw System Model Iphone Iphone Components Q43787522

Task 2 [Logbook]: Based on the illustration of an iPhone shown below, draw a system model for an iPhone. iPhone Components Fl

Task 2 [Logbook]: Based on the illustration of an iPhone shown below, draw a system model for an iPhone. iPhone Components Flash memory CPU Main circuit boards Communications – GSM cell, WiFi, EDGE – Battery Display (rear) – Show transcribed image text Task 2 [Logbook]: Based on the illustration of an iPhone shown below, draw a system model for an iPhone. iPhone Components Flash memory CPU Main circuit boards Communications – GSM cell, WiFi, EDGE – Battery Display (rear) –

Expert Answer


Answer to Task 2 [Logbook]: Based on the illustration of an iPhone shown below, draw a system model for an iPhone. iPhone Componen…

Task 2 Maximum Sum Increasing Sub Sequence 4 Marks Create Python Module Called Max Sumpy W Q43861173

Task 2: Maximum sum increasing sub-sequence (4 Marks) Create a Python module called max sum.py. Within this module implementTask 2: Maximum sum increasing sub-sequence (4 Marks) Create a Python module called max sum.py. Within this module implement the following task. (You may not import any other libraries or modules.) Given an non-empty list of integers, write a function max.sum(1st) that return a list of length of 2. The first element in output list should be an integer value representing the greatest sum that can be generated from a strictly increasing sub-sequence in the list. The second element should a list of the numbers in that sub- sequence. A sub-sequence is defined as a set of numbers that are not necessarily adjacent but in the same order as they appear in the list. Assume that there will be only one increasing sub-sequence with the greatest sum. Input: a non-empty list of integers Output: returns a list of length of 2. The first element in output list should be an integer value representing the greatest sum that can be generated from a strictly increasing sub-sequence in the list. The second element should a list of the numbers in that sub-sequence. Examples a) Given lst1=(-1), calling max-sum(1st1), will return (-1,(-1)]. b) Given Ist 2-[10,70,20,30,50,11,30), calling max.sum(1st2), will return [110, [10, 20, 30, 50]]. c) Given 1st 3-[-5, -4,-3,-2,-1), calling max.sum (1st 3), will return (-1, (-1)]. d) Given 1st 4-(10,15,4,5,11,14,31, 25, 31, 23, 25,31,50) calling max.sum (1st4), will return (164, [10, 11, 14, 23, 25, 31, 50]] . Marking Guide (total 4 marks) Marks are given for the correct behaviour of the different functions: (a) 2.0 marks to find all the feasible solutions. 2.0 marks to find the optimal solutions, Show transcribed image text Task 2: Maximum sum increasing sub-sequence (4 Marks) Create a Python module called max sum.py. Within this module implement the following task. (You may not import any other libraries or modules.) Given an non-empty list of integers, write a function max.sum(1st) that return a list of length of 2. The first element in output list should be an integer value representing the greatest sum that can be generated from a strictly increasing sub-sequence in the list. The second element should a list of the numbers in that sub- sequence. A sub-sequence is defined as a set of numbers that are not necessarily adjacent but in the same order as they appear in the list. Assume that there will be only one increasing sub-sequence with the greatest sum. Input: a non-empty list of integers Output: returns a list of length of 2. The first element in output list should be an integer value representing the greatest sum that can be generated from a strictly increasing sub-sequence in the list. The second element should a list of the numbers in that sub-sequence. Examples a) Given lst1=(-1), calling max-sum(1st1), will return (-1,(-1)]. b) Given Ist 2-[10,70,20,30,50,11,30), calling max.sum(1st2), will return [110, [10, 20, 30, 50]]. c) Given 1st 3-[-5, -4,-3,-2,-1), calling max.sum (1st 3), will return (-1, (-1)]. d) Given 1st 4-(10,15,4,5,11,14,31, 25, 31, 23, 25,31,50) calling max.sum (1st4), will return (164, [10, 11, 14, 23, 25, 31, 50]] . Marking Guide (total 4 marks) Marks are given for the correct behaviour of the different functions: (a) 2.0 marks to find all the feasible solutions. 2.0 marks to find the optimal solutions,

Expert Answer


Answer to Task 2: Maximum sum increasing sub-sequence (4 Marks) Create a Python module called max sum.py. Within this module imple…

Task 2 Privacy Copyright Ethics Analyze Technology Issues Surrounding Privacy Copyright Et Q43880302

TASK 2 Privacy, Copyright Ethics Now analyze the technology issues surrounding privacy, copyright and ethics. Discuss how youTASK 2 Privacy, Copyright Ethics Now analyze the technology issues surrounding privacy, copyright and ethics. Discuss how you would handle each issue. Include resources to support your reasoning. Show transcribed image text TASK 2 Privacy, Copyright Ethics Now analyze the technology issues surrounding privacy, copyright and ethics. Discuss how you would handle each issue. Include resources to support your reasoning.

Expert Answer


Answer to TASK 2 Privacy, Copyright Ethics Now analyze the technology issues surrounding privacy, copyright and ethics. Discuss ho…

Task 3 125 Marks Nand Gates Sometimes Referred Universal Gates Meaning Many Copies Used Va Q43861388

Task 3 125 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they

Task 3 125 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they can be used in various configurations to implement any other logic gates (and the Boolean functions they represent). Your task is as follows: 1. Show that AND, OR, NOT gates can be implemented with only NAND gates Provide a circuit diagram (similar to that of Task 2) for each of implemented gates. 2. Show that AND, OR, NOT gates can be implemented with only NOR gates. Provide a circuit diagram (similar to that of Task 2) for each of implemented gates, 3. Use only NAND gates to implement the following function (show circuit + truth table) F, = AD+ AC + BC 4. Use only NOR gates to implement the following function (show eircuit + truth table) F: = BD + CD+A Show transcribed image text Task 3 125 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they can be used in various configurations to implement any other logic gates (and the Boolean functions they represent). Your task is as follows: 1. Show that AND, OR, NOT gates can be implemented with only NAND gates Provide a circuit diagram (similar to that of Task 2) for each of implemented gates. 2. Show that AND, OR, NOT gates can be implemented with only NOR gates. Provide a circuit diagram (similar to that of Task 2) for each of implemented gates, 3. Use only NAND gates to implement the following function (show circuit + truth table) F, = AD+ AC + BC 4. Use only NOR gates to implement the following function (show eircuit + truth table) F: = BD + CD+A

Expert Answer


Answer to Task 3 125 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them,…

Task 3 25 Marks Nand Gates Sometimes Referred Universal Gates Meaning Many Copies Used Var Q43858751

Task 3 [25 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they

Task 3 [25 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they can be used in various configurations to implement any other logic gates (and the Boolean functions they represent). Your task is as follows: 1. Show that AND, OR, NOT gates can be implemented with only NAND gates. Provide a circuit diagram similar to that of Task 2) for each of implemented gates. 2. Show that AND, OR, NOT gates can be implemented with only NOR gates. Provide a circuit diagram (similar to that of Task 2) for each of implemented gates. 3. Use only NAND gates to implement the following function (show circuit + truth table) F1 = AD+ AC + BC 4. Use only NOR gates to implement the following function (show circuit + truth table) F2 =BD+CD+A Show transcribed image text Task 3 [25 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them, they can be used in various configurations to implement any other logic gates (and the Boolean functions they represent). Your task is as follows: 1. Show that AND, OR, NOT gates can be implemented with only NAND gates. Provide a circuit diagram similar to that of Task 2) for each of implemented gates. 2. Show that AND, OR, NOT gates can be implemented with only NOR gates. Provide a circuit diagram (similar to that of Task 2) for each of implemented gates. 3. Use only NAND gates to implement the following function (show circuit + truth table) F1 = AD+ AC + BC 4. Use only NOR gates to implement the following function (show circuit + truth table) F2 =BD+CD+A

Expert Answer


Answer to Task 3 [25 marks] NAND and NOR gates are sometimes referred to as universal gates meaning that with many copies of them,…

Task 3 Design Create Web Page Following Components 2 Marks Add Title Called Comp 3055 Assi Q43902936

Task 3: Design and create a web page with followingcomponents: (2 marks each)• Add a title called “COMP – 3055 Assignment 1:Introduction”• Include a large header in the first row of the body called“About Me”• Write at least two well‐written paragraphs.i. Paragraph1: Introduce yourself without any confidentialinformation. ii. Paragraph 2: Describe what you intend to learn inthis course.• Website: Embed the School of Computer Science Webpagestating that you study in this school.• YouTube Video: embed a demo you tube video about latesttools in web development
(Please privide the code)

Expert Answer


Answer to Task 3: Design and create a web page with following components: (2 marks each)• Add a title called “COMP – 3055 As…