20CS11T

I Semester Diploma Examination, March/April 2022

FUNDAMENTALS OF COMPUTER

Note: Answer one full question from each section. One full question carries 20 marks
Section-1
1. a) List + Explanation of each (4) number system 2 + 4 X 2= 10M
b) Each correct conversion 5 X 1= 5M
(steps, if correct should be given marks even if final answer is not correct)
c) Writing ASCII code either in Binary / Decimal 5M
Note: 1. As hint is given only for uppercase letters, the alternates given
in model answers may be considered for awarding marks.
2. If code for ‘W’ is written correctly, full marks maybe awarded.

2. a) Identification of gate + logic symbol + truth table 3 + 2 + 2 = 7M

b) Boolean expression + Logic circuit + Truth table 3 + 2 + 3= 8M
c) Boolean Expression + Truth table 3 + 2= 5M

Section-II
3. a) Statement + Logic symbol + Logic expression + Truth table 1 + 1 + 1 + 2= 5M
b) Explanation + Logic diagram + Boolean expression + Truth table 2 + 2 + 2 + 2= 8M
c) Identification of combinational circuit + logic diagram + Explanation 3 + 2 + 2= 7M
4. a) Boolean Laws + Any 4 Boolean Rules 3 + 2= 5M
b) Explanation + Block diagram + Truth table + Boolean Expression + Logic circuit
2 + 1 +2 + 1 +2= 8M
c) Identification of solution to the problem + Logic circuit + Truth table + explanation
1 + 2 + 2 + 2= 7M
Section-III
5. a) Explanation of SISO + logic diagram + Truth table 3 + 3 + 4= 10M
b) Classification + Explanation of each Classification 3M 1 + 2 x 3= 7M
c) List any 3-system software 3M
6. a) Explanation 3 marks + Logic circuit 4 marks + Truth table 3 marks 3 + 4 + 3= 10M
b) List +Explanation any 3 protocol types 2 marks each 1 + 3 x 2 = 7M
c) List 3 marks (any 6) 3M

P a g e 1 | 32
 20CS11T
Section-IV
7. a) Diagram + Explanation 2 + 3 = 5M
b) Diagram (not mandatory) + Explanation 4 + 6= 10M
(Any relevant diagram – 4m
Any 2 valid points for each functional unit – 6m)
c) Classification of Memory 5M

8. a) List + Explanation of any 2 threats, each 2M 1 + 2 x 2= 5M

b) Labelled Diagram 5M
c) List + Explanation of any 4 services 2M each 2 + 4 x 2= 10M

Section-V
9. a) Any five valid differences 5 x 1= 5M
b) Explanation 5M
c) Flow chart (FC Convention + Input + Process + Output). 2 + 1 + 1 + 1= 5M
d) List + Explanation 1 + 3 = 4M
10. a) Explanation 6M
b) Algorithm 9M
(If the student is able to identify the series occurrence correctly, award full marks and
if, just an attempt to the question is made, award 5 marks)
c) Match each application with the corresponding OS 5 x 1 = 5M

***

P a g e 2 | 32
 20CS11T
I Semester Diploma Examination, March/April 2022

FUNDAMENTALS OF COMPUTER

Note: Answer one full question from each section. One full question carries 20 marks
Section-1

1. (a) Explain different types of number system

Four most common types of number system are
1. Binary number system (Base- 2)
2. Octal number system (Base-8)
3. Decimal number system (Base- 10)
4. Hexadecimal number system (Base- 16)
1. Binary number system:
 It is the type of Number Representation techniques, in which base is 2.
 It is most popularly used in digital devices like computers.
 Binary system is used for representing binary quantities
 Digits used are: 0 & 1.
 Eg: 110011
2. Octal number system:
 It is the type of Number Representation technique, in which base is 8.
 There are only 8 symbols or possible digit values, they are 0, 1, 2, 3, 4, 5,
6, 7.
 It requires only 3 bits to represent value of any digit.
3. Decimal number system:
 It is a type of Number Representation technique, in which base is 10
 It is also called as Hindu-Arabic number system, used since ancient days.
 It is a base 10 number system. Digits used are: 0,1,2,3,4,5,6,7,8,9.

4. Hexadecimal number system

 It is a type of Number Representation technique, in which base is 16.
 Digits used are: 0,1,2,3,4,5,6,7,8,9 Letters used A-F.
 It requires only 4 bits to represent value of any digit.
 Hexadecimal numbers are indicated by the addition of either an 0x prefix
or an h suffix
P a g e 3 | 32
 20CS11T

(b) Convert the following

1. (111011)2 = (59)10:
 1x25 + 1x24 + 1x23 + 0x22 + 1x21 + 1x20
 1x32 + 1x16 + 1x8 + 0x4 + 1x2 + 1x1 =
 32 + 16 + 8 + 0 + 2 + 1
 32 + 16 + 8 + 0 + 2 + 1
 59.
2. (246)10 = (11110110)2

Divide 246 by 2. Use the integer quotient obtained in this step as the dividend
for
the next step. Repeat the process until the quotient becomes 0. Write the
remainder
from bottom to top i.e. in the reverse chronological order. This will give the
binary equivalent of 246.

Remainder
Dividend
246/2
0
= 123
123/2
1
= 61
61/2 =
1
30
30/2 =
0
15
15/2 =
1
7
7/2 = 3 1
3/2 = 1 1
1/2 = 0 1

 Therefore, the binary equivalent of decimal number 246 is 11110110.

P a g e 4 | 32
 20CS11T

3. (4BA)16= (1210)10
 4x162 + Bx161 + Ax160
 4x256 + 11x16 + 10x1 = (1210)10
 So, the number 1210 is the decimal equivalent of hexadecimal number
4BA
.
4. (101101101)2 =(16D)16
 Write the given binary number in groups of 4 starting from right.
 1 0110 1101
 Each group of 4 equates to 0 through 9 and then A BCDEF, where A
represents 10 and F is 15
 So 1101 equals 13 which is D
 0110 is 6
 And 1 is 1
 101101101 equates to 16D in hex.
5. (564)8 = (101110100)2
Take each octal number as input
Convert each digit of octal into 3 digit binary number.

Octal
Binary equivalent
Digit
4 100
6 110
5 101
 (564)8 equates to 101110100 in binary

(C) Write the ASCII code for the following word ‘Welcome’.

WELCOME: W: 87->1010111 E: 69-> 1000101 L: 76- >1001100 C: 67-

>1000011
O: 79->1001111 M:77->1001101 E: 69-> 1000101
OR
welcome: w: 119->1110111 e: 101-> 1100101 l: 108- >1101100 c: 99->1100011
o: 111:>1101111 m:109->1101101 e: 101-> 1100101 l
OR
Welcome: W: 87->1010111 e: 101-> 1100101 l: 108- >1101100 c: 99->1100011
o: 111:>1101111 m:109->1101101 e: 101-> 1100101 l

P a g e 5 | 32
 20CS11T

2.(a) Which gate is used to implement the following concept? Write the logic
symbol & truth table.

If a person presses switch C, m/c should dispense coffee. If a person presses

switch T, m/c should dispense Tea. If a person presses both switches it should
dispense nothing, (1=pressed, 0-Not pressed.)

Using the EX-OR GATE we can implement the above mentioned concept.
1. The XOR gate stands for the Exclusive-OR gate.
2. It is a logic gate with two or more inputs and one output.
3. It produces 1 output when odd number of 1’s present otherwise it produces 0
output.
4. The logic circuit of X-OR GATE is

5. The logic expression of XOR GATE is Z = C T

6. Truth table of EXOR gate

C T Z
0 0 0
0 1 1
1 0 1
1 1 0

(b) Design a suitable logic ckt that has 3 1/p's A, B & C and whose o/p will be
high only when a majority of the i/p's are high.
Step-1: Construct the truth table.

P a g e 6 | 32
 20CS11T

Step -2: Write the AND term for each case where the o/p is 1 & also Write
the sum of product expression for the o/p.
X = 𝐴BC + A𝐵C + AB𝐶 + ABC
Step -3: Simplify the o/p expression.
X = 𝐴BC + ABC + A𝐵C + ABC + AB𝐶 + ABC
Factoring the appropriate pairs of terms, we have
X = BC ( 𝐴 + A) + AC( 𝐵 + B ) + AB( 𝐶 + C)
Each term in the parenthesis is equal to 1, so we have
X= BC + AC + AB.

Step -4: Implement the logic circuit for the o/p expression.

(c) Analyze the o/p of the following logic ckt & write TT & Boolean
expression.

P a g e 7 | 32
 20CS11T

Boolean Expression: Q =AB+ 𝑩

Truth table:
A B AB 𝑩 Q=
AB+ 𝑩
0 0 0 1 1
0 1 0 0 0
1 0 0 1 1
1 1 1 0 1

SECTION-II
3. (a) State and prove De Morgan’s 1st theorem.
DE Morgan's first theorem is stated as follows:
The complement of a product of variables is equal to the sum of the complements
of the variables.

(b) Describe half-subtractor with logic diagram and truth table.

HALF SUBTRACTOR
 A Logic circuit used for the subtraction of two binary numbers is known as
half subtractor.
 It has two inputs and two outputs.
 A and B as two inputs and difference and borrow as outputs.

P a g e 8 | 32
 20CS11T

Block diagram Truth Table

The SOP form of the diff and borrow are as follows:

Difference = A'B+AB' = A⊕B
Borrow = A'B
Logical circuit:
The Half Subtractor circuit can be designed and implemented using 'XOR' and
'AND' gates is as follows.

(C) Which combinational circuit is used to check whether the 2 binary

numbers are equal? Explain the act.
A comparator is a special combinational circuit designed primarily to compare the
value of two binary digits.
 The purpose of a Digital Comparator is to compare a set of variables, for
example A (A1, A2, A3, An, etc) against that of a constant such as B (B1, B2,
B3, …. Bn, etc) and produce an output condition depending upon the result of
the comparison.
 The output may be as follows: A is greater than B, A is equal to B, or A is less
than B

P a g e 9 | 32
 20CS11T

2-BIT COMPARATOR:
 A 2-bit comparator compares two binary numbers, each of two bits and
produces their relation such as one number is equal or greater than or less than
the other.
 The figure below shows the block diagram of a two-bit comparator which has
four inputs and three outputs.

4 (a) List the Boolean laws & rules.

Rules of Boolean algebra: Table lists the Basic rules of Boolean algebra.

P a g e 10 | 32
 20CS11T

Laws of Boolean Algebra:

The basic laws of Boolean algebra-the commutative laws for addition and
multiplication, the associative laws for addition and multiplication, and the
distributive law-are the same as in ordinary algebra.
1. Commutative Laws:
1. The commutative law of addition for two variables is written as A+B = B+A
2. The commutative law of multiplication for two variables is written as A.B =
B.A
2. Associative Laws:
1. The associative law of addition is written as follows for three variables:
A + (B + C) = (A + B) + C
2. The associative law of multiplication is written as follows for three variables:
A(BC) = (AB)C
3. Distributive Law:
1. The distributive law is written for three variables as follows:
A(B + C) = AB + AC

(b) Describe 1 to 4 demultiplexer.

One to Four (1 to 4) line DEMUX:
A 1-to-4 demultiplexer has a single input (X),
D
0 two selection lines (B and A) and four outputs (D0,
DEM

X D1, D2 and D3).

D
1 The input data bit is send to the data bit of the output
D lines depending on the value of the select input.
B
A
Block Diagram

TRUTH TABLE:

B A D D D D
o 1 2 4
0 0 X
0 0
2 0 0
0 1 1
0 1
X 0 0
0 1
1 0 0 0 X 0
0
1 1 0 0 0 X

P a g e 11 | 32
 20CS11T

When B=0 A=0, D0=X, similarly

B=0 A=1, D1= X
B=1 A=0, D2=X
B=1 A=1, D3=X
From the above Truth table, we can directly write the Boolean Expressions for each
output
Do=B̅A̅X
D1=B̅AX
D2=BA̅X
D3=BAX

LOGIC CIRCUIT

(C) When 2 i/p of an SR flip-flop is set to high, the o/p is invalid, explain how
this problem is resolved.
Logic Symbol and truth table for S R flip flop

P a g e 12 | 32
 20CS11T

 When the clock is not applied and S = 0, R = 0, flip flop gets disabled, so output
remains in its previous state.
 When the clock is applied, S = 0, R = 1, then output goes to a Reset state. So Q
= 0.
 When the clock is applied, S = 1, R = 0, then output Q = 1 that means flip flop
is in Set state.
 When the clock is applied, S = 1, R = 1, then output goes to a forbidden state
/ invalid state. This invalid state problem can be solved using JK flip flop.
JK Flip flop:
 The JK flip flop works in the same way as the SR flip flop work.
 The JK flip flop has 'J' and 'K' inputs instead of 'S' and 'R'.
 The only difference between JK flip flop and SR flip flop is that when both
inputs of SR flip flop is set to 1, the circuit produces the invalid states as outputs,
but in case of JK flip flop, there are no invalid states even if both 'J' and 'K' flip
flops are set to 1.

Logic symbol and Circuit Diagram of JK flip flop

P a g e 13 | 32
 20CS11T

Truth table of JK flip flop

 When J and K inputs are both HIGH and logic “1”, then the Q output will
change state (Toggle) for as long as the clock input, (CLK) is HIGH.

SECTION III
5 (a) Construct 4-bit SISO shift register
 Serial-in-serial-out (SISO) shift register accepts data serially i,e one bit at
a time on a single input line.
 It produces the stored information on its single output line in serial form.
 Data may be shifted left using shift-left register or shifted right by using
shift- right register
Operation (If in the below sequence, any one occurrence with correct
representation is written, full marks for logic diagram can be awarded)
Assume a data word 1111 is to be stored. Before application of clock signal, let QA
QB QC QD = 0000 and apply LSB bit of the number to be entered to D in. So, Din =
DA= 1. Apply the clock. On the first falling edge of clock, the FF-A is set, and stored
word in the register is QA QB QCQD= 1000

.
Apply the next bit to Din. So Din = 1. As soon as the next negative edge of the clock
hits, FF-B will set and the stored word change to Q A QB QC QD = 1100
P a g e 14 | 32
 20CS11T

Apply the next bit to be stored i.e. 1 to Din. As soon as the third negative edge of the
clock hits, FF-C will be set and output will be modified toQ AQB QC QD = 1110

Similarly with Din = 1 and with the fourth negative clock edge arriving, the stored
word in the register is QA QB QC QD = 1111.

Truth table

P a g e 15 | 32
 20CS11T

(b) Classify computers according to purpose.

According to purpose, computers are either general purpose and specific
purpose.
General purpose computers are designed to perform a range of tasks. They
have the ability to store numerous programs, but lack in speed and efficiency.
General Purpose Computer have the capability of dealing with variety of
different problems, and are able to act in response to programs created to meet
different needs.
A general-purpose computer is one that has the ability to store different programs
of instruction and thus to perform a variety of operations.
Specific purpose computers are designed to handle a specific problem or to
perform a specific task. A set of instructions is built into the machine.
Special Purpose Computer is designed to perform one specific task. The program
of instructions is built into, or permanently stored in the machine. Specialization
results in the given task being performed very quickly and efficiently.
Most special purpose computers have the capability of performing just one task.
They are frequently referred to us “dedicated,” because of their limitations to the
specific task at hand.
(c) List different types of system Software.
 System software are language processors or system programs written for the
computer system (hardware). Which provide the environment to facilitate the
writing, entering & execution of application programs more conveniently.
 System software in general, creates a user friendly or easy to use environment
of the computer hardware when it is executed by the computer itself.
 System software includes
 Operating systems.
 Device drivers
 Editors
 Assemblers
 Compilers
 Interpreters
 Loaders
 Linkers
P a g e 16 | 32
 20CS11T

6. (a) Construct 4-bit asynchronous counter with logic circuit and truth table
4 bit asynchronous ( ripple or serial) counter

• The term Asynchronous refers to events that do not have a fixed time
relationship with each other.
• It is the one in which the flip flops within the counter do not change the states
at exactly the same time because they don't have common clock pulse.
• Asynchronous counters are also called ripple-counters because of the way the
clock pulse ripples it way through the flip-flops.
• The below figure shows a 4-bit binary ripple counter constructed using JK flip
flops.
• The output of FF1 drives FF2, the output of FF2 drives FF3 and the output of
FF3 drives FF4. All the J&K inputs are connected to Vdd, where each flip-flop
toggles on the negative edge of its clock input.
• Consider initially all Flip flops to be in logical 0 state (Q1=Q2=Q3=Q4=0). A
negative transition in clock input drives FF1 and causes Q1 to change from 0
to 1.
• FF2 does not change its state since it also requires negative transition at its
clock input. With the arrival of the second clock pulse to FF1 Q1 goes from 1
to 0. This change of state creates the negative going edge needed to trigger
FF2, and thus Q2 goes from 0 to 1.
• Thus before the arrival of the 16th clock pulse all the FF are in the logical 1
state. Clock pulse 16 causes Q1 Q2 Q3 Q4 to go logic 0 state.

P a g e 17 | 32
 20CS11T

Truth table of 4 bit binary Ripple counter

State Q4 Q3 Q2 Q1
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
10 1 0 1 0
11 1 0 1 1
12 1 1 0 0
13 1 1 0 1
14 1 1 1 0
15 1 1 1 1
0 0 0 0 0

(b) Explain application layer protocols. list 1m + any 3 protocol types 2 points-
1+6=7m
Protocols in application layer provides following services
 It facilitates the user to use the services of the network.
 It is used to develop network-based applications.
 It provides user services like user login, naming network devices,
formatting messages, and e-mails, transfer of files etc.
 It is also concerned with error handling and recovery of the message as a
whole.
 The commonly used protocols are HTTP, FTP, SMTP, POP & DNS
DOMAIN NAME SERVICE (DNS):
 The Domain Network System (DNS) protocol helps Internet users and
network devices to discover websites using human-readable hostnames,
instead of numeric IP addresses.
 A domain name is a human-readable name—like amazon.com
 When a user types a human-readable address into the browser, the operating
system’s DNS client will check for information in a local cache. If the

P a g e 18 | 32
 20CS11T

requested address isn’t there, it will look for a Domain Name System server
in the local area network (LAN).
 When the local DNS server receives the query, and the requested domain
name is found, it will return the result.
HYPERTEXT TRANSFER PROTOCOL:
 HTTP stands for Hyper Text Transfer Protocol
 WWW is about communication between web clients and servers
 Communication between client computers and web servers is done by
sending HTTP Requests and receiving HTTP Responses. The World Wide
Web is about communication between web clients and web servers.
 Clients are often browsers (Chrome, Edge, Safari), but they can be any type
of program or device.
 Servers are most often computers in the cloud.
SIMPLE MAIL TRANSFER PROTOCOL:
 A simple mail transfer protocol (SMTP) is used to transfer the mails. The
actual mail transfer is done through MTA i.e. Message Transfer Agents.
 To transfer mail from one system to another, the system must have the client
message transfer agents and server message transfer agents.
 The client message transfer agent is used to send the mail and server message
transfer agents are used to receive the mail. Simple Mail Transfer Protocol
(SMTP) is the only protocol that defines Message Transfer Agents (MTA)
client and server.
FILE TRANSFER PROTOCOL
 FTP (FILE TRANSFER PROTOCOL) is the simplest and most secure way
for exchange of files over the internet.
 FTP is a widely used network protocol for transferring files between
computers over a TCP/IP-based network, such as the Internet.
 FTP lets people and applications exchange and share data within their offices
and across the Internet.
 Transferring files from client computer to sever computer is known as
Uploading and transferring files from a server to a client computer is known
as downloading.
 FTP is a set of rules that allow you to transfer files between computers across
the internet without involving email.
 A file may contain text document ,images, artwork, movie ,sound ,software
etc

P a g e 19 | 32
 20CS11T

(c) List different types of computer hardware components.

Any 6 hardware components listed below:

Different types of computer hardware components are
 System unit or cabinet – consisting of central processing unit.
 Monitor or visual display unit
 Mouse
 Keyboard
Basic hardware components
 Processor & chipset
 RAM memory Modules
 ROM Bias chip
 Hard disk
 Mouse and monitor
 Keyboard
 Built-in Add on card for audio & video.
Additional hardware components
 Pen drive
 Printer
 Plotter
 Scanner
 Microphone
 Speaker
 Floppy disk
 CD/DVD drive
 MODEM & USB Ports
SECTION-IV

7. (a) Explain the distributed data processing, how data is arranged and
processed?
 Distributed Processing is a technique of distributing the information over
number of devices.
 Here various computers (which are located remotely) remain
interconnected with a single host computer
 These devices are interconnected with communication facilities. Example
: Internet, Intranet

P a g e 20 | 32
 20CS11T

 Distributed systems are often used to collect, access, and manipulate large
data sets.
 It is an arrangement of networked computers in which data processing
capabilities are spread across the network.
 Distributed data processing is diverging massive amount of data to several
different nodes running in a cluster for processing.
 All the nodes execute the task allotted parallelly, they work in
conjunction with each other connected by a network. The entire set-up
is scalable & highly available

(b) Explain functional units of computer with neat block diagram.

(Any relevant diagram – 4m
Any 2 valid points for each functional unit – 6m
A computer consists of five main components namely, Input unit, Central
Processing Unit, Memory unit, Arithmetic & logical unit, Control unit and an Output
unit.

P a g e 21 | 32
 20CS11T

 Input unit

 Input units are used by the computer to read the data. The most commonly
used input devices are keyboards, mouse, joysticks, trackballs,
microphones, etc.

 The most well-known input device is a keyboard.

 Central processing unit

 Central processing unit commonly known as CPU can be referred as an

electronic circuitry within a computer that carries out the instructions given
by a computer program by performing the basic arithmetic, logical, control
and input/output (I/O) operations specified by the instructions. It consists
of ALU & CU units.

 Arithmetic & logical unit

 Most of all the arithmetic and logical operations of a computer are

executed in the ALU (Arithmetic and Logical Unit) of the processor.
 It performs arithmetic operations like addition, subtraction, multiplication,
division and also the logical operations like AND, OR, NOT operations.

 Control unit

 The control unit is a component of a computer's central processing unit that

coordinates the operation of the processor. It tells the computer's memory,
arithmetic/logic unit and input and output devices how to respond to a
program's instructions.
 The control unit is also known as the nerve centre of a computer system.

 Memory unit

 The Memory unit can be referred to as the storage area in which programs
are kept which are running, and that contains data needed by the running
programs.
 The Memory unit can be categorized in two ways namely primary memory
and secondary memory.
 The most common examples of primary memory are RAM and ROM.
 The most common examples of secondary memory are magnetic disks,
magnetic tapes, and optical disks.
 Output Unit

P a g e 22 | 32
 20CS11T

 The primary function of the output unit is to send the processed results to
the user. Output devices display information in a way that the user can
understand.
 Output devices are pieces of equipment that are used to generate
information or any other response processed by the computer. These
devices display information that has been held or generated within a
computer.
 The most common examples of an output device is a monitor & printer.

(c) Classify the following memory as primary/ secondary

 ROM - primary memory
 SRAM- primary memory
 DRAM- primary memory
 HDD- secondary memory
 CD-R- secondary memory
 DVD- Secondary memory

7. (a) Explain any two cyber securities threats.

(Any 2 threats)
Sources of Threat
The possible sources of a computer threat may be −
 Internal −It includes employees, partners, contractors (and vendors).
 External −It includes cyber-criminals (professional hackers), spies, non-
professional hackers, activists, malware (virus/worm/etc.), etc.
Common Terms
Following are the common terms frequently used to define computer threat −
 Virus Threats
A computer virus is a program designed to disrupt the normal functioning
of the computer without the permission of the user.
 Spyware Threats
Spyware is a computer program that monitors user’s online activities or
installs programs without user’s consent for profit or theft of personal
information.

P a g e 23 | 32
 20CS11T

 Hackers
Hackers are programmers who put others on threats for their personal gain
by breaking into computer systems with the purpose to steal, change or
destroy information.
(b) Draw the memory hierarchy and label it
Computer memory can be said to be organized in a hierarchical structure, where
memory with the fastest access speeds and highest costs lies at the top whereas those
with lowest speeds and hence lowest costs lie at the bottom.

(c) List and explain the services of OS (Operating system).

(List -2m & Explanation of any 4 services- 8m)
A typical operating system contains number of management routines and they
could vary from one OS make to another. Thus the operating system services can
be summarized as follows: (OS management activities summary).
 Program Execution: (The runtime environment)
 Accomplish the task of loading a program into main memory partitions.
 And initiate program execution.
 Provide for normal termination of program after successful execution.
 Provide for displaying error messages in case of abnormal termination.
 I/O Operations:
 Accomplish the task of device allocation and control I/O devices.
 Provide for notifying device errors, device status etc.

P a g e 24 | 32
 20CS11T

 File system Manipulation :( File Handling).

 Accomplish the task of opening a file, closing a File
 Provide for creating a file, deleting a file
 Allow file manipulation such as reading a File, writing a File,
Appending a
File etc.
 Communications:
 Accomplish the task of inter-process communication either on the same
computer system or between different computer systems on a computer
networks.
 Provide for message passing and shared memory access in safe mode.
 Accounting:
 Accomplish the task of record keeping the system usage (the resources
being used) by how long (the duration) for the billing & accounting
purposes.
 Maintain logs of system activities for performance analysis and error
recovery.
 Keep track of history of user logins.
 Error Detection:
 Accomplish the task of error detection and recovery if any. For instance
Paper Jam or Out of Paper in a Printer.
 Keep track status of CPU, Memory, I/O devices, Storage devices, File
system networking etc.
 About execution in case of fatal errors such as RAM parity errors,
power fluctuations, if any.
 Report and /or deliver error messages in case of arithmetic overflow,
divide by zero errors, etc.
 Resource Allocations:
 Accomplish the task of resource allocations to multiple jobs.
 Reclaim the allocated resources after their use or as and when the job
terminates.
 Provide for resource allocation and scheduling policies (such as round
robin, shortest job first, polling & handshaking, CPU bound, I/O bound)
for prioritizing jobs for resources allocation and detaining them for
execution.

P a g e 25 | 32
 20CS11T

 Protecting the system:

 Accomplish the task of protecting the system resources against
malicious use.
 Provide for safe computing by employing security scheme against
unauthorized access/users.
 Authenticate legitimate users with login passwords and registrations.

9 (a) Differentiate b/w BIOS and UEFI.

BIOS or Basic Input Output System: The first program that runs when the
computer is switched on is called BIOS or Basic Input Output System.
 BIOS is a firmware. This software is usually stored in Read Only Memory
(ROM) and located on the motherboard. In modern computer systems, the
BIOS contents are stored in a flash memory.
 It is not possible for an operating system to continue without BIOS because,
it loads the drivers of the hard disk and important portions of the operating
system into the memory
UEFI stands for Unified Extensible Firmware Interface.
 UEFI was designed to overcome many limitations of the old BIOS.
o UEFI provides faster boot time.
o UEFI is able to provide a GUI (navigation with mouse) as opposed to
BIOS which allows navigation only using the keyboard.
 It does the same job as a BIOS, but with one basic difference: it stores all data
about
Initialization and start up in an .efi file, instead of storing it on the firmware
 Languages: BIOS is written in assembler, while UEFI is written in simple C-
language.
 Drives: UEFI supports larger HDDs and SDDs. UEFI’s theoretical size limit
for bootable drives is more than nine zeta bytes, while BIOS can only boot
from drives 2.2 terabytes or smaller.
 Boot time: In most cases, UEFI provides a faster booting time for the
operating system than BIOS.
P a g e 26 | 32
 20CS11T

 Security: UEFI offers improved security features compare to BIOS. “Secure

Boot” prevents the computer from booting from unsigned or unauthorized
applications.
 Data processors: UEFI runs in 32-bit or 64-bit mode. BIOS runs only in 16-
bit mode and may utilize only 1 MB of executable memory.
 GUI: UEFI provides a more intuitive graphical user interface that you may
navigate with a mouse and keyboard, unlike BIOS. BIOS allows navigation
only using the keyboard.
(b) Explain high level language.
High level language(Any 5 valid points – 5m)
 These are high level languages similar to English language.
 High level languages are human readable and easy to understand.
 A high-level language is designed to simplify computer programming.
 High-level source code contains easy-to-read syntax
 But machines cannot understand high level language.
 It requires a translator to convert into a machine-level language
 Translators called compilers and interpreters are used.
 Example for high-level languages are C, C++, Java, Visual Basic and
JavaScript.

Advantages of high-level language

● Easy to develop and understand: It is easy to develop, learn and
understand the program.
● Less error prone: As the programs written in these languages are less
prone to errors, they are easy to maintain.
● Machine independent: Programs written in high level language can be
used in other computers also with very little or no change. They are
portable.
● Easy to maintain: Programs are easily upgradable.
● Easy debugging: Programmers can easily debug using compilers and
interpreters

P a g e 27 | 32
 20CS11T

●Less development cost: The program written in these languages can be

developed in very less time and cost as compared to the first- and second-
generation language.
Disadvantages of high-level language:
● Requires language translator
● Poor control on hardware

(c) Raj has to reach his college at 9:00am.If he leaves his house before 8:00am,
he will go by walk, otherwise he takes a bus. Draw a flow chart for this given
scenario, to output how to travel.

Start

Read Time

N If Time Y
< 8:00AM
Go By Bus Go By Walk

Stop

(d) Explain different types of Constants.

Constants refer to fixed values that the program may not alter during its execution.
These fixed values are also called literals .Constants can be of any of the basic
data types like an integer constant, a floating constant, a character constant, or a
string literal.

P a g e 28 | 32
 20CS11T

Integer Literals
An integer literal can be a decimal, octal, or hexadecimal constant. A prefix
specifies the base or radix: 0x or 0X for hexadecimal, 0 for octal, and nothing for
decimal.
An integer literal can also have a suffix that is a combination of U and L, for
unsigned and long, respectively. The suffix can be uppercase or lowercase and can
be in any order.
Examples:
212 /* Legal */
215u /* Legal */
0xFeeL /* Legal */
Floating-point Literals
A floating-point literal has an integer part, a decimal point, a fractional part, and
an exponent part. You can represent floating point literals either in decimal form
or exponential form.
While representing decimal form, you must include the decimal point, the
exponent, or both; and while representing exponential form, you must include the
integer part, the fractional part, or both. The signed exponent is introduced by e or
E.
Examples:
3.14159 /* Legal */
314159E-5L /* Legal */
Character Constants
Character literals are enclosed in single quotes, e.g., 'x' can be stored in a simple
variable of char type.
A character literal can be a plain character (e.g., 'x'), an escape sequence (e.g., '\t'),
or a universal character (e.g., '\u02C0').
There are certain characters in C that represent special meaning when preceded by
a backslash for example, newline (\n) or tab (\t).
P a g e 29 | 32
 20CS11T

String Literals
String literals or constants are enclosed in double quotes " ". A string contains
characters that are similar to character literals: plain characters, escape sequences,
and universal characters.
We can break a long line into multiple lines using string literals and separating
them using white spaces.
Examples:
"hello, dear"
"hello, \
dear"
"hello, " "d" "ear"

10 (a) Discuss the characteristics of algorithms.

ALGORITHM
 Algorithms are one of the most basic tools that are used to develop problem-
solving logic.
 An algorithm is defined as a finite sequence of explicit instructions that when
provided with a set of input values produces an output and then terminates.
 To be an algorithm, the steps must be unambiguous and after a finite number
of steps, the solution of the problem should be achieved.
 However, algorithms can have steps that repeat (iterate) or require decisions
(logic and comparison) until the task is completed.
 The need of an algorithm can be understood as it provides a logical structure
to plan the solution.

(b)Write an algorithm to generate the following series: 1, 2, 4, 7, 11, 16, 22,

29………

(If the student is able to identify the series occurrence correctly, award full marks
or just an attempt to the question is made, award 5 marks)

P a g e 30 | 32
 20CS11T

Explanation:

Let's take the difference of these numbers:

1, 2, 4, 7, 11, 1 6, 22, 29

So, the rule boils down to: 1 + 0, 1 + 1, 2 + 2, 4 + 3, 7 + 4, 11 + 5, 16 + 6, 22 + 7,

First Term = 1
Second term = First Term +1 =1+1=2
Third Term = Second term + 2 = 2+2 =4
Fourth term = Third Term + 3 =4+3 = 7
Fifth Term = Fourth term + 4 = 7+4 = 11
Sixth Term= Fifth Term +5 = 11+5 = 16
Seventh Term = Sixth Term + 6 = 16+6 = 22
Eighth Term = Seventh Term + 7 = 5+8 = 29 and so on

Algorithm:

1. Start
2. Read first_term, max_term, incr, next_term.
3. Initialize first_term =1, incr=1, next_term=0, max_term=n
4. Repeat thru step 8 until incr <= max_term
5. next_termfirst_term + incr
6. Write first_term
7. first_term  next_term
8. incr  incr + 1
9. Stop

(c) Match the application with following OS:

Application Operating system
Application Operating system
1. Airbag in car B. Hard real time
2. Weather forecasting C. Soft real time
3. Banking E. Distributed OS
P a g e 31 | 32
 20CS11T

4. Android A. Mobile OS
5. Peer to Peer D. Network OS

CERTIFICATE
This is to certify that all the model answers prepared by me for subject FUNDAMENTALS
OF COMPUTER (20CS11T) are as per syllabus.

Ashwini M S
Lecturer/CS&Engg.
Govt. Polytechnic,Channapatna
Board Members:
Sd/-

Krishna M D Sharmila D BharatKumar V S Puttaswamy T Usha D

P a g e 32 | 32