Introduction To Computer Engineering
Introduction To Computer Engineering
University logo
Name:
……………..
Roll No:
………………….
Department:
……………………
Course Name:
…………………..
Course Code:
………………….
Submitted By:
…………………..
Submitted To:
……………………………
University Name
1. Represent data and perform binary arithmetic and logical operations used within digital
computers.
• Computers are divided into three categories based on their usefulness, size, and purpose.
• Computers may be analogue, digital, or hybrid, depending on their functionality.
• Analog computers process continuous data while digital computers process discrete data.
On the other hand, hybrid processors can process both discrete and continuous data.
Binary arithmetic:
• There are only two digits 0 and 1 in the binary system and these two digits are capable of
representing any number.
• The operations of binary addition, binary subtraction, binary multiplication, and binary
division are referred to as binary arithmetic.
• Binary arithmetic begins with the least important bit, i.e. the rightmost side. In the following
article, we will go over the various operations one by one.
Addition:
0+0=0
1+0=1
1+1=0(carry 1 to the next significant bit)
Subtraction:
1-1=0
1-0=1
1-1=0
Multiplication:
1*1=1
1*0=0
Division: quotient and reminder
Logical Operator:
A logical operator is a symbol or word used to connect two or more words, so the composite
expression value generated only depends on the original phrase and the operator's significance.
[1] [1] [1] AND, OR and NOT are common logical operators.
a) Cost of Hardware:
Every year, the average trade association spends $74,000 on hardware and software. After
the initial purchase, 80 percent of total IT costs emerge. Gartner, Inc. is a research and
consulting firm. The annual expense of an unmanaged PC is $5,000.
Remaining
b) Size of Memory:
c) Speed of Hardware:
d) Number of processing Element:
Task No#2
Remaining
Task No#3
Single precision:
biased exponent 127+6=133
133 = 10000101
Normalized mantisa = 010101001
we will add 0's to complete the 23 bits
The IEEE 754 Single precision is:
= 0 10000101 01010100100000000000000
This can be written in hexadecimal form 42AA4000
2. Double precision:
biased exponent 1023+6=1029
1029 = 10000000101
Normalized mantisa = 010101001
we will add 0's to complete the 52 bits
Task No#4
Yes,
concurrency, but not parallels are possible. concurrency, concurrency, means that in an
overlapped time period two different activities or threads start working together, but that doesn't
mean that they can work simultaneously. In a concurrency, at least two processing threads should
be executed.
Task N0#5
Network Protocol:
A network protocol is a set of rules, conventions, and data structures that govern how devices
communicate within networks. In other words, network protocols are languages that two devices
must learn in order to communicate information seamlessly, regardless of infrastructure or
design differences.
Why Network protocol necessary?
Network protocols are required because they include mechanisms for devices to recognize and
communicate to one another, as well as formatting rules that define how data is packed into
messages that are sent and received.
Task No#6
❖ We would support at least 60 interfaces on Subnet1 and 26 >= 60 on Subnet2, so the prefix
for Subnet1 is 32-6 = 26 for Subnet1 = 223.1.17.x/26.
❖ We would support at least 90 interfaces on Subnet2 and 27 >= 90, so the prefix for Subnet2
is 32-7 = 25, and hence Subnet2 = 223.1.17.y/25.
❖ We would support at least 12 interfaces on Subnet3 and 24 >= 12, so the prefix for Subnet3
is 32-4 = 28, and hence Subnet3 = 223.1.17.z/28.
TASK No#7
a) Display a welcome message on the computer screen
#include <stdio.h>
int main()
{ printf("wellcom to my program");
return 0;
#include<conio.h>
void main() {
int arr[10];
int i;
int sum=0,avg=0;
for(i = 0; i<10;i++) {
scanf("%d",&arr[i]);
}
for(i = 0; i<10;i++) {
avg = sum/10;
printf("Average : %d",avg);
//getch();
}
Part c) Grading marks result Card
#include <stdio.h>
int main(void){
int num;
scanf("%d",&num);
return 0;