Part 1 History of Computer
1. Who is known as the "father of computers"?
A) Alan Turing
B) Charles Babbage
C) John von Neumann
D) Blaise Pascal
E) Bill Gates
Answer: B) Charles Babbage
2. What was the first mechanical computer designed by Charles Babbage called?
A) ENIAC
B) Analytical Engine
C) Difference Engine
D) Z3
E) UNIVAC
Answer: C) Difference Engine
3. In which year was the first version of Microsoft Windows released?
A) 1983
B) 1985
C) 1987
D) 1990
E) 1995
Answer: B) 1985
4. Who is credited with creating the first algorithm intended for a computer?
A) Ada Lovelace
B) John Napier
C) Grace Hopper
D) Steve Jobs
E) Alan Turing
Answer: A) Ada Lovelace
5. The first electronic general-purpose computer was called:
A) Colossus
B) ENIAC
C) IBM 701
D) Z1
E) Mark I
Answer: B) ENIAC
6. What does ENIAC stand for?
A) Electronic Numerical Integrator and Computer
B) Electronic National Information and Calculator
C) Electrical Numerical Intelligent Computing
D) Electrical Navigation Integration and Control
E) Electronic Number Interchangeable Computer
Answer: A) Electronic Numerical Integrator and Computer
7. Who co-founded Microsoft with Bill Gates?
A) Steve Jobs
B) Paul Allen
C) Steve Wozniak
D) Larry Page
E) Tim Berners-Lee
Answer: B) Paul Allen
8. The first commercially available microprocessor was:
A) Intel 4004
B) Intel 8080
C) Zilog Z80
D) Motorola 68000
E) IBM 5100
Answer: A) Intel 4004
9. What was the first successful personal computer?
A) IBM PC
B) Apple I
C) Commodore 64
D) Altair 8800
E) ZX Spectrum
Answer: D) Altair 8800
10. The Apple Macintosh was introduced in what year?
A) 1976
B) 1980
C) 1984
D) 1988
E) 1991
Answer: C) 1984
11. Who is known for developing the World Wide Web?
A) Vint Cerf
B) Tim Berners-Lee
C) Marc Andreessen
D) Larry Page
E) Sergey Brin
Answer: B) Tim Berners-Lee
12. Which company created the first graphical user interface (GUI) used in personal computers?
A) Microsoft
B) Apple
C) Xerox
D) IBM
E) Google
Answer: C) Xerox
13. The computer programming language COBOL was primarily developed by:
A) Alan Turing
B) Ada Lovelace
C) Grace Hopper
D) Steve Wozniak
E) Larry Page
Answer: C) Grace Hopper
14. The first portable computer was introduced by:
A) IBM
B) Apple
C) Compaq
D) Osborne
E) HP
Answer: D) Osborne
15. What does "HTTP" stand for?
A) Hyperlink Text Transfer Protocol
B) Hypertext Transfer Protocol
C) Hyper Tool Transfer Protocol
D) Hyperlink Tool Transport Protocol
E) Hyper Transfer Transmission Protocol
Answer: B) Hypertext Transfer Protocol
16. What was the first computer virus called?
A) Creeper
B) ILOVEYOU
C) MyDoom
D) Michelangelo
E) Stuxnet
Answer: A) Creeper
17. Which computer was the first to use an operating system similar to today’s?
A) Apple I
B) IBM System/360
C) Altair 8800
D) Z1
E) ENIAC
Answer: B) IBM System/360
18. What was the first mass-produced personal computer?
A) IBM PC
B) Apple II
C) Commodore PET
D) ZX Spectrum
E) Altair 8800
Answer: B) Apple II
19. Which company developed the first hard disk drive?
A) IBM
B) Seagate
C) Western Digital
D) Hitachi
E) Toshiba
Answer: A) IBM
20. What does CPU stand for?
A) Central Process Unit
B) Central Processing Unit
C) Central Processor Universal
D) Central Programming Unit
E) Centralized Processing Unit
Answer: B) Central Processing Unit
A) MS-DOS
B) UNIX
C) Windows 3.1
D) CP/M
E) Mac OS
Answer: B) UNIX
A) Lotus 1-2-3
B) Excel
C) VisiCalc
D) Quattro Pro
E) SuperCalc
Answer: C) VisiCalc
A) 1971
B) 1975
C) 1980
D) 1985
E) 1990
Answer: A) 1971
A) IBM
B) Apple
C) Compaq
D) Microsoft
E) Dell
Answer: A) IBM
A) Internet Explorer
B) Netscape Navigator
C) Mosaic
D) Firefox
E) Opera
Answer: C) Mosaic
A) IBM
B) Microsoft
C) Xerox
D) Apple
E) HP
Answer: C) Xerox
A) 2004
B) 2006
C) 2007
D) 2009
E) 2011
Answer: C) 2007
A) Jack Kilby
B) Robert Noyce
C) Gordon Moore
D) Charles Babbage
E) Alan Turing
Answer: A) Jack Kilby
A) Python
B) Java
C) LISP
D) COBOL
E) FORTRAN
Answer: C) LISP
A) 1979
B) 1981
C) 1984
D) 1987
E) 1990
Answer: B) 1981
A) American Standard Code for International Information
B) American Systematic Code for Interchange Information
C) American Standard Code for Information Interchange
D) Automated System for Code Interchange Information
E) Applied Standard Code for International Information
Answer: C) American Standard Code for Information Interchange
A) Software development
B) Artificial Intelligence
C) Networking
D) Cryptography
E) Hardware design
Answer: B) Artificial Intelligence
A) Colossus
B) Z3
C) ENIAC
D) UNIVAC
E) IBM 701
Answer: A) Colossus
A) Netscape
B) Mosaic
C) Internet Explorer
D) Firefox
E) Opera
Answer: B) Mosaic
A) Tim Berners-Lee
B) Robert Metcalfe
C) Bill Gates
D) Vint Cerf
E) Marc Andreessen
Answer: B) Robert Metcalfe
A) FORTRAN
B) COBOL
C) BASIC
D) ALGOL
E) Python
Answer: A) FORTRAN
A) 1965
B) 1969
C) 1971
D) 1976
E) 1980
Answer: C) 1971
A) IBM
B) Microsoft
C) Sun Microsystems
D) Oracle
E) Apple
Answer: C) Sun Microsystems
A) Robert Noyce
B) Bill Gates
C) Steve Jobs
D) Jeff Bezos
E) Sergey Brin
Answer: A) Robert Noyce
A) FORTRAN
B) COBOL
C) BASIC
D) Assembly
E) Pascal
Answer: B) COBOL
A) Alan Turing
B) Christopher Sholes
C) Charles Babbage
D) John von Neumann
E) Bill Gates
Answer: B) Christopher Sholes
A) 1968
B) 1971
C) 1975
D) 1980
E) 1985
Answer: B) 1971
A) Ada Lovelace
B) Tim Berners-Lee
C) Grace Hopper
D) Dennis Ritchie
E) Ken Thompson
Answer: C) Grace Hopper
A) General User Interface
B) Graphical User Interface
C) General Utility Interface
D) Graphical Utility Interface
E) Generalized User Interaction
Answer: B) Graphical User Interface
A) Canon
B) Xerox
C) HP
D) IBM
E) Brother
Answer: B) Xerox
A) Steve Jobs
B) Linus Torvalds
C) Bill Gates
D) Richard Stallman
E) Mark Zuckerberg
Answer: B) Linus Torvalds
A) Basic Integrated Operating System
B) Binary Input Operating System
C) Basic Input Output System
D) Basic Information Organization System
E) Binary Information Output System
Answer: C) Basic Input Output System
A) UNIVAC I
B) IBM 701
C) ENIAC
D) Z3
E) Colossus
Answer: A) UNIVAC I
A) Bjarne Stroustrup
B) Dennis Ritchie
C) James Gosling
D) Ken Thompson
E) Brian Kernighan
Answer: B) Dennis Ritchie
A) 1979
B) 1981
C) 1984
D) 1987
E) 1990
Answer: C) 1984
A) Colossus
B) Deep Thought
C) Deep Blue
D) Watson
E) AlphaGo
Answer: C) Deep Blue
A) IBM
B) Toshiba
C) HP
D) Osborne
E) Apple
Answer: D) Osborne
A) Digital Network System
B) Domain Name System
C) Dynamic Name Service
D) Data Network Service
E) Distributed Network Structure
Answer: B) Domain Name System
A) Bill Gates
B) Paul Allen
C) Larry Page
D) Sergey Brin
E) Steve Wozniak
Answer: E) Steve Wozniak
A) Windows
B) Unix
C) Apple II
D) IBM PC
E) Macintosh
Answer: C) Apple II
A) Who Wants to Be a Millionaire
B) Wheel of Fortune
C) Jeopardy!
D) Family Feud
E) The Price is Right
Answer: C) Jeopardy!
A) IBM 650
B) UNIVAC II
C) IBM 1401
D) TX-0
E) PDP-1
Answer: D) TX-0
A) IBM
B) Microsoft
C) Computer Associates
D) Apple
E) SAP
Answer: B) Microsoft
A) Guido van Rossum
B) Larry Wall
C) James Gosling
D) Dennis Ritchie
E) Bjarne Stroustrup
Answer: A) Guido van Rossum
A) Internet Service Provider
B) Integrated System Protocol
C) International System Provider
D) Internet System Provider
E) Internal Software Provider
Answer: A) Internet Service Provider
A) Steve Jobs
B) Alan Shugart
C) Bill Gates
D) Grace Hopper
E) Jack Kilby
Answer: B) Alan Shugart
A) google.com
B) yahoo.com
C) symbolics.com
D) microsoft.com
E) ibm.com
Answer: C) symbolics.com
A) ARPANET
B) NSFNet
C) Ethernet
D) World Wide Web
E) Internet
Answer: A) ARPANET
A) Random Access Memory
B) Readable Automatic Memory
C) Real Access Machine
D) Read Access Module
E) Runtime Application Memory
Answer: A) Random Access Memory
A) Bill Gates
B) Steve Jobs
C) Sergey Brin and Larry Page
D) Jeff Bezos
E) Mark Zuckerberg
Answer: C) Sergey Brin and Larry Page
A) AltaVista
B) Yahoo
C) Archie
D) Google
E) Lycos
Answer: C) Archie
A) Uniform Resource Locator
B) Universal Resource Locator
C) Uniform Retrieval Location
D) Universal Retrieval Locator
E) Uniform Resource Link
Answer: A) Uniform Resource Locator
A) Bill Gates
B) Tim Berners-Lee
C) Marc Andreessen
D) Vint Cerf
E) Larry Page
Answer: C) Marc Andreessen
A) Ken Thompson and Dennis Ritchie
B) Bill Gates and Paul Allen
C) Steve Jobs and Steve Wozniak
D) Linus Torvalds
E) Alan Turing
Answer: A) Ken Thompson and Dennis Ritchie
A) James Gosling
B) Guido van Rossum
C) Bjarne Stroustrup
D) Dennis Ritchie
E) Larry Page
Answer: A) James Gosling
A) 2007
B) 2009
C) 2010
D) 2012
E) 2014
Answer: C) 2010
A) Hyper Text Markup Language
B) High Transfer Markup Language
C) Hyper Tool Markup Language
D) High Text Markup Language
E) Hyperlink Transfer Markup Language
Answer: A) Hyper Text Markup Language
A) Alan Shugart
B) Jack Kilby
C) Charles Babbage
D) Alan Turing
E) Robert Noyce
Answer: A) Alan Shugart
A) Alan Turing
B) John von Neumann
C) Konrad Zuse
D) Charles Babbage
E) Blaise Pascal
Answer: D) Charles Babbage
A) Bill Gates
B) John Kemeny and Thomas Kurtz
C) Dennis Ritchie
D) Bjarne Stroustrup
E) Guido van Rossum
Answer: B) John Kemeny and Thomas Kurtz
A) IBM
B) Xerox
C) DEC
D) HP
E) Apple
Answer: C) DEC
A) IBM
B) DEC
C) Apple
D) Siemens
E) Zuse KG
Answer: E) Zuse KG
A) 1965
B) 1975
C) 1983
D) 1990
E) 1995
Answer: C) 1983
A) 1989
B) 1991
C) 1993
D) 1995
E) 1997
Answer: A) 1989
A) Internet Explorer
B) Safari
C) WorldWideWeb
D) Netscape
E) Mosaic
Answer: C) WorldWideWeb
A) Transmission Control Protocol/Internet Protocol
B) Transfer Communication Protocol/Information Protocol
C) Telecommunications Control Protocol/Internet Provider
D) Transfer Control Process/Information Process
E) Transfer Communication Process/Internet Protocol
Answer: A) Transmission Control Protocol/Internet Protocol
A) Alan Turing
B) Charles Babbage
C) Grace Hopper
D) Steve Jobs
E) Bill Gates
Answer: C) Grace Hopper
A) AMD
B) Intel
C) IBM
D) Apple
E) Microsoft
Answer: B) Intel
A) Steve Jobs
B) Bill Gates
C) Mark Zuckerberg
D) Jeff Bezos
E) Larry Page
Answer: C) Mark Zuckerberg
A) Pac-Man
B) Spacewar!
C) Pong
D) Tetris
E) Breakout
Answer: C) Pong
A) Portable Data File
B) Portable Document Format
C) Print Data File
D) Processed Document File
E) Protected Data Format
Answer: B) Portable Document Format
A) Yukihiro Matsumoto
B) Guido van Rossum
C) James Gosling
D) Bjarne Stroustrup
E) Larry Wall
Answer: A) Yukihiro Matsumoto
A) Mark Zuckerberg
B) Larry Page
C) Bill Gates
D) Jeff Bezos
E) Steve Jobs
Answer: D) Jeff Bezos
A) 1950
B) 1957
C) 1961
D) 1964
E) 1969
Answer: C) 1961
A) Larry Page
B) Elon Musk
C) Bill Gates
D) Sergey Brin
E) Jeff Bezos
Answer: B) Elon Musk
A) MySpace
B) Facebook
C) Six Degrees
D) Friendster
E) Twitter
Answer: C) Six Degrees
A) Wireless Access Network
B) Wide Area Network
C) Wide Access Node
D) Wireless Area Node
E) Wired Access Network
Answer: B) Wide Area Network
A) Melissa
B) Creeper
C) Brain
D) Elk Cloner
E) ILOVEYOU
Answer: D) Elk Cloner
A) Jack Dorsey
B) Brian Acton and Jan Koum
C) Mark Zuckerberg
D) Larry Page
E) Sergey Brin
Answer: B) Brian Acton and Jan Koum
A) 1981
B) 1983
C) 1985
D) 1987
E) 1990
Answer: B) 1983
A) Pong
B) Tetris
C) Tennis for Two
D) Space Invaders
E) Pac-Man
Answer: C) Tennis for Two
A) MySpace
B) Twitter
C) Instagram
D) Facebook
E) WhatsApp
Answer: D) Facebook
A) Virtual Private Network
B) Virtual Personal Network
C) Virtual Protected Network
D) Verified Personal Network
E) Verified Private Network
Answer: A) Virtual Private Network
A) 2005
B) 2006
C) 2008
D) 2010
E) 2012
Answer: C) 2008
A) 1989
B) 1991
C) 1993
D) 1995
E) 1997
Answer: A) 1989
Part 2 Topology
1. What is a network topology?
A) The layout of physical hardware in a network
B) A method of routing data between nodes
C) A set of communication protocols
D) A system for securing network traffic
E) A type of computer storage system
Answer: A) The layout of physical hardware in a network
2. Which of the following is not a common type of network topology?
A) Star
B) Mesh
C) Ring
D) Tree
E) Cycle
Answer: E) Cycle
3. Which network topology is characterized by every node being connected to every other node?
A) Star
B) Mesh
C) Ring
D) Bus
E) Tree
Answer: B) Mesh
4. In a star topology, which device typically connects all other devices?
A) Router
B) Switch
C) Hub
D) Server
E) Bridge
Answer: B) Switch
5. Which of the following topologies is the most fault-tolerant?
A) Bus
B) Star
C) Ring
D) Mesh
E) Tree
Answer: D) Mesh
6. What is the key disadvantage of using a bus topology in a network?
A) High cost
B) Difficult to scale
C) Single point of failure
D) Difficult to install
E) Slow data transmission
Answer: C) Single point of failure
7. Which topology is most commonly used in small offices or home networks?
A) Bus
B) Mesh
C) Star
D) Ring
E) Hybrid
Answer: C) Star
8. In which topology does each node connect to exactly two other nodes, forming a continuous loop?
A) Star
B) Mesh
C) Ring
D) Bus
E) Tree
Answer: C) Ring
9. Which of the following network topologies is the easiest to expand?
A) Bus
B) Star
C) Ring
D) Tree
E) Mesh
Answer: B) Star
10. What is the main feature of a hybrid topology?
A) It uses a mix of multiple network topologies
B) It is a combination of physical and logical topologies
C) It forms a loop among connected devices
D) It eliminates the need for central devices
E) It uses only wireless connections
Answer: A) It uses a mix of multiple network topologies
11. Which of the following best describes the concept of "topological sorting"?
A) Sorting elements based on value
B) Sorting vertices of a graph in a way that for every directed edge (u,v)(u, v)(u,v), vertex uuu appears before vvv
C) Sorting elements based on color
D) Sorting a network by bandwidth
E) Sorting the graph nodes by distance
Answer: B) Sorting vertices of a graph in a way that for every directed edge (u,v)(u, v)(u,v), vertex uuu appears before vvv
12. In computational topology, what is "persistent homology" used for?
A) To find the shortest path in a graph
B) To detect cycles in a network
C) To study the topological features of data at different scales
D) To identify nodes in a graph
E) To simplify the complexity of a graph
Answer: C) To study the topological features of data at different scales
13. Which of the following describes a "connected" graph?
A) A graph where all nodes are connected to one another
B) A graph where no cycles exist
C) A graph where each node has at least one neighbor
D) A graph with a central hub node
E) A graph with more edges than nodes
Answer: A) A graph where all nodes are connected to one another
14. Which of the following algorithms is used to find the minimum spanning tree in a graph?
A) Dijkstra’s Algorithm
B) Bellman-Ford Algorithm
C) Prim’s Algorithm
D) Floyd-Warshall Algorithm
E) Kruskal’s Algorithm
Answer: C) Prim’s Algorithm
15. Which of the following topologies is most commonly used in the design of computer networks in large buildings?
A) Star
B) Bus
C) Mesh
D) Ring
E) Tree
Answer: E) Tree
16. In which network topology does data travel in a single direction, and each node is connected to exactly two others?
A) Mesh
B) Star
C) Bus
D) Ring
E) Tree
Answer: D) Ring
17. What is the key characteristic of a "distributed" network topology?
A) A central device controls communication
B) Every device communicates directly with every other device
C) Devices communicate over a common backbone
D) Communication is spread across multiple devices, with no central control
E) Devices are arranged in a strict hierarchical structure
Answer: D) Communication is spread across multiple devices, with no central control
18. Which of the following is true about a "bipartite graph"?
A) All vertices are of the same degree
B) It can be divided into two disjoint sets such that no two vertices within the same set are adjacent
C) It contains no cycles
D) It is always connected
E) It is always directed
Answer: B) It can be divided into two disjoint sets such that no two vertices within the same set are adjacent
19. What is the "Eulerian path" in a graph?
A) A path that visits each edge exactly once
B) A path that visits each vertex exactly once
C) A path that forms a closed loop
D) A path that traverses all vertices in the shortest time
E) A path that uses the minimum number of edges
Answer: A) A path that visits each edge exactly once
20. Which concept in computational topology helps identify "holes" in data or a shape?
A) Euler characteristic
B) Betti numbers
C) Graph diameter
D) Shortest path
E) Centrality
Answer: B) Betti numbers
A) The number of edges in the graph
B) The number of vertices in the graph
C) The longest shortest path between any two vertices in the graph
D) The average distance between all pairs of vertices
E) The sum of all the degrees of the vertices
Answer: C) The longest shortest path between any two vertices in the graph
A) A cycle in the graph
B) A set of vertices that are connected to exactly one other vertex
C) A subset of vertices that are all adjacent to each other
D) A disconnected subgraph
E) A graph with no cycles
Answer: C) A subset of vertices that are all adjacent to each other
A) High fault tolerance
B) Simplicity in installation and setup
C) Scalability
D) Low cost
E) All of the above
Answer: E) All of the above
A) In small networks
B) In networks where fault tolerance is critical
C) In large hierarchical networks
D) In networks that require high-speed data transmission
E) In ad-hoc networks
Answer: C) In large hierarchical networks
A) It uses geometric representations of data
B) It analyzes data based on their algebraic properties
C) It detects underlying structures in high-dimensional data
D) It reduces data complexity by removing redundant information
E) It focuses on clustering data
Answer: C) It detects underlying structures in high-dimensional data
A) Cycles
B) Vertices with multiple edges
C) Direction associated with each edge
D) A central node
E) More nodes than edges
Answer: C) Direction associated with each edge
A) Removing vertices with no incoming edges
B) Reversing the direction of all edges
C) Creating a linear ordering of vertices
D) Processing vertices in order of their dependencies
E) Adding vertices with no predecessors to the result
Answer: B) Reversing the direction of all edges
A) Dijkstra’s Algorithm
B) Bellman-Ford Algorithm
C) Depth-First Search (DFS)
D) Floyd-Warshall Algorithm
E) Kruskal’s Algorithm
Answer: C) Depth-First Search (DFS)
A) A centralized structure with a backbone connecting all devices
B) A topology with a single central node connected to all other nodes
C) A topology where nodes are connected in a ring-like structure
D) A topology where each node is directly connected to every other node
E) A topology with a shared communication channel and terminators at both ends
Answer: E) A topology with a shared communication channel and terminators at both ends
A) It can be drawn on a plane without edges crossing
B) It contains no cycles
C) It has only two nodes
D) All of its edges are directed
E) It is fully connected
Answer: A) It can be drawn on a plane without edges crossing
A) To find the shortest path in a weighted graph
B) To find the minimum spanning tree in a graph
C) To find the connected components of a graph
D) To perform topological sorting
E) To detect cycles in a graph
Answer: B) To find the minimum spanning tree in a graph
A) A type of graph
B) A set of points connected by edges
C) A network structure used for topological analysis
D) A collection of simplices (e.g., points, edges, triangles) used to model topological spaces
E) A representation of nodes connected by weighted edges
Answer: D) A collection of simplices (e.g., points, edges, triangles) used to model topological spaces
A) A continuous deformation between two functions or spaces
B) A measure of distance between points in space
C) The number of holes in a space
D) The relationship between vertices and edges in a graph
E) The method for connecting nodes in a graph
Answer: A) A continuous deformation between two functions or spaces
A) Star
B) Mesh
C) Ring
D) Bus
E) Tree
Answer: D) Bus
A) Requires fewer cables than other topologies
B) It’s highly fault-tolerant and offers multiple paths between nodes
C) It’s easy to install and configure
D) It is more cost-effective than star topology
E) It is highly scalable
Answer: B) It’s highly fault-tolerant and offers multiple paths between nodes
A) Every vertex is connected to every other vertex
B) The graph contains no edges
C) All edges are directed
D) There is exactly one edge between each pair of vertices
E) The graph is always cyclic
Answer: A) Every vertex is connected to every other vertex
A) Cluster analysis
B) Homotopy
C) Topological Data Analysis (TDA)
D) Dijkstra’s algorithm
E) Kruskal’s algorithm
Answer: C) Topological Data Analysis (TDA)
A) Finding the shortest path between any two nodes in a graph
B) Finding the minimum spanning tree in a graph
C) Sorting the nodes in topological order
D) Finding the connected components in a graph
E) Detecting cycles in a graph
Answer: A) Finding the shortest path between any two nodes in a graph
A) A tree structure
B) A cycle in a graph
C) A mesh network
D) A complete graph
E) A circular linked list
Answer: A) A tree structure
A) Finding the shortest path between two nodes
B) Visiting all nodes in a graph systematically
C) Identifying the minimum spanning tree
D) Calculating the diameter of the graph
E) Searching for cycles in the graph
Answer: B) Visiting all nodes in a graph systematically