ویکسینیشن سرٹیفکیٹ کہاں سے حاصل کیا جا سکتا ہے؟
ویکسینیشن سرٹیفکیٹ نادرا سنٹر سے یا ہماری ویب سائٹ nims.nadra.gov.pk
سے حاصل کیا جا سکتا ہے۔

CS201 ASSIGNMENT 3 SOLUTION SPRING 2021

#include <iostream> using namespace std; #define PI 3.14159265 class Circle { private: double radius; public: void setRadius(); void computeAreaCirc(); Circle(); ~Circle(); }; Circle::Circle() { radius = 0.0; } void Circle::setRadius() { radius = 5.6; } void Circle::computeAreaCirc() { cout << "Area of circle is: " << PI * (radius * radius) << endl; cout << "Circumference of circle is: " << 2 * PI * radius << endl; } Circle::~Circle() { } class Rectangle { private: double length; double width; public: void setLength(); void setWidth(); void computeArea(); Rectangle(); ~Rectangle(); }; Rectangle::Rectangle() { length = 0.0; width = 0.0; } void Rectangle::setLength() { length = 5.0; } void Rectangle::setWidth() { width = 4.0; } void Rectangle::computeArea() { cout << "Area of Rectangle: " << length * width << endl; } Rectangle::~Rectangle() { } main() { cout<<"********************SCIENTIFIC CALCULATOR********************"<<endl; cout<<""<<endl; int run = 1; string option, choice; while(run) { cout << "\nOPTION 1 for computing Area and Circumference of the circle" << endl; cout << "OPTION 2 for computing Area of the Rectangle" << endl; cout << "Select your desired option(1-2): "; cin >> option; if(option == "1") { Circle nCircle; nCircle.setRadius(); nCircle.computeAreaCirc(); cout << "Do you want to perform anyother calculation(Y/N):"; cin >> choice; if(choice == "Y" || choice == "y") { continue; } else { break; } } else if(option == "2") { Rectangle nRectangle; nRectangle.setLength(); nRectangle.setWidth(); nRectangle.computeArea(); cout << "Do you want to perform anyother calculation(Y/N):"; cin >> choice; if(choice == "Y" || choice == "y") { continue; } else { break; } } else { cout << "Invalid Option!, Option should be from (1-2)" << endl; } } }

@zaasmi said in MTH603 Assignment 2 Solution and Discussion:

@zaasmi said in MTH603 Assignment 2 Solution and Discussion:

Assignment NO. 2 MTH603 (Spring 2021)

Maximum Marks: 20
Due Date: July 30, 2021

DON’T MISS THESE: Important instructions before attempting the solution of this assignment:
• To solve this assignment, you should have good command over 23 - 30 lectures.
Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 23-30 lectures.
• Upload assignments properly through LMS, No Assignment will be accepted through email.
• Write your ID on the top of your solution file.
Don’t use colourful back grounds in your solution files.
Use Math Type or Equation Editor Etc. for mathematical symbols.
You should remember thatif we found the solution files of some students are same then we will reward zero marks to all those students.
Try to make solution by yourself and protect your work from other students, otherwise you and the student who send same solution file as you will be given zero mark.
Also remember that you are supposed to submit your assignment in Word format any other like scan images etc. will not be accepted and we will give zero mark corresponding to these assignments.

Question 1:
Find the first and second derivative of function f(x) at x=1.5 if:

x 1.5 2.0 2.5 3.0 3.5 4.0 f(x) 3.375 7.000 13.625 24.000 38.875 59.000

MARKS 10

Question 2:

Using Newton’s forward interpolation formula, find the value of function f(1.6) if:

x 1 1.4 1.8 2.2 f(x) 3.49 4.82 5.96 6.5

MARKS 10

MTH603 Assignment 2 Solution Spring 2021-converted.docx MTH603 Assignment 2 Solution Spring 2021.pdf

@aoune-ahmad said in help for cs subject:

cs 432 ki assgniment solution bhej de plz aj xtended date haSpring 2021_CS432_3.docx

Please check following link solution idea posted

@esha-naeem said in Cs 432 assignment 3 solution require:

how to solve using this N = λ*D

Please check following Example

Consider a switch that uses time division multiplexing (rather than statistical multiplexing) to share a link between four concurrent connections (A, B, C, and D) whose packets arrive in bursts. The link’s data rate is 1 packet per time slot. Assume that the switch runs for a very long time.

The average packet arrival rates of the four connections (A through D), in packets per time slot, are 0.2, 0.2, 0.1, and 0.1 respectively. The average delays observed at the switch (in time slots) are 10, 10, 5, and 5. What are the average queue lengths of the four queues (A through D) at the switch?

With TDMA, each connection gets to send 1 packet every 4 time slots, or .25 packets/slot. And with TDMA, the behavior of each connection is independent of what’s happening on the other connections. All of the arrival rates are less than this number, so the queue lengths are bounded.

Using Little’s Law: N = λ*D, so

A: N = 0.2 * 10 = 2 packets
B: N = 0.2 * 10 = 2 packets
C: N = 0.1 * 5 = .5 packets
D: N = 0.1 * 5 = .5 packets

Connection A’s packet arrival rate now changes to 0.4 packets per time slot. All the other connections have the same arrival rates and the switch runs unchanged. What are the average queue lengths of the four queues (A through D) now?

Assignment 3 solution 2021

ap k pas latest assgniment pas ha cs 432 ki aj xtended date ha plz help for cs subject

@omairsoa said in How to Wireless Security Setup:

how we can set wireless security?

You can set the wireless password for your wireless network. You are recommended to select WPA-PSK as Security Mode and AES as WPA Algorithms Type.

@zaasmi said in apsd capable:

@liza-liza said in apsd capable:

@zaasmi
Why we change Channel?

Select from 1~11 channels or AutoSelect. The best selection is a channel that is the least used by neighboring networks.

Extension Channel:
This is used to ensure N speeds for 802.11n devices on the network.

@saira-malik said in Packet and Circuit Switching, and Little's Law:

Sender and receiver are separated by two 1-Gigabit/s links and a single switch. The packet size is 5000 bits, and each link introduces a propagation delay of 10 microseconds. Assume that the switch begins forwarding immediately after it has received the last bit of the packet and the queues are empty.

For each link, it takes 1 Gigabits/5 Kbits = 5 microseconds to transmit the packet on the link, after which it takes an additional 10 microseconds for the last bit to propagate across the link. Thus, with only one switch that starts forwarding only after receiving the whole packet, the total transfer delay is two transmit delays + two propagation delays = 30 microseconds.