Computer Science

Sr. No. Core Areas Percentage

1. Programming Fundamentals 06%

2. Object Oriented Paradigm 05%
3. Discrete Structures 05%
4. Data Structures and Algorithms 09%
5. Digital Logic and Computer Organization 06%
6. Operating Systems 06%
7. Database Systems 07%
8. Software Engineering & Development 05%
9. Computer Communication and Networks 06%

10. Computer Architecture & Assembly Language 08%

11. Theory of Automata and Formal Languages 10%

12. Analysis of Algorithms 10%

13. Artificial Intelligence 07%

14. System Programming 05%

15. Numerical Computing 05%

Total 100%
 Computer Science (Detailed)

Sr. No. Core Areas Percentage

PROGRAMMING FUNDAMENTALS:

Overview of computers and programming.Overview of

language.Basics of structured and Modular programming.Basic
1. Algorithms and problem solving, development of basic algorithms, 6%
analyzing problem, designing solution, testing designed solution.
Fundamental programming constructs, translation of algorithms to
programmes, data types, control structures, functions, arrays, records,
files, testing programmes.

OBJECT ORIENTED PARADIGM:

Evolution of Object Oriented (OO) programming, OO concepts and

principles, problem solving in OO paradigm, OO programme design
2. 5%
process, classes, methods, objects and encapsulation; constructors and
destructors, operator and function overloading, virtual functions,
derived classes, inheritance and polymorphism. I/O and file
processing, exception handling.

DISCRETE STRUCTURES:

Introduction to logic and proofs: Direct proofs; proof by

contradiction, Sets, Combinatronics, Sequences, Formal logic,
Prepositional and predicate calculus, Methods of Proof, Mathematical
3. 5%
Induction and Recursion, loop invariants, Relations and functions,
Pigeonhole principle, Trees and Graphs, Elementary number theory,
Optimization and matching. Fundamental structures: Functions;
relations (more specifically recursions); pigeonhole principle;
cardinality and countability, probabilistic methods.

DATA STRUCTURES AND ALGORITHMS:

Introduction to data structures; Arrays, Stacks, Queues, Priority

Queues, Linked Lists, Trees, Spanning Trees, Graphs and Traversals.
4. 9%
Recursion, sorting and searching algorithms, Shortest path algorithms,
Hashing, Storage and retrieval properties and techniques for the
various data structures. Algorithm Complexity, Polynomial and
Intractable Algorithms, Classes of Efficient Algorithms, Divide and
Conquer, Dynamic, Greedy
5. 6%
DIGITAL LOGIC AND COMPUTER ORGANIZATION:
 5.1 Digital Logic_______________________________________3%
Overview of Binary Numbers, Boolean Algebra, switching algebra,
and logic gates, Karnaugh Map and Quin-McCluskey methods,
simplification of Boolean functions, Combinational Design; two level
NAND/NOR implementation, Tabular Minimization, Combinational
Logic Design: adders, subtracters, code converters, parity checkers,
multilevel NAND/NOR/XOR circuits, MSI Components, design and
use of encoders, decoders, multiplexers, BCD adders, and
comparators, Latches and flip-flops, Synchronous sequential circuit
design and analysis, Registers, synchronous and asynchronous
counters, and memories, Control Logic Design.

5.2 Computer Organiztion________________________________3%

Fundamentals of Computer Designincluding performance

measurements & quantitative principles, principles of Instruction Set
Design, Operands, addressing modes and encoding, pipelining of
Processors: Issues and Hurdles, exception handling features,
Instruction-Level Parallelism and Dynamic handling of Exceptions,
Memory Hierarchy Design, Cache Design, Performance Issues and
improvements, Main Memory Performance Issues, Storage Systems,
Multiprocessors and Thread Level Parallelism.

OPERATING SYSTEMS:

History and Goals, Evolution of multi-user systems, Process and CPU

management, Multithreading, Kernel and User Modes, Protection,
Problems of cooperative processes, Synchronization, Deadlocks,
6. 6%
Memory management and virtual memory, Relocation, External
Fragmentation, Paging and Demand Paging, Secondary storage,
Security and Protection, File systems, I/O systems, Introduction to
distributed operating systems. Scheduling and dispatch, Introduction
to concurrency.
 DATABASE SYSTEMS:

Basic database concepts; Entity Relationship modelling, Relational

data model and algebra, Structured Query language; RDBMS;
Database design, functional dependencies and normal forms;
7. 7%
Transaction processing and optimization concepts; concurrency
control and recovery techniques; Database security and authorization.
Physical database design: Storage and file structure; indexed files; b-
trees; files with dense index; files with variable length records;
database efficiency and tuning.

SOFTWARE ENGINEERING AND DEVELOPMENT:

Introduction to Computer-based System Engineering; Project

Management; Software Specification; Requirements Engineering,
8. System Modelling; Requirements Specifications; Software 5%
Prototyping; Software Design: Architectural Design, Object-Oriented
Design, UML modelling, Function-Oriented Design, User Interface
Design; Quality Assurance; Processes & Configuration Management;
Introduction to advanced issues: Reusability, Patterns; Assignments
and projects on various stages and deliverables of SDLC.

COMPUTER COMMUNICATION AND NETWORKS:

Analogue and digital Transmission, Noise, Media, Encoding,

Asynchronous and Synchronous transmission, Protocol design issues.
Network system architectures (OSI, TCP/IP), Error Control, Flow
9. 6%
Control, Data Link Protocols (HDLC, PPP). Local Area Networks
and MAC Layer protocols (Ethernet, Token ring), Multiplexing,
Switched and IP Networks, Inter-networking, Routing, Bridging,
Transport layer protocols TCP/IP, UDP. Network security issues.
Programming exercises, labs or projects involving implementation of
protocols at different layers.

COMPUTER ARCHITECTURE AND ASSEMBLY LANUGUAGE:

Microprocessor Bus Structure: Addressing, Data and Control,
Memory Organization and Structure (Segmented and Linear Models),
Introduction to Registers and Flags, Data Movement, Arithmetic and
10. Logic, Programme Control, Subroutines, Stack and its operation, 8%
Peripheral Control Interrupts.
Objectives and Perspectives of Assembly Language, Addressing
Modes, Introduction to the Assembler and Debugger, Manipulate and
translate machine and assembly code. Interfacing with high level
languages, Real-time application.
11. 10%
THEORY OF AUTOMATA AND FORMAL LANGUAGES:
 Finite State Models: Language definitions preliminaries, Regular
expressions/Regular languages, Finite automata (FAs), Transition
graphs (TGs), NFAs, Kleene’s theorem, Transducers (automata with
output), Pumping lemma and non regular language Grammars and
PDA: Context free grammars, Derivations, derivation trees and
ambiguity, Simplifying CFLs , Normal form grammars and parsing,
Decidability, Chomsky’s hierarchy of grammars Turing Machines
Theory: Turing machines, Post machine, Variations on TM, TM
encoding, Universal Turing Machine, Context sensitive Grammars,
Defining Computers by TMs.

ANALYSIS OF ALGORITHMS:

Asymptotic notations; Recursion and recurrence relations; Divide-

and-conquer approach; Sorting; Search trees; Heaps; Hashing;
12. 10%
Greedy approach; Dynamic programming; Graph algorithms;
Shortest paths; Network flow; Disjoint Sets; Polynomial and matrix
calculations; String matching; NP complete problems;
Approximation algorithms

7%
ARTIFICIAL INTELLIGENCE:

Artificial Intelligence: Introduction, Intelligent Agents. Problem-

solving: Solving Problems by Searching, Informed Search and
Exploration, Constraint Satisfaction Problems, Adversarial Search.
Knowledge and reasoning: Logical Agents, First-Order Logic,
Inference in First-Order Logic, Knowledge Representation. Planning
and Acting in the Real World. Uncertain knowledge and reasoning:
13.
Uncertainty, Probabilistic Reasoning, Probabilistic Reasoning over
Time, Making Simple Decisions, Making Complex Decisions.
Learning: Learning from Observations, Knowledge in Learning,
Statistical Learning Methods, Reinforcement Learning.
Communicating, perceiving, and acting: Communication,
Probabilistic Language Processing, Perception and Robotics.
Introduction to LISP/PROLOG and Expert Systems (ES) and
Applications.

14. 5%
SYSTEM PROGRAMMING:

System Programming overview: Application Vs. System

Programming, System Software, Operating System, Device Drivers,
OS Calls. Window System Programming for Intel386 Architecture:
16 bit Vs 32 bit, Programming, 32 bit Flat memory model, Windows
Architecture. Virtual Machine (VM)Basics, System Virtual Machine,
Portable Executable Format, Ring O Computer, Linear Executable
format, Virtual Device Driver (V + D), New Executable format,
Module Management, COFF obj format 16 bit. (Unix) other 32-bit
O.S Programming for I 386; Unix Binaryble format (ELF), Dynamic
 shared objects, Unix Kernel Programming (Ring O), Unix Device
Architecture (Character & Block Devices), Device Driver
Development, Enhancing Unix Kernel.
5%
NUMERICAL COMPUTING:

The concepts of efficiency, reliability and accuracy of a

method.Minimising computational errors.Theory of Differences,
Difference Operators, Difference Tables, Forward Differences,
15.
Backward Differences and Central Differences. Mathematical
Preliminaries, Solution of Equations in one variable, Interpolation and
Polynomial Approximation, Numerical Differentiation and Numerical
Integration, Initial Value Problems for Ordinary Differential
Equations, Direct Methods for Solving Linear Systems, Iterative
Techniques in Matrix Algebra, Solution of non-linear equations.
Total 100%
 10 questions related to Overview of computers and programming.Overview of language.Basics of
structured and Modular programming.Basic Algorithms and problem solving, development of basic
algorithms, analyzing problem, designing solution, testing designed solution. Fundamental
programming constructs, translation of algorithms to programmes, data types, control structures,
functions, arrays, records, files, testing programmes.
ChatGPT
ChatGPT
Sure, here are ten questions covering those topics:

1. Define structured programming and explain its importance in software development.

2. What are the basic components of a computer system? Briefly describe each component.
You
MCQs
ChatGPT
ChatGPT
Sure, here are ten multiple-choice questions (MCQs) based on the topics you provided:

1. What is the primary goal of structured programming? a) To write programs in a single,

unstructured manner b) To enhance code readability and maintainability c) To use only high-level
programming languages d) To develop complex algorithms quickly
2. Which of the following is a high-level programming language? a) Assembly language b) C c)
Machine language d) Binary code
3. Modular programming promotes: a) Writing code in a single large module b) Code
duplication and redundancy c) Code reusability and maintainability d) Using only global variables
4. Which step comes first in the process of algorithm development? a) Analysis b) Design c)
Testing d) Implementation
5. Testing in software development is important because it: a) Guarantees the absence of bugs
b) Identifies errors and defects in the program c) Saves time and effort during coding d) Eliminates
the need for documentation
6. Which of the following is a control structure in programming? a) Data type b) Function c)
Loop d) Array
7. Arrays are used to: a) Store data of different types b) Store data in a structured format c)
Execute a sequence of statements repeatedly d) Define custom data types
8. What is the purpose of a function in programming? a) To store a sequence of statements b)
To define a custom data type c) To perform a specific task and return a result d) To declare variables
and constants
9. Which data structure is used to store related pieces of information under one name? a) Array
b) Record c) File d) Function
10. What role do files play in programming? a) They are used to define custom data types b)
They allow for the execution of a sequence of statements c) They store data persistently on a storage
device d) They are used to declare variables and constants

Answers:
1. b) To enhance code readability and maintainability
2. b) C
3. c) Code reusability and maintainability
4. a) Analysis
5. b) Identifies errors and defects in the program
6. c) Loop
7. b) Store data in a structured format
8. c) To perform a specific task and return a result
9. b) Record
10. c) They store data persistently on a storage device
You
GAT subject test conducted by NTS
ChatGPT
ChatGPT
For the GAT Subject Test conducted by the National Testing Service (NTS), you might encounter
questions that cover a wide range of topics related to the subject you're being tested on. Here are
ten multiple-choice questions (MCQs) that could be relevant to a GAT Subject Test:

1. In C programming language, which of the following is used to allocate memory dynamically?

a) malloc() b) calloc() c) realloc() d) all of the above
2. Which sorting algorithm has the best time complexity in the worst-case scenario? a) Bubble
Sort b) Insertion Sort c) Quick Sort d) Merge Sort
3. In object-oriented programming (OOP), what is encapsulation? a) Binding data and functions
into a single unit b) Hiding the implementation details of an object c) Inheriting properties and
behavior from a parent class d) Accessing data and functions from outside the class
4. Which of the following data structures is best suited for implementing a dictionary? a) Array
b) Linked List c) Hash Table d) Stack
5. What is the time complexity of searching an element in a binary search tree (BST) in the
worst-case scenario? a) O(1) b) O(log n) c) O(n) d) O(n^2)
6. What is the purpose of a primary key in a database table? a) To uniquely identify each row in
the table b) To define constraints on the data types allowed in the table c) To establish relationships
with other tables d) To sort the rows in ascending order
7. Which of the following is a feature of the TCP/IP protocol suite? a) Connectionless
communication b) Guaranteed delivery of packets c) Broadcasting of packets to all devices on the
network d) Limited scalability
8. Which sorting algorithm is based on the divide-and-conquer strategy? a) Bubble Sort b)
Selection Sort c) Quick Sort d) Insertion Sort
9. In relational database management systems (RDBMS), what is a foreign key? a) A key that
uniquely identifies each row in a table b) A key that establishes relationships between tables c) A key
that is used for sorting rows in a table d) A key that is automatically generated by the database
system
10. Which of the following is NOT a valid SQL command? a) SELECT b) MODIFY c) INSERT d)
DELETE

Answers:
1. d) all of the above
2. c) Quick Sort
3. a) Binding data and functions into a single unit
4. c) Hash Table
5. b) O(log n)
6. a) To uniquely identify each row in the table
7. b) Guaranteed delivery of packets
8. c) Quick Sort
9. b) A key that establishes relationships between tables
10. b) MODIFY
 Certainly! Here are 70 multiple-choice questions (MCQs) distributed across various
categories relevant to the GAT Subject Test in Computer Science conducted by NTS:

Programming Fundamentals (06%)

1. Which of the following is not a valid data type in C programming language? a) int
b) float c) char d) string
2. What is the output of the following C code?
cCopy code
int x = 5; printf("%d", x++);
a) 5 b) 6 c) 4 d) 7
3. Which control structure is used to execute a block of code repeatedly in C? a) if-
else b) switch c) for d) break
4. In C programming, what does the "void" keyword indicate in a function
declaration? a) It returns an integer value b) It returns nothing c) It indicates an error d)
It is used for memory allocation
5. Which operator is used to access the value stored in a variable's memory address
in C? a) * b) & c) -> d) .

Object-Oriented Paradigm (05%)

6. What is inheritance in object-oriented programming (OOP)? a) Ability to access

data from any class b) Ability to define a new class from an existing class c) Ability to
hide data within a class d) Ability to redefine a method in a subclass
7. Which OOP concept allows a class to have multiple methods with the same name
but different parameters? a) Inheritance b) Polymorphism c) Encapsulation d)
Abstraction
8. What is the purpose of the "this" keyword in Java? a) It refers to the current class
object b) It refers to the superclass object c) It refers to the subclass object d) It refers to
the parent class object
9. What is a constructor in Java? a) A method used to destroy objects b) A method
used to initialize objects c) A method used to copy objects d) A method used to
compare objects
10. Which keyword is used to prevent a method from being overridden in a subclass
in Java? a) override b) final c) static d) abstract

Discrete Structures (05%)

11. Which of the following is not a valid logical connective? a) AND b) OR c) XOR d)
ADD
12. What is the negation of the statement "All humans are mortal"? a) All humans are
immortal b) No humans are mortal c) Some humans are mortal d) Some humans are
immortal
13. In set theory, the intersection of two sets A and B contains: a) All elements that
are in A or B b) All elements that are in both A and B c) All elements that are only in A,
not in B d) All elements that are only in B, not in A
14. What is the cardinality of an empty set? a) 0 b) 1 c) Undefined d) Infinite
15. Which of the following is not a valid quantifier in predicate logic? a) There exists
(∃) b) For all (∀) c) At least one (∃1) d) None of the above

Data Structures and Algorithms (09%)

16. Which data structure is used to represent a hierarchical relationship between

elements? a) Stack b) Queue c) Tree d) Graph
17. What is the time complexity of inserting an element at the end of a dynamic
array? a) O(1) b) O(log n) c) O(n) d) O(n^2)
18. Which sorting algorithm has the best time complexity in the average case? a)
Bubble Sort b) Selection Sort c) Merge Sort d) Quick Sort
19. What is the purpose of dynamic programming in algorithms? a) To optimize
space usage b) To solve problems by breaking them down into smaller subproblems c)
To reduce time complexity d) To analyze the behavior of algorithms
20. Which algorithm is used to find the shortest path in a weighted graph? a)
Breadth-First Search (BFS) b) Depth-First Search (DFS) c) Dijkstra's Algorithm d) Bellman-
Ford Algorithm

Digital Logic and Computer Organization (06%)

21. Which logic gate produces a high output only when all inputs are high? a) AND
gate b) OR gate c) NAND gate d) XOR gate
22. What is the binary representation of the decimal number 10? a) 1010 b) 1001 c)
1111 d) 1100
23. Which of the following is a volatile memory type? a) ROM b) EEPROM c) RAM d)
Flash memory
24. What is the purpose of the CPU in a computer system? a) To store data
permanently b) To execute instructions c) To provide input/output capabilities d) To
display graphical content
25. Which component is responsible for storing program instructions and data
temporarily in a computer system? a) ALU b) Cache memory c) Hard disk d) Optical drive

Operating Systems (06%)

26. What is the primary function of an operating system? a) To manage hardware
resources b) To compile source code c) To design user interfaces d) To create databases
27. Which scheduling algorithm gives priority to the process with the shortest
expected processing time? a) First-Come, First-Served (FCFS) b) Shortest Job Next (SJN)
c) Round Robin d) Priority Scheduling
28. What is the purpose of virtual memory in an operating system? a) To store
temporary files b) To provide additional storage space c) To extend the available RAM d)
To improve CPU performance
29. Which mechanism is used to prevent multiple processes from accessing shared
resources simultaneously? a) Mutual exclusion b) Deadlock avoidance c) Livelock
detection d) Semaphore
30. What is a device driver in an operating system? a) A program that translates
high-level instructions into machine code b) A program that controls hardware devices
c) A program that manages memory allocation d) A program that monitors system
performance

Database Systems (07%)

31. Which type of database model organizes data into tables with rows and columns?
a) Hierarchical b) Network c) Relational d) Object-Oriented
32. What is the purpose of a primary key in a database table? a) To uniquely identify
each row in the table b) To define constraints on the data types allowed in the table c)
To establish relationships with other tables d) To sort the rows in ascending order
33. Which database operation is used to retrieve specific data from a table based on
a given condition? a) INSERT b) UPDATE c) DELETE d) SELECT
34. What is the purpose of normalization in database design? a) To increase
redundancy b) To reduce data integrity c) To eliminate duplicate data d) To simplify
queries
35. Which type of join returns only the rows that have matching values in both tables
being joined? a) Inner join b) Outer join c) Left join d) Right join

Software Engineering & Development (05%)

36. What is the purpose of version control systems in software development? a) To

document code changes b) To track and manage changes to source code c) To compile
and execute code d) To test software applications
37. Which software development model is known for its iterative and incremental
approach? a) Waterfall model b) Spiral model c) Agile model d) V-model
38. What is the purpose of unit testing in software development? a) To test the entire
system as a whole b) To test individual components or units of code c) To validate user
requirements d) To optimize code performance
39. Which software development process involves breaking down requirements into
smaller, manageable tasks? a) Requirement analysis b) Design c) Implementation d) Task
decomposition
40. What is the purpose of a software requirement specification (SRS) document? a)
To design the user interface b) To define the functional and non-functional
requirements of the software c) To develop test cases d) To document code changes

Computer Communication and Networks (06%)

41. Which layer of the OSI model is responsible for logical addressing and routing? a)
Physical layer b) Data link layer c) Network layer d) Transport layer
42. What is the purpose of the TCP protocol in computer networks? a) To establish a
connection between devices b) To guarantee the delivery of packets c) To resolve
domain names to IP addresses d) To transmit data over the network
43. Which network topology connects all devices in a linear sequence? a) Bus b) Ring
c) Star d) Mesh
44. What is the purpose of DNS in computer networks? a) To translate domain names
to IP addresses b) To secure data transmission c) To establish a direct connection
between devices d) To filter network traffic
45. Which protocol is used to send email messages over the internet? a) HTTP b) FTP
c) SMTP d) TCP

Computer Architecture & Assembly Language (08%)

46. What is the purpose of the program counter (PC) in a CPU? a) To store
intermediate results b) To fetch the next instruction to be executed c) To perform
arithmetic operations d) To store data temporarily
47. Which instruction moves data from memory to a register in assembly language?
a) MOV b) ADD c) JMP d) CALL
48. What is the purpose of the ALU in a CPU? a) To store data temporarily b) To
perform arithmetic and logic operations c) To manage input/output devices d) To
execute program instructions
49. Which addressing mode is used to access memory locations directly using a fixed
address? a) Immediate b) Direct c) Indirect d) Indexed
50. What is the purpose of the stack pointer (SP) register in a CPU? a) To store the
address of the next instruction to be executed b) To store the address of the top of the
 stack c) To store intermediate results during arithmetic operations d) To store data
temporarily

Theory of Automata and Formal Languages (10%)

51. Which of the following is not a valid component of a finite automaton? a)

Alphabet b) States c) Transitions d) Variables
52. What is the purpose of regular expressions in formal language theory? a) To
define context-free languages b) To describe patterns of strings c) To generate Turing
machines d) To prove theorems about automata
53. Which type of automaton can recognize context-free languages? a) Finite
automaton b) Pushdown automaton c) Turing machine d) Deterministic automaton
54. What is the difference between a deterministic finite automaton (DFA) and a
nondeterministic finite automaton (NFA)? a) DFA has fewer states than NFA b) DFA can
recognize more languages than NFA c) DFA has deterministic transitions, while NFA has
nondeterministic transitions d) DFA can recognize context-free languages, while NFA
cannot
55. Which operation is used to concatenate two regular languages? a) Union b)
Intersection c) Concatenation d) Kleene star

Analysis of Algorithms (10%)

56. What is the time complexity of linear search in an unsorted array? a) O(1) b)
O(log n) c) O(n) d) O(n^2)
57. Which of the following is not a valid complexity class? a) P b) NP c) NP-hard d)
PSPACE
58. What is the time complexity of the bubble sort algorithm in the worst-case
scenario? a) O(1) b) O(log n) c) O(n) d) O(n^2)
59. Which algorithm is used to find the shortest path in an unweighted graph? a)
Dijkstra's algorithm b) Bellman-Ford algorithm c) Floyd-Warshall algorithm d) Breadth-
First Search (BFS)
60. What is the purpose of big O notation in the analysis of algorithms? a) To
represent the best-case time complexity of an algorithm b) To represent the average-
case time complexity of an algorithm c) To represent the worst-case time complexity of
an algorithm d) To represent the space complexity of an algorithm

Artificial Intelligence (07%)

61. Which of the following is not a subfield of artificial intelligence? a) Machine

learning b) Robotics c) Cryptography d) Natural language processing
62. What is the purpose of a neural network in artificial intelligence? a) To simulate
human intelligence b) To process and analyze large datasets c) To control robotic
systems d) To perform automated reasoning
63. Which technique is used to teach a computer to play chess by learning from past
games? a) Genetic algorithms b) Reinforcement learning c) Expert systems d) Deep
learning
64. What is the Turing test in artificial intelligence? a) A test to measure the
computational complexity of algorithms b) A test to evaluate the performance of neural
networks c) A test to determine if a computer can exhibit human-like intelligence d) A
test to verify the correctness of software programs
65. Which algorithm is used to classify data into predefined categories? a) Decision
tree b) K-nearest neighbors c) Support vector machine d) Apriori algorithm

System Programming (05%)

66. What is the purpose of an assembler in system programming? a) To translate

assembly language code into machine code b) To manage system resources c) To
provide input/output capabilities d) To debug software applications
67. Which of the following is not a valid system call in operating systems? a) fork() b)
exec() c) read() d) print()
68. What is the purpose of a linker in system programming? a) To translate source
code into machine code b) To combine object files into a single executable file c) To
manage memory allocation d) To optimize code performance
69. Which system programming language is known for its low-level access to
hardware resources? a) Python b) Java c) C d) Ruby
70. What is the purpose of a library in system programming? a) To provide reusable
code modules b) To manage system processes c) To control input/output devices d) To
execute system commands

Numerical Computing (05%)

71. Which of the following is not a valid numerical computing library in Python? a)
NumPy b) SciPy c) Pandas d) Matplotlib
72. What is the purpose of linear interpolation in numerical computing? a) To
approximate values between known data points b) To solve systems of linear equations
c) To calculate the derivative of a function d) To perform matrix multiplication
73. Which numerical method is used to find the roots of a nonlinear equation? a)
Newton-Raphson method b) Euler's method c) Gaussian elimination d) Simpson's rule
74. What is the purpose of numerical integration in numerical computing? a) To
approximate the area under a curve b) To solve differential equations c) To optimize
functions d) To interpolate data points
75. Which numerical technique is used to approximate the solution to a differential
equation? a) Finite difference method b) Gradient descent c) Singular value
decomposition d) LU decomposition

Answers:

1. d) string
2. a) 5
3. c) for
4. b) It returns nothing
5. b) &
6. b) Ability to define a new class from an existing class
7. b) Polymorphism
8. a) It refers to the current class object
9. b) A method used to initialize objects
10. b) final
11. d) ADD
12. a) All humans are immortal
13. b) All elements that are in both A and B
14. a) 0
15. c) At least one (∃1)
16. c) Tree
17. a) O(1)
18. c) Merge Sort
19. b) To solve problems by breaking them down into smaller subproblems
20. c) Dijkstra's Algorithm
21. a) AND gate
22. a) 1010
23. c) RAM
24. b) To execute instructions
25. b) Cache memory
26. a) To manage hardware resources
27. b) Shortest Job Next (SJN)
28. c) To extend the available RAM
29. a) Mutual exclusion
30. b) A program that controls hardware devices
31. c) Relational
32. a) To uniquely identify each row in the table
33. d) SELECT
34. c) To eliminate duplicate data
35. a) Inner join
36. b) To track and manage changes to source code
37. c) Agile model
38. b) To test individual components or units of code
39. d) Task decomposition
40. b) To define the functional and non-functional requirements of the software
41. c) Network layer
42. b) To guarantee the delivery of packets
43. a) Bus
44. a) To translate domain names to IP addresses
45. c) SMTP
46. b) To fetch the next instruction to be executed
47. a) MOV
48. b) To perform arithmetic and logic operations
49. b) Direct
50. b) To store the address of the top of the stack
51. d) Variables
52. b) To describe patterns of strings
53. b) Pushdown automaton
54. c) DFA has deterministic transitions, while NFA has nondeterministic transitions
55. c) Concatenation
56. c) O(n)
57. d) PSPACE
58. d) O(n^2)
59. d) Breadth-First Search (BFS)
60. c) To represent the worst-case time complexity of an algorithm
61. c) Cryptography
62. b) To process and analyze large datasets
63. b) Reinforcement learning
64. c) A test to determine if a computer can exhibit human-like intelligence
65. c) Support vector machine
66. a) To translate assembly language code into machine code
67. d) print()
68. b) To combine object files into a single executable file
69. c) C
70. a) To provide reusable code modules
71. c) Pandas
72. a) To approximate values between known data points
73. a) Newton-Raphson method
74. a) To approximate the area under a curve
75. a) Finite difference method