Search & Filtering
You are a Technology Specialist in your organisation. You have been tasked to run a workshop on network system design specifically looking into the requirements and constraints. You have decided to approach the task by studying the components that make up a network system and then the relationship between network systems and related areas. Thus far, you have realised that you will base your workshop on the exhibit extracted from Serpanos and Wolf (2011). Exhibit: Requirements and constraints for network system design. Prepare for this workshop by completing the following questions.
Q.1.1 Identify a suitable network scenario/case that can be used to explain and discuss the relationship of concepts in the exhibit. Ensure that you provide details of the following aspects of the scenario: • Description of the scenario; • Why the scenario is considered a network system.
using pointer.
a. pass by value
b. and pass by reference.
Develop a program to find the roots of the quadratic equation using BISECTION METHOD.
name, date of joining. Write a program to create an array of the structure and enter
some data into it. Then ask the user to enter current date. Display the names of those
employees whose tenure is 3 or more than 3 years according to the given current
date.
Create an algorithm, pseudocode and flowchart about this. Blog factory will give year end bonus. Employees that have monthly salary less than 300000, they will get 50% bonus of salary. While the greater than 30,000, they will get 20000. Print name and corresponding bonus for each employee
Write a program to traverse a tree in Inorder sequence without recursion
You have given a game board in 2D matrix format where ‘S’ is the start point and ‘E’ isthe end point. There is only a single path from ‘S’ to ‘E’. In this path you will be face 3 types of Vampires which are marked as ‘M’, ‘N’ and ‘O’. But to kill those vampires you need Blades. You will find 3 types of Blades on your way which are marked as ‘A’, ‘B’ and ‘C’. Use Blade ‘A’ to kill Vampire ‘M’, Blade ‘B’ to kill Vampire ‘N’ and Blade ‘C’ to kill Vampire ‘O’. You will have one chance to kill a vampire using a Blade. If you miss it, you will be killed by that vampire. For carrying those Blades you have given a Bag of size 100 which is initially empty. For speed attack this bag works as Last in first out order for accessing blades. Now simulate the game starting from ‘S’ for different game board input.
Implement a BST-Binary Search Tree (for integer numbers) that consists of following operations: (1) Insert (2) Tree minimum (3) Search (4) In-order traversal (5) Tree successor (6) Delete
Given the following declarations, what is the result
of each of the expressions?
int w = 2, y = 7, z = 12;
a. w * z
b. w * z +y
c. w * -z
d. w * --z + y++
e. w * z-- + ++y
f. w + z * y
g. w – y + z
h. (w + y) * z
i. y / w
j. y / z
k. w%y
l. y % w
