ACADEMY OF TECHNOLOGY

QUESTION BANK
FORMAL LANGUAGE AND AUTOMATA THORY (PCC CS403)
4TH SEM CSE
Faculty Name: Dr. Partha Ghosh & Prof. Uday Kumar Mondal
Course Outcomes (CO): At the end of this module the students will be able to

CO No. Outcome Bloom’s Taxonomy Level

CO1 To define finite automata and its classification ● L1 (Remembering)

and perform their conversion and minimization ● L2 (Understanding)
of finite automata. ● L3 (Applying)

CO2 To define finite automata with output and its ● L1 (Remembering)

classification and to define mealy and moore ● L2 (Understanding)
machine and perform their conversion ● L3 (Applying)
● L4 (Analyzing)

CO3 To define Language and grammar and their ● L1 (Remembering)

conversions. To classify different types of ● L2 (Understanding)
language and grammar. ● L3 (Applying)
● L4 (Analyzing)

CO4 To implement finite automata for regular (type- ● L1 (Remembering)

3) grammar and to evaluate regular ● L2 (Understanding)
expressions. ● L3 (Applying)
● L4 (Analyzing)

CO5. To implement pushdown automata for context ● L1 (Remembering)

free (type-2) grammar. And to construct parse ● L2 (Understanding)
tree for checking ambiguity. ● L3 (Applying)
● L4 (Analyzing)

CO6 To implement Turing machines for type-0 ● L1 (Remembering)

grammar. ● L2 (Understanding)
● L3 (Applying)

Question:
MODULE 1: Introduction
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL NO QUESTIONS MARK CO
S NO
1 What is the Chomsky hierarchy of languages? 5 1,3

2 What does the term "automata" refer to in the context of computer 1 1

science?
A) Software programs
B) Formal languages
C) Mathematical models of computation
 D) Hardware components

3 In the context of formal languages, what does an "alphabet" 1 1

represent?
A) Set of symbols used to construct strings
B) Set of strings generated by a grammar
C) Set of states in an automaton
D) Set of rules for language derivation
4 Which of the following is not a component of a formal language? 1 1
A) Alphabet B) Syntax C) Semantics D) Production rules

5 What is the purpose of production rules in formal grammars? 1 1

A) To define the alphabet
B) To generate strings in the language
C) To determine the semantics of the language
D) To describe the automaton

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL NO QUESTIONS MARK CO
S NO
1 Describe the relationship between automata and formal languages. 5 1

2 Explain the concept of an alphabet in the context of formal languages 5 1

and grammars, and discuss its importance in defining the set of
symbols used for constructing strings
3 Which of the following represents the Chomsky hierarchy of languages? 1 1,3
A) Regular, Context-Free, Context-Sensitive, Recursively Enumerable
B) Regular, Context-Free, Regular, Recursively Enumerable
C) Context-Free, Regular, Context-Sensitive, Recursively Enumerable
D) Context-Free, Regular, Recursively Enumerable, Context-Sensitive
4 Which of the following grammars is the most powerful in terms of 1 1,3
expressive power?
A) Regular grammar
B) Context-free grammar
C) Context-sensitive grammar
D) Type-0 grammar

MODULE 2: Regular languages and finite automata

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL NO QUESTIONS MARK CO
S NO
1 Define trap / dead state of DFA. Explain with example. 5 1
2 Define DFA with example 5 1

3 What are the differences between DFA and NFA 5 1

4 In DFA, transition function maps. 1 1

a) Σ × Q -> Σ
b) Q × Q -> Σ
c) Σ × Σ -> Q
d) Q × Σ -> Q
5 In NFA, transition function maps. 1 1
a) Σ × Q --> Σ
b) Q × Q --> Σ
c) Q × {Σ ∪ ˄} --> 2Q
d) Q × Σ --> Q
6 There are ________ tuples in finite state machine. 1 1
a) 4
b) 5
c) 6
d) unlimited
7 Define MOORE machine with example 5 1

8 Define Mealy machine with example 5 1

9 There are ________ tuples in Mealy machine. 1 1

a) 4
b) 5
c) 6
d) unlimited
10 State pumping Lemma for regular language. 3 1

11 State Arden's theorem for regular expression 3 2

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL NO QUESTIONS MARK CO
S NO
1 If S is the number of states in NDFA then equivalent DFA can 1 1
have maximum of
(a) S states (b) S - 1 state
(c) 2s states (d) 2s – 1 states

2 NFA, in its name has ’non-deterministic’ because of : 1 1

a) The result is undetermined
 b) The choice of path is non-deterministic
c) The state to be transited next is non-deterministic
d) All of the mentioned

What is wrong in the given definition? 1 1

3 Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
A) The definition does not satisfy 5 Tuple definition of NFA
B) There are no transition definition
C) Initial and Final states do not belong to the set of states.
D) Initial and final states can’t be same
4 1 1
What is the relation between DFA and NFA on the basis of
computational power?
A) DFA > NFA
B) NFA > DFA
C) Equal
D) Can’t be said
5 Construct a DFA that accept the Language “The set of all string not 3 1
containing the substring 010” over the alphabet Σ = {0,1};

6 Draw a transition diagram of a state automation A that accepts the given 3 1

set of strings over ∑=( a, b).

a) even number of a s and

b) exactly one b.

7 The DFA: 1 1

Accepts the string:

a) 10000011
b) 10010000
c) 11101111
d) None of these

8 The DFA: 1 1

Accepts:
a) Odd number of 0
b) Even number of 1
c) Even number of 0
d) Even number of 0 and Even number of 1
9 Number of states require in a DFA to accept string ends with 10. 1 1
A) 3
B) 2
C) 1
D) can’t be represented.
10 Extended transition function is . 1 1
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
11 δ*(q,ya) is equivalent to . 1 1
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
12 String X is accepted by finite automata if . 1 1
a) δ*(q,x) E A
b) δ(q,x) E A
c) δ*(Q0,x) E A
d) δ(Q0,x) E A
11 Finite automata requires minimum _______ number of stacks. 1 1
a) 1
b) 0
c) 2
d) None of the mentioned
12 The basic limitation of finite automata is that 1 1
a) It can’t remember arbitrary large amount of information.
b) It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
13 Design a FA with ∑ = {0, 1} accepts those string which 4 2
starts with 1 and ends with 0.
14 Design FA with ∑ = {0, 1} accepts even number of 0's and 4 1
even number of 1's.
15 Design FA with ∑ = {0, 1} accepts the set of all strings with 4 1
three consecutive 0's
16 Design an NFA in which all the string contain a substring 4 1
1110.
17 Number of states require in a DFA to accept string anbn, where n>0. 1 1
a) 3
b) 2
c) 6
d) can’t be represented.
18 Number of states require in a DFA to accept string ends with 101. 1 1
a) 3
b) 2
c) 4
d) can’t be represented.
19 Number of states require in a DFA to accept string starts with 1 1
aaa.
a) 6 b) 5 c) 4 d) can’t be represented.
 20. Using the pumping Lemma prove that L ={an bn | n>=1} is not 4 1
regular.

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTION MA CO
RKS NO
1 Convert the given NFA to DFA. 5 1

2 Convert the Mealy Machine ( given below ) to a Moore Machine. 4 2

Present NextState i/p=o Next state i/p=1

State State Output State Output
Q1 Q2 1 Q1 0
Q2 Q3 0 Q4 1
Q3 Q1 0 Q4 0
Q4 Q3 1 Q2 1

3 Use Myhill-Nerode theorem to minimize the FA shown below: 4 1

4 Convert the given NFA to DFA. 4 1

5 5 1
Design a DFA over ∑ ={a,b} that accepts string having even number of a and odd number
of b.

6 5 1
Design a DFA over ∑ ={0,1} that accepts string ends with 101.

7 Design a DFA over ∑ ={a,b} that accepts string having anbm , where n,m>0 5 1

8 Design a DFA over ∑ ={0,1} that accepts number divisible by 3. 5 1

9 Design a DFA over ∑ ={a,b} that accepts language L={ w, where |w| mod 3=0 } 5 1
10 Design a DFA over ∑ ={a,b} that accepts string aab exactly. 5 1
11 Design a DFA over ∑ ={a,b} that accepts string having odd number of a 4 1
12 Design a DFA over ∑ ={a,b} that accepts string having even number of b 4 1
13 Design a DFA over ∑ ={a,b} that accepts string abn , n>0 5 1
14 Design a DFA over ∑ ={0,1} that accepts string containing at least one 0 and one 1. 5 1
15 Design a DFA over ∑ ={a,b} that accepts string ab2w, where w ∈ {a,b}* 5 1
16 Design a DFA over ∑ ={a,b} that accepts substring aab. 4 1
17 Consider the following two DFA: 5 1
 Check these two are equivalence or not.

18. Minimize the DFA using Myhill-Nerode theorem 5 1

19 Minimize the DFA using Myhill-Nerode theorem 5 1

20 Convert the following NFA with ε to NFA without ε. 3 1

21 Convert the NFA to RE using Arden’s theorem 5 1

22 Convert the NFA/DFA to RE using Arden’s theorem 5 1

23 Convert the RE to DFA 5 1

a*(a+b)b*

24 Convert the RE to NFA/DFA 5 1

(0+1)*(00+11)(0+1)*

25 Design a DFA over ∑ ={a,b} that accepts string having a n bm , 5 1

where n,m>0.
BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Analyze Myhill-Nerode theorem and its applications in 5 2
formal language theory, particularly in determining the
equivalence of languages and minimizing finite automata.
Provide examples to illustrate its uses.
2 Determine the pumping length for a regular language 5 1
defined by a regular expression with m symbols using the
pumping lemma.

MODULE 3: Context-free languages and pushdown automata

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Explain the concept of a pushdown automaton (PDA) and 5 5
its components.

2 Illustrate with an example how a PDA operates and 4 5

processes input strings.

3 Which forms are used to standardize the representation of 1 5

context-free grammars?
A) Chomsky and Greibach normal forms
B) Turing and Kuroda normal forms
C) Backus-Naur and EBNF forms
D) Goto and Backus normal forms
4 What is the equivalence between nondeterministic 1 5
pushdown automata (PDA) and context-free grammars
(CFG)?
A) NPDA can accept a superset of languages accepted by
CFG.
B) CFG can accept a superset of languages accepted by
NPDA.
C) NPDA and CFG can accept the same set of
languages.
D) NPDA and CFG are entirely unrelated in terms of
language recognition.
5 What is parse trees? Provide an example. 4 5

6 Define context-free languages (CFLs) and explain their 4 5

significance in formal language theory.

7 Define closure properties of context-free languages (CFLs)

with respect to various operations such as union,
concatenation, and Kleene star.
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following defines a context-free grammar 1 5
(CFG)?
A) A grammar that generates regular languages.
B) A grammar that generates context-sensitive languages.
C) A grammar in Chomsky normal form.
D) A grammar with production rules of the form A → α,
where A is a non-terminal symbol and α is a string of
terminals and non-terminals.
2 What is the purpose of parse trees in the context of context- 1 5
free grammars?
A) To represent the structure of a derivation of a string.
B) To determine whether a string is in the language
generated by the grammar.
C) To minimize the number of states in a pushdown
automaton.
D) To generate strings by applying production rules.
Ambiguity in context-free grammars refers to: 1 5
3 A) The inability to generate certain types of languages.
B) The presence of multiple parse trees for the same
string.
C) The complexity of the language generated by the
grammar.
D) The lack of closure properties in context-free languages.
4 What does the pumping lemma for context-free languages 1 5
state?
A) It provides a method for parsing ambiguous context-free
grammars.
B) It proves that every context-free language is regular.
C) It establishes the closure properties of context-free
languages.
D) It identifies certain properties of context-free
languages regarding string lengths.
5 Which of the following accurately describes a deterministic 3 5
pushdown automaton (DPDA)?
A) A DPDA can process strings in reverse order compared
to an NPDA.
B) A DPDA may have multiple transitions for the same
input-symbol and state combination.
C) A DPDA always has a unique next move given its
current configuration.
D) A DPDA can recognize non-context-free languages.
6 What are the closure properties of context-free languages? 1 5
A) They define the behavior of context-free grammars when
applied to regular languages.
B) They describe the effect of operations such as union,
concatenation, and Kleene closure on context-free
languages.
C) They determine the number of states required in a
pushdown automaton to recognize a given language.
D) They specify the conditions under which a context-free
language becomes regular.
7 How does non-determinism in pushdown automata affect 1 5
their computational capabilities?
A) It allows them to recognize only regular languages.
B) It enables them to recognize context-sensitive languages.
C) It increases their efficiency in recognizing certain
types of languages.
D) It makes them equivalent in expressive power to
deterministic pushdown automata.
8 Which of the following is not a characteristic of context- 1 5
free languages?
A) They can be recognized by a pushdown automaton.
B) They can be described by context-free grammars.
C) They exhibit ambiguity in their syntax.
D) They are closed under the operation of intersection.
9 Explain the utility of parse trees. 4 5

10 Differentiate between Chomsky and Greibach normal forms 5 5

in the context of context-free grammars (CFGs). Provide
examples illustrating each.
11 Describe the concept of nondeterministic pushdown 5 5
automata (PDA) and explain its equivalence with context-
free grammars (CFGs).
12 Explain the pumping lemma for context-free languages 4 5
(CFLs)

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Show that the following grammar is ambiguous: 5 5
Sa | abSb | aAb
AbS | a AA b

2 Design a PDA for language L = { ancb2n | n ≥ 1) over the 5 5

alphabet {a,b,c}.
Specify the acceptance state.

3 Check whether the grammar is ambiguous or not: 4 5

 S iCtS | iCtSeS | a
Cb

4 . Design a CFG for the language L = { an b2n / n≥0}. 5 5

5 Write the CFG for the language 4 5

L = { 0i 1j 2k | i=j or j=k }.

6 Prove that CFLs are not closed under intersection and 4 5

complement operation.
7 E  E+E | E*E | a 4 5
Prove that the CFG with this production rule is ambiguous.

BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Compare and contrast nondeterministic pushdown automata 5 5
(NPDA) and deterministic pushdown automata (DPDA),
highlighting their differences in terms of language recognition
capabilities.
2 Consider a context-free grammar (CFG) with the following 5 5
productions:
S → aSb | ε
Analyze the given CFG to determine its language. Provide a detailed
explanation of your analysis.
3 Compare and contrast the closure properties of context-free 5 5
languages (CFLs) with those of regular languages. Discuss similarities
and differences, providing examples to illustrate your points.

MODULE 4: Context-sensitive languages

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Define context-sensitive languages and provide examples. 3 3

2 Define Linear Bounded Automata (LBA) with diagram. 4 3

3 Linear Bounded Automata (LBA) are limited in their tape 1 3

space to:
a) Linear space b) Quadratic space
c) Logarithmic space d) Constant space
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following is NOT a closure property of 1 3
context-sensitive languages?
a) Closure under union
b) Closure under intersection
c) Closure under concatenation
d) Closure under complement
2 Linear Bounded Automata (LBA) are equivalent in power 1 3
to which of the following?
a) Context-free grammars b) Regular expressions
c) Context-sensitive grammars d) Turing machines
The emptiness problem for linear bounded automata is: 1 3
3 a) Decidable b) Undecidable
c) Semi-decidable d) None of the above
4 Discuss the closure properties of context-sensitive 3 3
languages under union, concatenation, and intersection.
5 Explain the concept of Linear Bounded Automata (LBA) 4 3
and its significance in recognizing context-sensitive
languages.
6 Which of the following is true for the language {ap│p is a 1 3
prime}?
(a) It is not accepted by a Turing machine
(b) It is regular but not context- free
(c) It is context free but not regular
(d) it is neither regular nor context free ,but accepted by
a Turing machine.

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Design a LBA for language L = { anbncn | n ≥ 1) over the 5 3
alphabet {a,b,c}.
2 Design a LBA for language L = {an | n = m2, m ≥ 1}, 5 3
means n is perfect square.

3 Design a LBA for language L = {an | n is prime} 5 3

MODULE 5: Turing machines
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following is a characteristic of Turing 1 6
machines (TM)?
a) Finite number of states b) Limited tape alphabet
c) Unbounded tape d) Restricted tape movement
2 A language is Turing-recognizable if: 1 6
a) It can be generated by a context-sensitive grammar
b) A Turing machine halts and accepts all inputs
c) It is recursively enumerable
d) It is regular
3 Define Turing machine with an example. 5 6
4 Define nondeterministic Turing machine 4 6

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Turing machines are capable of simulating which of the 1 6
following?
a) Finite automata
b) Pushdown automata
c) Both finite and pushdown automata
d) Neither finite nor pushdown automata
2 A language is Turing-decidable if: 1 6
a) It can be recognized by a Turing machine
b) It can be generated by a context-sensitive grammar
c) A Turing machine halts and accepts or rejects all
inputs
d) It is recursively enumerable
Explain the difference between Turing-recognizable 4 6
3 (recursively enumerable) and Turing-decidable (recursive)
languages.
4 Prove or disprove the equivalence between nondeterministic 4 6
Turing machines and deterministic Turing machines in
terms of language recognition.
5 Discuss the relationship between unrestricted grammars and 4 6
Turing machines. Explain how unrestricted grammars can
generate languages recognized by Turing machines.
6 Discuss real-world applications of Turing machines or their 5 6
variants. Explain how Turing machines or their concepts are
used in computational theory or practical computing
systems.
7 Explain the concept of a Multi-tape Turing machine. 5 6
BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Construct a Turing Machine for language L = {ww | w ∈ 5 6
{0,1}}
2 Design Turing machine for language L = { anbncn | n ≥ 1) 5 6
over the alphabet {a,b,c}.
3 Design Turing machine for language L = { anbn | n ≥ 1) 5 6
over the alphabet {a,b}.
4 Construct TM for the addition function for the unary 4 6
number system.
5 Construct a TM machine for checking the palindrome of 5 6
the string of odd length.
6 Construct a TM machine for checking the palindrome of 5 6
the string of even length.
7 Construct a TM over the alphabet {0,1,2} for the 5 6
language L = {0n1n2n}, where n≥1

BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Compare and contrast Deterministic Turing machines and 5 6
Nondeterministic Turing machines.
2 Compare and contrast Multi-tape Turing machines with 5 6
standard single-tape Turing machines, discussing their
advantages and limitations.

MODULE 6: Undecidability
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 What is the Church-Turing thesis? 4 3

2 Discuss the concept of universal Turing machines. 4 3

3 Define a universal Turing machine. 4 3

4 What are undecidable problems? 4 3
5 Provide an example of an undecidable problem about 3 3
languages.
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Describe the construction and operation of a universal 5 3
Turing machine. Explain how a universal Turing machine
can simulate any other Turing machine.
2 Explain the Church-Turing thesis and its significance in the 4 3
theory of computation.
Define the concept of universal and diagonalization 4 3
3 languages
4 Discuss the implications of undecidability results for 4 3
practical computing and algorithm design.
5 Explain how undecidability influences the development of 4 3
algorithms and the limitations of automated reasoning
systems.
6 Discuss the implications of undecidability results for 4 3
practical computing and algorithm design.
1.​ What does the term "automata" refer to in the context of computer science?​

○​ A) Software programs
○​ B) Formal languages
○​ C) Mathematical models of computation
○​ D) Hardware components
○​ Answer: C) Mathematical models of computation
2.​ In the context of formal languages, what does an "alphabet" represent?​

○​ A) Set of symbols used to construct strings

○​ B) Set of strings generated by a grammar
○​ C) Set of states in an automaton
○​ D) Set of rules for language derivation​
Answer: A) Set of symbols used to construct strings
3.​ Which of the following is not a component of a formal language?​

○​ A) Alphabet
○​ B) Syntax
○​ C) Semantics
○​ D) Production rules​
Answer: C) Semantics
4.​ What is the purpose of production rules in formal grammars?​

○​ A) To define the alphabet

○​ B) To generate strings in the language
○​ C) To determine the semantics of the language
○​ D) To describe the automaton​
Answer: B) To generate strings in the language
5.​ Which of the following represents the Chomsky hierarchy of languages?​

○​ A) Regular, Context-Free, Context-Sensitive, Recursively Enumerable

○​ B) Regular, Context-Free, Regular, Recursively Enumerable
○​ C) Context-Free, Regular, Context-Sensitive, Recursively Enumerable
○​ D) Context-Free, Regular, Recursively Enumerable, Context-Sensitive​
Answer: A) Regular, Context-Free, Context-Sensitive, Recursively
Enumerable
6.​ Which of the following grammars is the most powerful in terms of expressive
power?​

○​ A) Regular grammar
○​ B) Context-free grammar
○​ C) Context-sensitive grammar
 ○​ D) Type-0 grammar​
Answer: D) Type-0 grammar

Module 2​

7. In DFA, transition function maps:​

○​ a) Σ × Q -> Σ
○​ b) Q × Q -> Σ
○​ c) Σ × Σ -> Q
○​ d) Q × Σ -> Q​
Answer: d) Q × Σ -> Q

8. In NFA, transition function maps:​

○​ a) Σ × Q --> Σ
○​ b) Q × Q --> Σ
○​ c) Q × {Σ ∪ ε} --> 2Q
○​ d) Q × Σ --> Q​
Answer: c) Q × {Σ ∪ ε} --> 2Q

9.0 There are ________ tuples in a finite state machine.​

○​ a) 4
○​ b) 5
○​ c) 6
○​ d) unlimited
○​ Answer: b) 5
Summary

1.​ Fundamental Differences between Science and Engineering:​

○​ Science focuses on understanding nature's laws and what exists, while

engineering applies that knowledge to create new solutions.
○​ Scientists focus on knowledge and theoretical aspects, while engineers focus
on practical applications.
2.​ Comparison of Human Eye and Camera:​

○​ The human eye and a camera have similar mechanisms, with the eye using
the pupil to control light, and the camera using the shutter. Both have lenses
and image sensing mechanisms, though the way focus is adjusted differs.
3.​ Comparison of Bird Flying and Aircraft:​

○​ Birds use metabolic energy and flap their wings, while airplanes use fuel and
have fixed wings designed for lift based on Bernoulli’s principle.
4.​ Importance of Biology:​

○​ Biology helps in understanding living organisms, including their structure,

functions, habitats, evolution, and relationships with the environment. It plays
a key role in improving food sources, disease control, medicine, and
conservation efforts.
5.​ Historical Observations and Discoveries:​

○​ Robert Brown (1827) discovered Brownian motion, later explained by Albert

Einstein in 1905, proving the existence of atoms and molecules.
○​ Julius Robert von Mayer (1841) contributed to the First Law of
Thermodynamics, proposing energy conservation and plant conversion of
light to chemical energy.

Demo MCQ Questions

1.​ What is the main difference between science and engineering?​

○​ A. Science creates new systems, while engineering only observes nature.

○​ B. Science focuses on knowing, while engineering focuses on doing.
○​ C. Scientists use practical tools, engineers don’t.
○​ D. Engineers discover new natural laws.

​
2.​ What is the main source of energy for living creatures according to Julius
Robert von Mayer?​

○​ A. Light energy
○​ B. Nuclear energy
○​ C. Chemical energy from oxidation
○​ D. Thermal energy​

3.​ What principle explains the lift provided by an airplane’s wings?​

○​ A. Newton's Third Law

○​ B. Bernoulli's Principle
○​ C. Conservation of Momentum
○​ D. Law of Inertia​

4.​ What did Robert Brown discover in 1827?​

○​ A. First Law of Thermodynamics

○​ B. Brownian motion
○​ C. Theory of Evolution
○​ D. Conservation of Energy​

5.​ Which scientist explained Brownian motion and helped prove the existence of
atoms?​

○​ A. Jean Perrin
○​ B. Robert Brown
○​ C. Albert Einstein
○​ D. Julius Mayer​

6.​ What is the primary function of the retina in the human eye?​

○​ A. Controlling light entering the eye

○​ B. Focusing images
○​ C. Image sensing
○​ D. Adjusting the focal length
7.​ What is the First Law of Thermodynamics as proposed by Julius Robert von
Mayer?​

○​ A. Energy can be created and destroyed.

○​ B. Energy is transferred but not conserved.
○​ C. Energy can neither be created nor destroyed.
○​ D. Energy decreases with time.
8.​ Which muscle in the human eye is responsible for changing the shape of the
lens to adjust focus?​

○​ A. Iris muscle
○​ B. Ciliary muscle
○​ C. Cornea muscle
○​ D. Pupil muscle
9.​ What does Bernoulli’s principle explain in the context of aircraft wings?​

○​ A. How engines provide thrust

○​ B. How wings generate lift
○​ C. How fuel is combusted in the engine
○​ D. How birds flap their wings
10.​In what year did Jean Perrin experimentally verify Einstein's theory of
Brownian motion?​

○​ A. 1827
○​ B. 1842
○​ C. 1905
○​ D. 1908
11.​Which of the following is a reason to study biology?​

○​ A. To understand how airplanes work

○​ B. To conserve natural resources and protect the environment
○​ C. To build engines and machines
○​ D. To design creative technological solutions
12.​Which scientific phenomenon did Robert Brown observe in 1827 using pollen
immersed in water?​

○​ A. Thermodynamic Law
○​ B. Brownian motion
○​ C. Conservation of energy
○​ D. Oxidation process
13.​What is the primary energy source for flying birds?​

○​ A. Solar energy
○​ B. Metabolic energy (ATP)
○​ C. Wind energy
○​ D. Fuel energy
14.​What year did Julius Robert von Mayer propose that energy can neither be
created nor destroyed?​

○​ A. 1827
○​ B. 1841
○​ C. 1905
○​ D. 1926​
Scientists and Key Years

●​ Robert Brown (1827):​

○​ Discovered Brownian motion by observing the random movement of pollen

grains in water.
●​ Albert Einstein (1905):​

○​ Modeled Brownian motion mathematically, providing strong evidence for the

existence of atoms and molecules.
●​ Julius Robert von Mayer (1841):​

○​ Enunciated the conservation of energy, forming the basis for the First Law of
Thermodynamics.
○​ Proposed that plants convert light energy into chemical energy.
●​ Jean Perrin (1908):​

○​ Experimentally verified Einstein’s explanation of Brownian motion, earning the

Nobel Prize in 1926.
 MODULE: INTRODUCTION
Fundamental differences between Science & Engineering:
Science is the intellectual and practical activity encompassing the systematic study of the
structure and behaviour of the physical and natural world through observation and
experiment.
Engineering is the branch of science and technology concerned with the design, building and
use of engines, machines and structures.
Science Engineering
1. It is synthesis of knowledge by 1. It is application of knowledge to
understanding nature’s law. transform nature for serving people.
2. Scientists have a sound knowledge of 2. Engineers are trained to use these
science, mathematics and technology. principles in designing creative
solutions to the challenges.
3. Science studies what is. 3. Engineering creates what never was.
4. Science is about knowing. 4. Engineering is about doing.

Comparison between human eye and camera:

Human eye Camera

1. Amount of light that get through to 1. Amount of light that get through to
the lens is controlled by the pupil. the lens is controlled by the shutter.
2. Lens system is a flexible bi-convex 2. Lens system is a rigid bi-convex lens.
lens.
3. Image sensing is done on the retina. 3. Image sensing is done on the film or
sensor.
4. Here, image distance (distance 4. Here, lens has fixed focal length. If
between lens and retina) is fixed. So, the object distance is changed, the
if the object distance is changed, then image distance is adjusted by moving
the focal length is changed to create the lens.
sharp image. This is done by
changing the shape of the lens; a
muscle called ciliary muscle does the
job.

Comparison between bird flying and aircraft:

Bird flying Aircraft

1. Birds flap their wings to fly. 1. Airplane have engine, wiring system,
cables and fuel to fly.
2. Birds use metabolic energy (ATP) to 2. Airplane use fuel energy to fly.
fly.
3. Bird’s wings provide lift and thrust. 3. Airplane’s wings have an airfoil
shape that only provides lift
(following Bernoulli principle).
4. Birds can change their wing span’s 4. Airplane can twist and turn but cannot
shape. change their wing span’s shape.
Most exciting aspect of biology as an independent scientific discipline:
Biology is the branch of science which deals with the study of the various aspects of living
beings. It is a science that seeks to understand how living things perform their life activities.
Therefore, it is more appropriately called ‘Life Science’.
Though the definition of biology appears very simple, the branch is equally complex and
extensive, as it deals with the various exciting aspects of the enormous number of living
organisms spread in time and space. The branch deals with –
 Structural organisation of living organisms.
 Functions of their body parts.
 Habitats where they live.
 Their relationship and interaction among themselves as well as surrounding
environment.
 How they pass their specific characters to the next generations.
 How they have evolved from primitive to more advance forms.

Why we need to study biology?

Following are some of the many reasons to study biology –
 Biology has made us aware of the structure and function of human’s own body,
organs and systems.
 Biology has provided improved food, comforts and luxury by acquiring knowledge
about beneficial plants and animals.
 Biology has led to the discovery and development of new and better varieties of crop,
to solve food problem.
 Biology has helped in discovering causes and methods of eradication of disease
causing germs.
 Biology has helped us to discover and manufacture medicine for treating various
diseases.
 Biology teaches us to conserve natural resources, forests, wild animals, etc. for
maintaining environmental equilibrium.
 Biology has helped us to understand intricate relationship that exists among
organisms in an ecosystem.
 Biology reminds us our role and responsibility to protect our physical and biological
environment.
 Biology has made us aware of the environmental hazards caused by our activities like
discharge of pollutants, unmindful wastage of natural resources, indiscriminate felling
of trees, etc.
 Biology enhances our faculty of appreciation of the beauty of rich biodiversity.

Biological observations of 18th century that led to major discoveries

(example from Brownian motion and origin of Thermodynamics, by
referring to the original observation of Robert Brown and Julius Mayer):
Discovery of Brownian motion and original observation of Robert Brown:

Brownian motion (random motion of particles suspended in a fluid resulting from their
collison with fast moving molecules in the fluid) is named after the botanist Robert Brown,
who first discovered this phenomenon in 1827, while looking through a microscope at pollen
of the plant Clarkia pulchella immersed in water. In 1905, almost 80 years later, physicist
Albert Einstein published a research paper, where he modelled the motion of pollen as being
moved by individual water molecules, making one of his first big contribution to science.
This explanation of Brownian motion served as convincing evidence that atoms and
molecules exist and was further verified experimentally by Jean Perrin in 1908. Perrin was
awarded Nobel Prize in Physics in 1926.

Observation of Julius Robert von Mayer and origin of Thermodynamics:

Julius R. Mayer was a German physician. He is best known for enunciating in 1841, one of
the original statements of the conservation of energy, or what is known as one of the first
version of ‘First Law of Thermodynamics’, namely, energy can neither be created nor
destroyed. He proposed that plants convert light energy into chemical energy. In, 1842,
Mayer described the vital chemical process, now referred to as oxidation as the primary
source of energy for any living creature.
MCQ on Hardness of water
1. Permanent hardness of water cannot be removed by which one of the following methods?
(a) Treatment with washing soda, (b) Calgon’s method
(c) Boiling, (d) Ion-exchange method
2. Temporary hardness of water arises due to the presence of
(a) 𝐻𝐶𝑂 , (b) 𝐶𝑂 , (c) 𝐶𝑙 , (d) 𝑆𝑂
3. The unit of hardness of water is generally expressed as
(a) 𝑔𝑚⁄𝑙 , (b) 𝑔𝑚 𝑚𝑜𝑙𝑒𝑠⁄𝑙 , (c) 𝑔𝑚 𝑒𝑞𝑢𝑖𝑣 ⁄𝑙 , (d) 𝑚𝑔⁄𝑙
4. Which one of the following water samples is expected to have the least hardness?
(a) Sea water, (b) Pond water, (c) Ground water, (d) Tap water.
5. Adding lime in water will remove which one of the following type of hardness of water?
(a) Nitrates of 𝐶𝑎 , (b) Chlorides of 𝐶𝑎 ,
(c) Bicarbonates of 𝐶𝑎 , (d) Sulphates of 𝐶𝑎 .
6. Which one of the following should have the highest hardness value in ppm?
(a) Tap water, (b) Rain water, (c) Sea water, (d) River water.
7. Which one of the following is true? Carbonates and bicarbonates
(a) are acidic, (b) are alkaline, (c) are neutral, (d) form lather with soap
8. Hardness of water arises due to the presence of salts of
(a) K, (b) Ca, (c) Al, (d) Cr.
9. Which one of the following is used in softening of hard water?
(a) 𝐴𝑙 (𝑂𝐻) , (b) 𝐶𝑎𝐶𝑂 , (c) 𝐶𝑎(𝑂𝐻) , (d) 𝑀𝑔(𝑂𝐻)

10. Which one of the following is not present in zeolite?

(a) 𝑆𝑖𝑂 , (b) 𝑁𝑎 𝑂, (c) 𝐴𝑙 𝑂 , (d) 𝐵 𝑂 .

11. Which one of the following is used to regenerate zeolite bed?

(a) 𝑁𝑎𝐶𝑙, (b) 𝐴𝑙(𝐶𝑙) , (c) 𝑁𝑎𝑂𝐻, (d) 𝐶𝑎(𝑂𝐻) .

Prof. ABM 3 MC-401

1. What is the primary advantage of pipelining in CPU architecture?

a) Increased memory capacity

b) Reduced clock speed

c) Improved instruction throughput

d) Higher power consumption

Answer: c) Improved instruction throughput

2. In a pipelined CPU, each instruction is executed in multiple stages. What are the common pipeline stages?

a) Fetch, Decode, Execute, Store

b) Load, Store, Execute

c) Read, Write, Compute

d) Input, Process, Output

Answer: a) Fetch, Decode, Execute, Store

3. If a pipeline has 'K' stages and 'n' instructions, how many clock cycles are required to complete execution?

a) K * n

b) K + n - 1

c) n / K

d) K + n

Answer: b) K + n - 1

4. Which of the following best describes pipeline performance?

a) It always doubles the speed of execution.

b) It depends on the number of pipeline stages and dependencies.

c) It decreases the performance due to synchronization issues.

d) It only improves memory access times.

Answer: b) It depends on the number of pipeline stages and dependencies.

5. Which type of delay in a pipeline occurs due to resource conflicts?

a) Structural hazard

b) Data hazard
c) Control hazard

d) Instruction hazard

Answer: a) Structural hazard

6. What does the term 'pipeline stall' mean?

a) Increasing the pipeline depth

b) A delay due to dependencies between instructions

c) Speeding up execution

d) Adding extra functional units

Answer: b) A delay due to dependencies between instructions

7. The speed-up factor of a pipeline is ideally equal to the number of:

a) Registers

b) Pipeline stages

c) Instructions

d) Data dependencies

Answer: b) Pipeline stages

8. What is the main disadvantage of pipelining?

a) Reduced memory performance

b) Complexity and potential hazards

c) Increased power consumption

d) Reduced instruction execution

Answer: b) Complexity and potential hazards

9. Which hazard occurs when a required operand is not yet available?

a) Control hazard

b) Data hazard

c) Structural hazard

d) Instruction hazard
Answer: b) Data hazard

10. The speed-up of a pipelined architecture compared to a non-pipelined one is given by:

a) (n * K) / (K + n - 1)

b) K / n

c) K * n

d) 1 / (K + n)

Answer: a) (n * K) / (K + n - 1)

11. What is the function of the instruction register (IR) in pipelining?

a) Decodes the instruction

b) Stores the instruction address

c) Executes the instruction

d) Stores the result

Answer: a) Decodes the instruction

12. Which of the following is an example of a synchronous pipeline?

a) CPU pipeline

b) Non-uniform delay pipeline

c) Asynchronous pipeline

d) Feedback pipeline

Answer: a) CPU pipeline

13. In a 4-stage pipeline with stage delays 10 ns, 15 ns, 12 ns, and 8 ns, what is the clock cycle time?

a) 8 ns

b) 10 ns

c) 15 ns

d) 12 ns
Answer: c) 15 ns

14. What is a reservation table used for in pipeline scheduling?

a) To store instruction results

b) To track stage utilization

c) To optimize memory access

d) To reduce power consumption

Answer: b) To track stage utilization

15. What is a non-linear pipeline?

a) A pipeline with a fixed sequence of operations

b) A pipeline with feedback and feed-forward paths

c) A pipeline with a uniform delay

d) A pipeline with a single execution unit

Answer: b) A pipeline with feedback and feed-forward paths

16. What is the main challenge in designing a pipelined processor?

a) Managing dependencies between instructions

b) Increasing the clock cycle time

c) Reducing the number of registers

d) Eliminating all hazards

Answer: a) Managing dependencies between instructions

17. What does MAL (Minimum Average Latency) indicate in pipelining?

a) The shortest execution time of an instruction

b) The least amount of delay in the pipeline

c) The smallest latency between successive instructions

d) The minimum clock period

Answer: c) The smallest latency between successive instructions

18. Which of these pipelines can be dynamically reconfigured for different tasks?
a) Static pipeline

b) Scalar pipeline

c) Multifunction pipeline

d) Linear pipeline

Answer: c) Multifunction pipeline

19. What is the purpose of an acknowledgment signal in an asynchronous pipeline?

a) To synchronize stages

b) To indicate the end of execution

c) To confirm data transfer

d) To store intermediate results

Answer: c) To confirm data transfer

20. In a reservation table, multiple marks in a row indicate:

a) Simultaneous stage usage

b) A slow stage

c) A non-functional pipeline

d) No execution delay

Answer: b) A slow stage

21. Which of the following does NOT affect pipeline efficiency?

a) Number of stages

b) Data dependencies

c) Branching instructions

d) Cache size

Answer: d) Cache size

22. What is the role of the clock pulse in a synchronous pipeline?

a) To keep track of executed instructions

b) To control data flow between pipeline stages

c) To increase memory speed

d) To store intermediate results

Answer: b) To control data flow between pipeline stages

23. Which of these is NOT a common type of pipeline?

a) Arithmetic pipeline

b) Instruction pipeline

c) Software pipeline

d) Execution pipeline

Answer: c) Software pipeline

24. What is the primary goal of a pipeline scheduler?

a) Reduce clock cycle time

b) Maximize pipeline utilization

c) Minimize instruction execution time

d) Reduce CPU power consumption

Answer: b) Maximize pipeline utilization

25. Which type of hazard is caused by branch instructions in a pipeline?

a) Data hazard

b) Structural hazard

c) Control hazard

d) Execution hazard

Answer: c) Control hazard

26. What is the main purpose of pipelining in a CPU?

a) To increase the CPU clock speed

b) To reduce the number of instructions
c) To execute multiple instructions simultaneously
d) To decrease memory access time

Answer: c) To execute multiple instructions simultaneously

27. In a 5-stage pipeline, how many instructions can be in different stages at the same
time?

a) 1
b) 5
c) 10
d) Unlimited

Answer: b) 5

28. What is a key requirement for achieving maximum pipeline speedup?

a) All instructions must be of the same type

b) No data dependencies between instructions
c) Pipeline must have fewer stages
d) The pipeline must be asynchronous

Answer: b) No data dependencies between instructions

29. A 4-stage pipeline completes its first instruction in 10 ns per stage. How much time
will it take to complete 100 instructions?

a) 400 ns
b) 1000 ns
c) 1030 ns
d) 2000 ns

Answer: c) 1030 ns

30. What is a pipeline "bubble"?

a) Extra time required to synchronize instructions

b) A delay caused by a hazard
c) An instruction that executes twice
d) A reduction in pipeline performance due to data redundancy

Answer: b) A delay caused by a hazard

31. How does pipelining improve CPU efficiency?

a) By reducing execution time per instruction

b) By executing multiple instructions in parallel
c) By increasing cache memory size
d) By using multiple ALUs

Answer: b) By executing multiple instructions in parallel

32. What happens when a branch instruction is encountered in a pipeline?

a) The pipeline continues execution normally

b) The pipeline stalls until the branch outcome is determined
c) The pipeline skips the next instruction
d) The pipeline restarts execution from the beginning

Answer: b) The pipeline stalls until the branch outcome is determined

33. Which type of pipeline delay occurs due to an instruction waiting for a previous
instruction's result?

a) Control hazard
b) Data hazard
c) Structural hazard
d) Execution hazard

Answer: b) Data hazard

34. In a non-pipelined system, how many instructions execute at a time?

a) 1
b) 2
c) Depends on CPU architecture
d) Unlimited

Answer: a) 1
35. Which of the following is NOT an advantage of pipelining?

a) Increased instruction throughput

b) Lower execution time for each instruction
c) Efficient use of CPU resources
d) Parallel execution of different instruction stages

Answer: b) Lower execution time for each instruction

36. Which hazard occurs when multiple instructions require the same resource
simultaneously?

a) Control hazard
b) Data hazard
c) Structural hazard
d) Instruction hazard

Answer: c) Structural hazard

37. If a non-pipelined system takes 100 ns per instruction and a 5-stage pipeline reduces
it to 25 ns, what is the speedup?

a) 2x
b) 3x
c) 4x
d) 5x

Answer: d) 5x

38. Which type of pipeline executes a sequence of arithmetic operations?

a) Instruction pipeline
b) Arithmetic pipeline
c) Memory pipeline
d) Execution pipeline

Answer: b) Arithmetic pipeline

39. Which factor limits the theoretical speedup of pipelining?

a) Instruction size
b) Pipeline depth
c) Number of registers
d) Pipeline hazards

Answer: d) Pipeline hazards

40. What is the role of pipeline registers?

a) To store intermediate results between stages

b) To increase memory access speed
c) To execute arithmetic operations
d) To store the final execution result

Answer: a) To store intermediate results between stages

41. The efficiency of a pipeline increases when:

a) The number of pipeline stages increases indefinitely

b) The number of instructions processed per clock cycle increases
c) The instruction length is decreased
d) The CPU clock speed is reduced

Answer: b) The number of instructions processed per clock cycle increases

42. Which statement about pipeline hazards is true?

a) They always stop execution completely

b) They can be minimized but not eliminated
c) They only occur in non-pipelined systems
d) They do not affect performance

Answer: b) They can be minimized but not eliminated

43. How can data hazards be resolved in pipelining?

a) By increasing memory size

b) By using forwarding or bypassing
c) By reducing pipeline stages
d) By increasing instruction width

Answer: b) By using forwarding or bypassing

44. What is instruction interleaving in pipelining?

a) Executing two instructions at the same time

b) Alternating instructions in different pipeline stages
c) Delaying instructions to avoid hazards
d) Fetching two instructions at once

Answer: b) Alternating instructions in different pipeline stages

45. What is the primary function of the CPU scheduler in a pipelined processor?

a) Fetching instructions from memory

b) Managing instruction execution order
c) Decoding instructions
d) Storing execution results

Answer: b) Managing instruction execution order

46. Which of the following can increase pipeline performance?

a) Increasing clock cycle time

b) Using hazard detection and resolution techniques
c) Decreasing memory bandwidth
d) Increasing the number of pipeline stalls

Answer: b) Using hazard detection and resolution techniques

47. Which pipeline architecture allows dynamic configuration to execute multiple

functions?

a) Static pipeline
b) Scalar pipeline
c) Multifunction pipeline
d) Unifunction pipeline

Answer: c) Multifunction pipeline

48. What is the function of a latch in a synchronous pipeline?

a) To store final instruction results

b) To hold intermediate data between pipeline stages
c) To reduce power consumption
d) To decrease instruction execution time
Answer: b) To hold intermediate data between pipeline stages

49. What is the main drawback of a deeper pipeline?

a) Increased power consumption

b) Reduced instruction execution speed
c) More frequent pipeline stalls
d) Decreased CPU frequency

Answer: c) More frequent pipeline stalls

50. A pipeline is said to be full when:

a) All pipeline stages are occupied with different instructions

b) The CPU executes only one instruction at a time
c) The memory is completely used
d) All instructions are stored in cache

Answer: a) All pipeline stages are occupied with different instructions