Foc QP 1
Foc QP 1
Foc QP 1
Section- II
3. (a) Apply Boolean algebra rules/laws and prove,
(i) (A+B) (A+C) = A +BC
(ii) AB + A (B+C) + B (B+C) = B +AC
Proof: Application of relevant laws/rules- 5M each
(b) Design a full adder circuit with truth table- Circuit Diagram + Truth table
3 + 3 = 6M
(c) Implement a comparator using logic gates- Diagram
4M
4. (a) Define and explain 4 : 1 multiplexer- Definition + Explanation +Figure + Truth table
2 + 2 + 3 + 3 = 10M
(b) Explain the construction of 4 bit synchronous counter with Truth table.
Explanation +Figure +Truth table
3 + 4 + 3 = 10M
Section- III
5. (a) List different types of flip flops- Any four.
4M
(b) Describe J K Flip-flop working with a diagram- Diagram + Explanation.
3 + 3 = 6M
(c) Construct 4-bit SISO shift register & explain its working- Diagram + Explanation.
4 + 4 = 8M
(d) List applications of counter. Any Two.
2M
6. (a) Classify computers based on purpose and size- Classification based on Purpose + Size
2+3M
(b) Distinguish between system software and application software- Any two features.
2x2.5M
(c) Describe working of a keyboard- Diagram + Explanation
4 + 6 = 10M
Section- IV
7. (a) Explain computer Network categories
Explanation 3 categories 5marks
(b) Describe online data processing method- Explanation
20CS11T
5M
(c) Explain functional units of computer with diagram- Figure + Explanation
4 + 6 = 10M
8. (a) Discuss Auxiliary memory- Explanation
5M
(b) Explain Cache memory- Explanation
5M(Only diagram - 2M)
(c) Classify computers based on Flyns classification- Diagram representation + 4 Statement
1 + (4*1) = 5M
(d) Explain BIOS- Explanation
5M
Section- V
9. (a) Differentiate the following:
(i) Multitasking Operating System and Multiprocessing operating system.
Any 3 difference 5M
(ii) Real time operating system and Batch processing operating system.
Any 3 difference 5M
(b) Write an algorithm for area of circle. Read + Process + Write + Begin & End Format
1 + 1 + 1 + 2 = 5M
(c) Draw flowchart to accept the length of two different line segments and check whether they
are equal or unequal. Display the message accordingly- Correct symbols + flowchart
2 + 3 = 5M
10. (a) Explain generation of programming language. Give example for each- Each generation
with an example
2 * 5 = 10M
(b) Define variable. Specify the rules for naming a variable. Give examples-
Definition + Rules + Example
2 + 6 + 2 = 10M
20CS11T
2. (a) Explain the universal gates with logic symbol, expressions, truth table.
NAND Gate: The NAND gate represents the complement of the AND operation. Its name is an
abbreviation of NOT AND. The symbol for the NAND gate consists of an AND symbol with a
bubble on the output, denoting that a complement operation is performed on the output of the AND
gate. The truth table and the graphic symbol of NAND gate is shown in the figure
NOR gate represents the complement of the OR operation. Its name is an abbreviation of NOT
OR. The graphic symbol for the NOR gate consists of an OR symbol with a bubble on the output,
denoting that a complement operation is performed on the output of the OR gate.
Expression is Y = A + B.
20CS11T
(c) Determine when the outputs for XOR and XNOR logic gates are high.
In XOR, the outputs are high if the inputs are different; When the all inputs are same/equal,
the output remains low.
In XNOR, the outputs are high if the inputs are same/equal; when inputs are discrete, the
output remains low.
Section- II
The truth table of a 4-to-1 multiplexer is shown below in which four input combinations 00, 10, 01
and 11 on the select lines respectively switches the inputs D0, D2, D1 and D3 to the output. That
means when S0=0 and S1 =0, the output at Y is D0, similarly Y is D1 if the select inputs S0=0 and
S1= 1 and so on.
From the above truth table, we can write the output expressions as follows:
Y = S0 S1 D0 + S0 S1 D1 + S0 S1 D2 + S0 S1 D3
Section- III
5.(a) List different types of flip flops
Different types of flip flops are –
Set-Reset (SR) Flip-flop or Latch
Clocked SR Flip flop
JK Flip-flop
Master Slave JK Flip-flop
D (Delay) Flip-flop
T (Toggle) Flip-flop.
(c) Construct 4-bit SISO shift register & explain its working.
Serial In Serial Out (SISO) shift registers are a kind of shift registers where both data loading
as well as data retrieval to/from the shift register occurs in serial-mode. Figure 1 shows a n-bit
synchronous SISO shift register sensitive to positive edge of the clock pulse. Here the data
word which is to be stored is fed bit-by-bit at the input of the first flip-flop. Further it is seen
that the inputs of all other flip-flops (except the first flip-flop FF1) are driven by the outputs of
the preceding ones say for example, the input of FF 2 is driven by the output of FF1. At last the
data stored within the register is obtained at the output pin of the nth flip-flop in serial-fashion.
Section- IV
Section- V
9. (a) Differentiate the following:
(i) Multitasking Operating System and Multiprocessing operating system.
S.No. Multitasking Multiprocessing
1 The execution of more than one process The presence of more than one processor in a
takes place simultaneously. system that can execute large no of instruction
in parallel mode.
2 In this system the number of processor’s In this system the number of processor’s are
is one. more than one.
3 It takes more amount of time in process It takes less time in process execution.
execution.
4 In this, job is executed one by one at a In this, more no of jobs can be executed at a
time. time.
5 In this, the throughput is moderate. In this, the throughput is maximum.
6 The efficiency of multitasking is The efficiency of multiprocessing is
moderate. maximum.
7 In this system the number of user is In this system the number of user can be one or
more than one. more than one.
8 In this system the whole process is In this system the whole process is divided
depend only on one processor. between the multiple processors.
20CS11T
(c) Draw flowchart to accept the length of two different line segments and check whether they
are equal or unequal. Display the message accordingly.
10. (a) Explain generation of programming language. Give example for each.
First Generation – Machine Language
• Only binary numbers were used as the computers understand only binary codes - 0 and 1. Every
instruction and data were written using 0’s and 1’s
• An instruction in machine language consists of 2 parts – the 1st part is the command which
instructs the computer what functions are to be performed. 2nd part is the operand which
instructs the computer where to find or store data.
• The machine language is difficult to write and remember
Second generation – Assembly language
• It was developed in the early 1950’s and its main developer was IBM.
• This language assigns a mnemonic code to each machine language instruction to make it easier
to remember or write. For example ADD for addition, MULT for multiplication.
• Assembly language is not a single language but a group of languages and each processor family
has its own assembly language.
• The general format of assembly instruction is [LABEL] < OPERANDS> [; COMMENT]
Eg : BEGIN ADD A, B ; ADD B TO A
• The assembly language program must be translated to machine code by a separate program
called assembler.
• The original assembly language program is called source program and the final machine
language program is called object code.
Third Generation: High level language
• During 1960’s, computers started to become popular and it became necessary to develop
languages that were more like natural languages such as English.
• Example Languages are COBOL, FORTRAN, BASIC and C.
• Programs written using high level languages were machine independent.
• Since computers understand only machine language, high level language needs to be
converted into machine language. This is done by compilers and interpreters.
20CS11T
Fourth Generation:
• Third generation languages are considered as procedural languages whereas fourth generation
languages are non-procedural
• In non-procedural method, the computer is instructed what it must do rather than how to do it.
• The programs were easier to write but they require more processing time.
• Example Languages are SQL, Perl, PHP, Python
• 4th generation languages are divided into 3 categories:
1. Query languages – they allow the user to get information from databases by following
simple syntax rules.
2. Report generation – they produce customized reports based on data stored in the
database. The user can specify the data and format of the data in the report.
3. Application generators – the user writes programs to allow the data to be entered into
the database. The program prompts the user to enter data and also checks validity of
data.
Fifth Generation programming languages:
• These languages will be able to process natural languages.
• The computers will be able to accept, interpret and execute instructions in the native language
of the end users.
• The programmers may simply type the instruction or tell the computer via a microphone what
it needs to do.
• Example Languages are OPS5, Mercury
• These languages are closely linked to artificial intelligence.
(b) Define variable. Specify the rules for naming a variable. Give examples.
In programming, a variable is a container (storage area) to hold data. To indicate the storage
area, each variable should be given a unique name. Variable names are just the symbolic
representation of a memory location.
Rules for naming a variable
A variable name can only have letter/s (both uppercase and lowercase letters), digits and
underscore.
The first letter of a variable should be either a letter or an underscore. Then followed by
have letters, digits and underscore.
Variable names are case sensitive.
No spaces or special characters are allowed.
Cannot use a keyword as a variable name
There is no rule on how long a variable name (identifier) can be. However, you may run into
problems in some compilers if the variable name is longer than 31 characters.
Examples
Valid variable names are- Num, a, x, _one, n1, n1value, etc.
Invalid variable names are – 123, 1value, result area, a$b, l/b, etc.
20CS11T
Board Members:
Sd/-