2023, 2021, 2020, 2019, 2016, 2017, 2018

UNIT 1

What is integer? How it is stored in memory?

Write a brief note on 'stored program concept'.

Explain how integer and fractions are stored in memory.

Explain the communication process between computer and peripheral devices.

What is stored program concept? write a brief note on central processing Unit.

What is data storage? Explain main memory. How it is different from secondary memory.

What do you mean by data storage?

Explain the various types of storage devices in brief.

With the help of suitable block diagram explain the central processing Unit.

Describe central processing Unit with its components and their functions.

Draw a block diagram of a computer and explain working principle of each part.

Explain the Block Diagram of a Computer.

Explain Floating Point Representation.

Explain the following:

(a) Storing fractions

(b) Communication error

Explain arithmetic and logical instructions with suitable examples.

UNIT 2
What is network? Write a brief note on network protocol.

What is software? Write the characteristics of software.

What is operating system? Explain its architecture.

Explain the benefits of modular approach of software development i.e. modularity.

What is operating system? Explain functions of operating system.

Define and explain the following terms:

1. Software engineering

2. Modularity

What are the different network protocols?

What is software development life cycle? Explain its various types in brief.

What are the software development tools and techniques? Explain.

What are the main function of an operating system in a computer? Describe.

Explain the following:

(a) Software ownership and liability

(b) Functions of an Operating System

Explain the following:

(a) Network Protocol

(b) Booting Process of DOS

What is operating system architecture? Explain.

What is the software life cycle? Explain.

UNIT 3

What is an algorithm? What are the characteristics of an algorithm?

What is parallel computing? Write advantage, disadvantage and applications of parallel computing.
Write recursive algorithm to calculate factorial of any given number.

What is parallel computing? Explain its benefits.

Define parallel computing. Explain its advantage.

What is algorithm? Explain its characteristics.

What is iterative structure? Explain.

What do you mean by declarative computing? Explain.

What do you understand by parallel computing? Explain in detail.

Explain the following:

1. Algorithm

2. Language Implementation

What is the efficiency and correctness of algorithms? Explain.

What is parallel computing? Explain.

Explain Recursive Function with a suitable example.

Explain the following:

(a) Parallel Computing

(b) Declarative Computing

UNIT 4

What is stack? How to insert and delete an item from stack? Write applications of stack.

What is database? Write a brief note on object oriented database.

What is stack? Explain its applications.

Explain E-R model with example.

Write a brief note on following data structure:

1. Array

2. Stack

Write a brief note on E-R model.

What is object oriented programming? What are main features of OOP?

What is relational model? Explain.

What are arrays? How will declare multidimensional arrays? Explain with example.

What are files? Explain indexed files.

Explain the features of an Object-Oriented Database.

Write an algorithm to insert and delete an element in a queue.

Explain the following:

(a) Array

(b) Stacks

What is hashed file organization? Explain.

UNIT 5

What is artificial neural network? Write its application area.

Write a brief note on computable and non-computable function.

Explain the applications of artificial intelligence.

Explain turing machine model.

Write a brief note on turing machine.

Define artificial neural network. Write its application.

What is computable and non-computable function?

What is artificial neural network? Explain.

What are problem classification? Explain in detail.

What is artificial neural network? Explain its structure.

Explain the following:

(a) Artificial Neural Network

(b) A Non-Computable Function

Explain the following:

(a) Control System Activities

(b) Applications of AI

What is artificial intelligence? Explain.

What is a Turing machine? Explain.

What is a Turning machine? Explain.

A Turing Machine is a theoretical computational model introduced by Alan Turing in 1936. It is a

mathematical abstraction used to define what can be computed algorithmically. The Turing machine
provides the foundation for modern computer science and the concept of computability.

Definition

A Turing machine consists of an infinite tape, a tape head, a finite control unit, and a set of rules
(transition functions). It operates by reading, writing, and moving along the tape according to these
rules.

Components of the Turing Machine Model

A Turing Machine consists of the following main components:

1. Infinite Tape
 o The tape acts as the memory of the machine, divided into discrete cells.

o Each cell contains a symbol from a finite set (alphabet).

o The tape extends infinitely in both directions, allowing unlimited storage.

2. Tape Head

o The machine has a movable tape head that reads and writes symbols on the tape.

o It can move left or right based on the transition rules.

3. Finite Control Unit

o This unit acts as the processor of the machine.

o It maintains a finite set of states, including an initial state and one or more halting
states.

o The current state and the symbol being read determine the machine’s next action.

4. Transition Function

o A function that defines how the machine behaves.

o It specifies:

 Which symbol to write.

 Which direction to move (left or right).

 What the next state should be.

Working of the Turing Machine Model

1. The machine starts in an initial state with the tape containing an input string.

2. The tape head reads the symbol under it.

3. Based on the current state and symbol, the transition function determines:

o The new symbol to write on the tape.

o The movement of the tape head (left or right).

o The next state of the machine.

4. The process continues until the machine reaches a halting state, meaning the computation
is complete.

Types of Turing Machines

1. Deterministic Turing Machine (DTM): For each state and symbol, there is a unique action.

2. Non-Deterministic Turing Machine (NDTM): Multiple possible actions exist for a given state
and symbol.

3. Universal Turing Machine (UTM): Can simulate any other Turing machine by reading its
description from the tape.
Importance of Turing Machines

 Foundation of Computability Theory: Determines which problems can be solved

algorithmically.

 Church-Turing Thesis: States that any computation possible in the real world can be
performed by a Turing machine.

 Basis for Modern Computers: Though not a physical device, Turing machines model real-
world computers conceptually.

Conclusion

A Turing machine is a powerful computational model that helps define the limits of computation. It
plays a crucial role in theoretical computer science, influencing complexity theory, artificial
intelligence, and the development of modern computing systems.

What is artificial neural network? Write its application

area.
Artificial Neural Network (ANN)

An Artificial Neural Network (ANN) is a computational model inspired by the human brain. It
consists of interconnected processing units called neurons, which work together to process
information and make predictions. ANNs are a fundamental part of machine learning and artificial
intelligence, helping solve complex problems like image recognition, speech processing, and data
classification.

Structure of an Artificial Neural Network

An ANN consists of multiple layers of interconnected artificial neurons, each playing a specific role
in data processing. The structure of an ANN includes:

1. Input Layer

 The first layer of the network that receives raw data.

 Each neuron in this layer represents a feature of the input (e.g., pixels in an image, words
in a text).

 The number of neurons in this layer depends on the number of input features.

2. Hidden Layers

 The intermediate layers between the input and output layers.

  Neurons in these layers perform computations using weights, biases, and activation
functions.

 These layers extract and transform patterns from the input data.

 The more hidden layers a network has, the deeper and more complex its learning ability
(Deep Neural Networks).

3. Output Layer

 The final layer that provides the network’s output or prediction.

 The number of neurons in this layer depends on the type of problem:

o Binary classification: 1 neuron with activation functions like Sigmoid.

o Multi-class classification: Multiple neurons with Softmax activation.

o Regression problems: A single neuron with a linear activation function.

Working of ANN

1. Forward Propagation: The input passes through the network, and each neuron processes
the data using a weighted sum and activation function.

2. Loss Calculation: The error between the predicted and actual output is calculated.

3. Backward Propagation: The error is propagated backward, adjusting weights using

optimization techniques like Gradient Descent.

4. Training: The process repeats for multiple iterations (epochs) until the model achieves
optimal performance.

Application Areas of Artificial Neural Networks

1. Image Recognition & Computer Vision

o Facial recognition (e.g., in smartphones and security systems).

o Object detection and medical imaging (e.g., tumor detection in X-rays).

2. Natural Language Processing (NLP)

o Sentiment analysis (e.g., analyzing customer reviews).

o Chatbots and virtual assistants (e.g., Siri, Alexa, ChatGPT).

3. Finance & Banking

o Fraud detection in credit card transactions.

o Stock market prediction and risk assessment.

4. Healthcare & Medicine

o Diagnosis of diseases (e.g., AI-assisted detection of cancer).

o Personalized treatment recommendations.

 5. Autonomous Vehicles

o Self-driving cars use ANNs for object detection, path planning, and decision-making.

6. Robotics

o AI-powered robots learn and adapt to environments using neural networks.

7. Recommendation Systems

o Netflix, YouTube, and Amazon use ANNs to suggest movies, videos, and products.

Conclusion

Artificial Neural Networks are a powerful tool for solving complex problems across industries. Their
ability to learn from data and improve decision-making makes them essential in modern AI
applications.

Write a brief note on computable and non-

computable function.

Computable and Non-Computable Functions

In computer science and mathematical logic, functions can be classified into computable and non-
computable based on whether they can be solved using a Turing Machine or any algorithmic
process.

Computable Functions

A computable function is a function for which an algorithm exists that can determine its output for
any given input within a finite amount of time. This means that a Turing machine can compute the
function and halt with a correct answer.

Characteristics of Computable Functions:

1. Existence of an Algorithm

 A computable function has a well-defined procedure (algorithm) to determine its output

for any given input.

2. Finite Execution Time

 The function always produces an output within a finite number of steps.

3. Turing Computability

 A Turing machine can compute the function and halt for every valid input.

4. Deterministic Behavior

  The function follows a step-by-step procedure, ensuring the same input always produces
the same output.

Examples of Computable Functions:

1. Arithmetic Operations: Addition, subtraction, multiplication, and division.

2. Polynomial Functions: Any function of the form f(x)=ax2+bx+cf(x) = ax^2 + bx + c.

3. Sorting Algorithms: Bubble sort, quicksort, and merge sort.

4. GCD (Greatest Common Divisor): Euclidean algorithm for computing GCD.

5. Factorial Function: n!n! computed using a recursive or iterative approach.

Non-Computable Functions

A non-computable function is a function for which no algorithm exists that can compute the output
for all possible inputs. These functions cannot be solved by a Turing machine, meaning there is no
general method to determine their values.

Characteristics of Non-Computable Functions:

1. No Universal Algorithm

 There is no step-by-step method to compute the function for all possible inputs.

 2. Undecidability

 The function is related to undecidable problems, meaning it is impossible to determine the

result in all cases using an algorithm.

 3. Infinite or Unpredictable Execution

 A Turing machine may never halt when trying to compute the function, making it
impossible to find a solution in a finite amount of time.

4. Relates to Theoretical Limits of Computation

 Non-computable functions define the boundaries of what can and cannot be computed
mathematically.

Examples of Non-Computable Functions:

1. Halting Problem: Alan Turing proved that no algorithm can determine whether an arbitrary
program will halt or run forever.

2. Busy Beaver Function: A function that grows faster than any computable function, making it
non-computable.

3. Kolmogorov Complexity: The shortest possible program that outputs a given string cannot
always be computed.

4. Decision Problems in Formal Logic: Problems like the Entscheidungsproblem, which asks
whether a given statement in first-order logic is provable, are non-computable.

Conclusion
Computable functions form the foundation of algorithmic problem-solving, while non-computable
functions define the limits of computation. Understanding these concepts helps in theoretical
computer science, complexity theory, and artificial intelligence.

What is artificial intelligence? Explain.

Artificial Intelligence (AI)

Artificial Intelligence (AI) is a branch of computer science that focuses on creating systems capable
of performing tasks that typically require human intelligence. These tasks include learning,
reasoning, problem-solving, perception, and natural language understanding. AI enables machines to
mimic human cognitive functions, allowing them to analyze data, recognize patterns, and make
decisions.

Types of Artificial Intelligence

1. Narrow AI (Weak AI)

o Designed to perform a specific task (e.g., voice assistants, recommendation systems).

o Cannot perform tasks beyond its programmed scope.

o Examples: Siri, Google Assistant, spam filters.

2. General AI (Strong AI)

o Has human-like intelligence and can perform any intellectual task that a human can.

o Capable of reasoning, learning, and adapting to different situations.

o Currently theoretical and not yet developed.

3. Super AI

o A hypothetical AI that surpasses human intelligence.

o Capable of independent thinking and problem-solving.

o Still a subject of research and debate.

Key Components of AI

1. Machine Learning (ML)

o A subset of AI that allows machines to learn from data and improve their
performance over time without being explicitly programmed.

o Types: Supervised learning, Unsupervised learning, and Reinforcement learning.

2. Deep Learning

o A branch of ML that uses artificial neural networks to process complex data.

o Used in speech recognition, image processing, and autonomous driving.

 3. Natural Language Processing (NLP)

o Enables computers to understand and process human language.

o Used in chatbots, language translation, and sentiment analysis.

4. Computer Vision

o Allows machines to interpret and analyze visual information from the real world.

o Used in facial recognition, medical imaging, and self-driving cars.

5. Expert Systems

o AI systems that mimic human decision-making in specialized fields like healthcare

and finance.

Applications of AI

1. Healthcare

 AI-powered diagnosis using medical imaging (e.g., detecting cancer in X-rays).

 Robotic surgeries and drug discovery.

 Virtual health assistants and chatbots for patient support.

 2. Finance

 Fraud detection using machine learning algorithms.

 Algorithmic trading for stock market predictions.

 Credit scoring and risk assessment for loans.

3. Education

 Personalized learning through AI-driven tutoring systems.

 Automated grading of assignments and exams.

 AI-powered chatbots for student support.

4. Autonomous Vehicles

 AI in self-driving cars for navigation and traffic management.

 Object detection and collision avoidance systems.

5. E-commerce & Retail

 AI-based recommendation systems (Amazon, Netflix).

 Chatbots for customer support.

 Demand forecasting for inventory management.

6. Cybersecurity

 AI-driven threat detection and fraud prevention.

  Automated security systems for data protection.

Conclusion

Artificial Intelligence is transforming industries by enabling machines to perform intelligent tasks.

While AI has made significant progress, the development of General AI and Super AI remains a
challenge. The future of AI holds immense potential in advancing automation, improving decision-
making, and revolutionizing various sectors.

Explain Control System Activities.

Control System Activities

A Control System is a system that manages, directs, or regulates the behavior of other systems using
control loops. It ensures that a process operates within desired limits by monitoring and adjusting
inputs accordingly. Control systems are widely used in engineering, industrial automation, robotics,
and electronics.

Key Activities in Control Systems

1. Measurement and Sensing

o Control systems use sensors to measure real-world variables like temperature,

pressure, speed, and voltage.

o These measurements provide feedback to the system for further processing.

2. Signal Processing

o The collected sensor data is processed to remove noise and improve accuracy.

o Analog signals are converted to digital signals for further computation if necessary.

3. Decision Making & Control Algorithm Execution

o The system compares measured values with the desired setpoint.

o A controller (e.g., PID controller) decides the corrective action required.

4. Actuation (Output Adjustment)

o The system sends control signals to actuators (e.g., motors, valves) to adjust the
process.

o This action ensures that the system maintains its desired performance.

5. Feedback Mechanism

o A closed-loop control system continuously monitors output and adjusts inputs

accordingly.

o This feedback loop helps in achieving stability and accuracy.

 6. Error Detection & Correction

o If deviations occur, the system takes corrective actions to minimize errors.

o Adaptive and intelligent control systems adjust parameters automatically.

Conclusion

Control system activities involve measurement, processing, decision-making, actuation, and feedback
to regulate a system effectively. These activities ensure stability, efficiency, and accuracy in industrial,
mechanical, and electronic applications.

What are problem classification? Explain in

detail.
Problem Classification

Problem classification in computer science refers to the systematic categorization of problems based
on their complexity, nature, and solution approach. Proper classification helps in selecting
appropriate algorithms, computational models, and methodologies to solve a problem efficiently.

Types of Problem Classification

1. Based on Solution Approach

 Computable Problems: Problems that have a well-defined algorithm to produce a solution in

a finite amount of time. Example: Sorting, Searching, Arithmetic calculations.

 Non-Computable Problems: Problems that cannot be solved by any algorithm, such as the
Halting Problem, which determines whether a given program will terminate or run
indefinitely.

2. Based on Complexity Theory (Time & Space Complexity)

 P (Polynomial Time) Problems: Problems that can be solved in polynomial time, i.e., the
execution time grows at a reasonable rate (e.g., Sorting, Graph Traversal).

 NP (Nondeterministic Polynomial Time) Problems: Problems for which a solution can be

verified in polynomial time, but finding a solution may take exponential time (e.g., Traveling
Salesman Problem).

 NP-Hard Problems: Problems that are at least as hard as the hardest problems in NP, but not
necessarily in NP (e.g., Halting Problem).

 NP-Complete Problems: Problems that belong to both NP and NP-Hard categories (e.g.,
Boolean Satisfiability Problem).
3. Based on Problem Domain

 Optimization Problems: Problems that seek to find the best possible solution from a set of
feasible solutions (e.g., Shortest Path in a Graph).

 Decision Problems: Problems that require a Yes/No answer (e.g., Is a given number prime?).

 Search Problems: Problems that require finding a particular value in a dataset (e.g., Binary
Search).

4. Based on Problem Nature

 Deterministic Problems: Problems where the outcome is predictable and follows a specific
set of rules (e.g., Solving Linear Equations).

 Non-Deterministic Problems: Problems where multiple outcomes are possible, often

requiring heuristics (e.g., Chess Playing AI).

5. Based on Computational Model

 Sequential Problems: Problems that can be solved step-by-step in a single processor system.

 Parallel Problems: Problems that can be broken into subproblems and solved simultaneously
on multiple processors.

Conclusion

Problem classification helps in identifying the complexity, nature, and computational requirements of
a problem. It is essential in computer science for selecting efficient algorithms and designing
effective solutions.