Question 1:

Answer: (C) Alphabet

Explanation:
The code defines macros for logical operators (&& for AND, !! for OR, <= for LE, >= for GE) and then checks if the character
ch is an alphabet (either uppercase or lowercase). Since 'D' is an uppercase letter, the condition (ch GE 65 AND ch LE 90)
is true, and therefore, the code prints "alphabet".
Related Facts and Points:
• Macros are used to define preprocessor directives, which are processed before the actual compilation of the code.
• The ASCII values for uppercase letters range from 65 to 90, and for lowercase letters from 97 to 122.
• The if statement checks the condition using the defined macros and prints the appropriate message.
Question 2:
Answer: (B) core
Explanation:
The code creates a static character array s with four strings, and then creates a static character pointer array ptr pointing
to the elements of s in reverse order. Then, p is a pointer to ptr.
The first printf statement increments p and then dereferences it twice to print the first string in ptr, which is "core".
The second printf statement increments p again, decrements the value it points to, and then adds 3 to the resulting pointer
to print the substring "plea" from the string "please".
The third printf statement subtracts 2 from p, dereferences it, and adds 3 to the resulting pointer to print the substring
"gr" from the string "green".
The fourth printf statement subtracts 1 from p, dereferences it twice, and adds 1 to the resulting pointer to print the
substring "ase" from the string "please".
Related Facts and Points:
• Pointer arithmetic is used to manipulate the addresses of variables.
• The ++ and -- operators are used to increment and decrement pointers, respectively.
• The * operator is used to dereference pointers to access the values they point to.
• Array indexing can be used to access elements of an array.
Question 3
Answer: (C) 38
Explanation:
The code involves a recursive function func1 which increments its argument by 1 and returns the incremented value. The
main function calls func1 three times nestedly.
• The innermost func1 increments k to 36.
• The middle func1 increments the returned 36 to 37.
• The outermost func1 increments the returned 37 to 38. Finally, the value 38 is assigned to k and printed.
Related Facts and Points:
• Recursive functions call themselves directly or indirectly.
• Function calls create a stack frame for local variables and parameters.
• The return value of a function is used as an expression in the calling function.
Question 4
Answer: (C) No output
Explanation:
The while loop condition j<=255 is always true as j is initialized to 1 and never incremented within the loop. This results in
an infinite loop. Consequently, the printf statement is never executed.
Related Facts and Points:
• A while loop continues execution as long as the condition is true.
• It's essential to ensure that the loop condition will eventually become false to avoid infinite loops.
Question 5
Answer: (C) b=100, c=200
Explanation:
The condition !a>=400 is evaluated as follows:
• a>=400 is true because a is 500.
• ! negates the true condition, resulting in false. Therefore, the if block is not executed, and the values of b and c
remain unchanged.
Related Facts and Points:
• The ! operator is the logical NOT operator.
• The if statement executes its block only if the condition is true.
Question 6
Answer: (A) interface
Explanation:
Java supports multiple inheritance through interfaces. A class can implement multiple interfaces, inheriting their methods.
Related Facts and Points:
• Interfaces define a contract of methods that a class must implement.
• Multiple inheritance of classes is not directly supported in Java to avoid the diamond problem.
Question 7
Answer: (C) java.lang.Object
Explanation:
java.lang.Object is the root of the class hierarchy in Java. Every class implicitly extends this class.
Related Facts and Points:
• java.lang is the default package in Java.
• Object class provides fundamental methods like equals, hashCode, toString, etc.
Question 8
Answer: (C) lo
Explanation:
The code creates a StringBuffer object sb initialized with "Hello". Then, it deletes the characters at indices 0 and 1 (which
are 'H' and 'e'). The remaining string "lo" is printed.
Related Facts and Points:
• StringBuffer is a mutable sequence of characters.
• The delete method removes characters from a specified range.
Question 9
Answer: (A) Runnable interface
Explanation:
The Runnable interface is the primary mechanism for creating threads in Java. A class that implements Runnable can
override the run method to define the thread's behavior.
Related Facts and Points:
• Threads are independent paths of execution within a program.
• The Thread class provides additional methods for thread management.
Question 10
Answer: (A) java.lang
Explanation:
The abstract keyword is a fundamental language construct and is available in the java.lang package, which is the default
package for all Java classes.
Related Facts and Points:
• abstract classes cannot be instantiated.
• abstract methods must be implemented by subclasses.
Question 11
Answer: (B) Constructor
Explanation:
A constructor is a special member function that initializes the data members of an object when it is created.
Related Facts and Points:
• Constructors have the same name as the class.
• Constructors do not have a return type.
Question 12
Answer: (B) this
Explanation:
The this keyword refers to the current object within a member function. It can be used to access the object's data members
and member functions.
Related Facts and Points:
 • this can be used to resolve ambiguity when there are local variables with the same name as class members.
• this can be used to return a reference to the current object.
Question 13
Answer: (A) Tree
Explanation:
A tree is a non-linear data structure where each node can have multiple children. Arrays, linked lists, and stacks are linear
data structures.
Related Facts and Points:
• Trees are used to represent hierarchical relationships.
• Common tree types include binary trees, binary search trees, and heaps.
Question 14
Answer: (D) None of the above
Explanation:
All of the listed methods (aggregate, accounting, and potential) are valid techniques for performing amortized analysis of
algorithms.
Related Facts and Points:
• Amortized analysis analyzes the average cost of a sequence of operations, not the cost of individual operations.
Question 15
Answer: (B) Dynamic programming method
Explanation:
The 0-1 knapsack problem is a classic optimization problem that can be efficiently solved using dynamic programming.
Related Facts and Points:
• Dynamic programming breaks down a problem into subproblems and stores the results of subproblems to avoid
redundant calculations.
Question 16
Answer: (D) None of the above
Explanation:
Chaining, linear probing, and quadratic probing are all common collision resolution techniques in hashing.
Related Facts and Points:
• Hashing maps keys to indices in an array.
• Collisions occur when multiple keys hash to the same index.
Question 17
Answer: (A) P = NP
Explanation:
If any NP-complete problem can be solved in polynomial time (i.e., is in P), then it implies that all NP problems can be
solved in polynomial time. This is because NP-complete problems are the hardest problems in NP, and if one can be solved
efficiently, all others can be reduced to it and solved efficiently as well. Therefore, P would be equal to NP.
Related Facts and Points:
• P is the class of problems that can be solved in polynomial time.
• NP is the class of problems for which a solution can be verified in polynomial time.
• The P vs NP problem is one of the most important unsolved problems in computer science.
Question 18
Answer: (D) None of the above
Explanation:
Hamiltonian cycle, Clique, and Traveling salesman problems are all well-known NP-complete problems.
Related Facts and Points:
• NP-complete problems are a subset of NP problems.
• NP-complete problems are considered to be computationally intractable.
Question 19
Answer: (B) O(E + V log V)
Explanation:
Kruskal's algorithm for finding the Minimum Spanning Tree (MST) has two main steps: sorting the edges and using a
disjoint-set data structure to maintain connected components. Sorting takes O(E log V) time, and the disjoint-set
operations take O(E α(V)) time, where α is the inverse Ackermann function, which is very slowly growing. Therefore, the
overall time complexity is dominated by the sorting step, which is O(E log V).
Related Facts and Points:
• Kruskal's algorithm is a greedy algorithm.
• Minimum Spanning Tree is a subset of edges that connects all vertices without cycles and has the minimum total
weight.
Question 20
Answer: (B) Queue
Explanation:
Breadth-First Search (BFS) uses a queue to explore vertices level by level. Vertices at the current level are explored first,
and then their neighbors are added to the queue for exploration in the next level.
Related Facts and Points:
• BFS is used to find the shortest path between two vertices in an unweighted graph.
• Other graph traversal algorithms include Depth-First Search (DFS), which uses a stack.
Question 21
Answer: (D) O(n^2.81) time
Explanation:
Strassen's algorithm is a divide-and-conquer algorithm for matrix multiplication that achieves a better than naive O(n^3)
time complexity. The exact time complexity is O(n^2.81).
Related Facts and Points:
• Strassen's algorithm is more complex than the naive algorithm but offers performance benefits for large matrices.
Question 22
Answer: (C) ab+cdef+g*+
Explanation:
Postfix notation (also known as reverse Polish notation) represents operators after their operands. The given expression
in postfix notation is ab+cdef+g*+.
Related Facts and Points:
• Postfix notation is often used in stack-based calculators.
• Converting infix expressions to postfix notation involves using a stack.
Question 23
Answer: (B) O(n log n)
Explanation:
Merge sort has a consistent time complexity of O(n log n) in all cases, including the worst case.
Related Facts and Points:
• Merge sort is a divide-and-conquer algorithm.
• Merge sort is a stable sorting algorithm.
Question 24
Answer: (B) Forest
Explanation:
A forest is a set of disjoint trees.
Related Facts and Points:
• A tree is a connected acyclic graph.
Question 25
Answer: (C) Both (A) and (B)
Explanation:
Both arrays and linked lists are linear data structures.
Related Facts and Points:
• Arrays provide direct access to elements using indices.
• Linked lists provide sequential access to elements through pointers.
Question 26
Answer: (A) O(n^2)
Explanation:
In the worst case, Quick sort can have a time complexity of O(n^2) when the pivot is consistently chosen poorly.
Related Facts and Points:
 • Quick sort is a divide-and-conquer algorithm.
• Quick sort is generally efficient but susceptible to worst-case behavior.
Question 27
Answer: (B) Heap
Explanation:
A heap is a data structure that satisfies the heap property: the parent node is always greater than or equal to (in a max
heap) or less than or equal to (in a min heap) its children. This property makes it efficient for implementing priority queues,
where elements are accessed based on their priority.
Related Facts and Points:
• Heaps can be implemented as arrays or binary trees.
• Priority queues are used in algorithms like Dijkstra's shortest path and Huffman coding.
Question 28
Answer: (B) Heterogeneous list
Explanation:
A heterogeneous list is a list where elements can be of different data types.
Related Facts and Points:
• Homogeneous lists contain elements of the same data type.
Question 29
Answer: (C) Stack
Explanation:
A stack is a LIFO (Last In, First Out) data structure where elements are inserted and removed from the same end, called
the top.
Related Facts and Points:
• Stacks are used in function calls, expression evaluation, and backtracking algorithms.
Question 30
Answer: (A) sparse matrix
Explanation:
A sparse matrix is a matrix where most of the elements are zero.
Related Facts and Points:
• Sparse matrices can be efficiently stored using specialized data structures to save memory.
Question 31
Answer: (B) AVL Tree
Explanation:
An AVL tree is a self-balancing binary search tree where the height difference between the left and right subtrees of any
node is at most one.
Related Facts and Points:
• AVL trees maintain balance through rotations.
• Other self-balancing trees include Red-Black trees and B-trees.
Question 32
Answer: (B) 2 Mbps
Explanation:
Throughput is the actual data rate achieved over a network. Given 12000 frames/minute * 10000 bits/frame = 120000000
bits/minute, which is approximately 2 Mbps.
Related Facts and Points:
• Bandwidth is the maximum data rate a network can support.
• Throughput is often lower than bandwidth due to overhead and errors.
Question 33
Answer: (D) 1000 Kbaud
Explanation:
NRZ-1 uses two signal levels to represent 0 and 1. Therefore, the bit rate and baud rate are equal. 10 Mbps = 10000000
bps = 1000 Kbaud.
Related Facts and Points:
• Baud rate is the number of signal elements transmitted per second.
• Bit rate is the number of bits transmitted per second.
Question 34
Answer: (B) 2 MHz
Explanation:
Manchester encoding uses two levels per bit, so the baud rate is double the bit rate. For 1 Mbps data rate, the minimum
bandwidth required is 2 MHz.
Related Facts and Points:
• Manchester encoding is a self-clocking encoding scheme.
Question 35
Answer: (C) 1 Mbaud and 8 MHz
Explanation:
Sending 3 bits per symbol means a baud rate of 1 Mbps (3 Mbps / 3 bits/symbol). Bandwidth is typically estimated as the
range of frequencies used, which would be around the carrier frequency with some margin.
Related Facts and Points:
• Baud rate is the number of symbols transmitted per second.
• Bandwidth is the range of frequencies used for communication.
Question 36
Answer: (D) 1080 kHz
Explanation:
Each channel requires 100 kHz bandwidth. With a 10 kHz guard band between channels, the total bandwidth for each
channel becomes 110 kHz. For 8 channels, the total bandwidth is 8 * 110 kHz = 880 kHz. However, there is no guard band
needed for the last channel, so we subtract 10 kHz, resulting in a total bandwidth of 880 - 10 = 1080 kHz.
Related Facts and Points:
• Guard bands are used to prevent interference between channels in frequency division multiplexing (FDM).
Question 37
Answer: (A) TDM
Explanation:
Time Division Multiplexing (TDM) combines multiple low-rate channels into a single high-rate channel by dividing the time
into slots and allocating slots to different channels.
Related Facts and Points:
• Other multiplexing techniques include Frequency Division Multiplexing (FDM) and Code Division Multiplexing
(CDM).
Question 38
Answer: (C) Cable TV networks
Explanation:
RG-59 coaxial cables are commonly used in cable TV networks to transmit video, audio, and data signals.
Related Facts and Points:
• Coaxial cables provide good shielding and high bandwidth.
Question 39
Answer: (A) HDLC
Explanation:
High-Level Data Link Control (HDLC) is a bit-oriented protocol used for communication over point-to-point and multipoint
links. It provides error detection, correction, and flow control mechanisms.
Related Facts and Points:
• HDLC is widely used in data communication networks.
Question 40
Answer: (D) none of these
Explanation:
PPP supports network address configuration (using DHCP), authentication (using PAP or CHAP), and flow control.
Related Facts and Points:
• PPP is a data link layer protocol used for establishing connections over various network technologies.
Question 41
Answer: (A) Presentation Layer
Explanation:
Encryption is typically performed at the Presentation Layer of the OSI model to protect data confidentiality and integrity.
Related Facts and Points:
• Other layers of the OSI model have different functions, such as network address assignment (Network Layer) and
process-to-process communication (Session Layer).
Question 42
Answer: (C) FDMA
Explanation:
Frequency Division Multiple Access (FDMA) assigns different frequency bands to different users for simultaneous
transmission.
Related Facts and Points:
• Other multiple access techniques include Time Division Multiple Access (TDMA) and Code Division Multiple Access
(CDMA).
Question 43
Answer: (D) 802.11
Explanation:
The IEEE 802.11 standard defines specifications for wireless LANs (Wi-Fi).
Related Facts and Points:
• Other IEEE 802 standards cover different network technologies.
Question 44
Answer: (B) ATM
Explanation:
Asynchronous Transfer Mode (ATM) is a cell-switching technology that divides data into fixed-size cells for transmission.
Related Facts and Points:
• ATM is used in broadband networks for high-speed data transfer.
Question 45
Answer: (A) TDMA and packet switching
Explanation:
Global System for Mobile Communications (GSM) uses Time Division Multiple Access (TDMA) to share the radio spectrum
among multiple users and packet switching for efficient data transmission.
Related Facts and Points:
• GSM is a second-generation (2G) mobile technology.
Question 46
Answer: (A) Connectionless unreliable protocol
Explanation:
UDP (User Datagram Protocol) is a connectionless protocol, meaning it does not establish a dedicated connection between
sender and receiver before data transmission. It is also unreliable, as it does not guarantee delivery of packets.
Related Facts and Points:
• UDP is often used for applications that prioritize speed over reliability, such as real-time streaming and online
gaming.
• TCP (Transmission Control Protocol) is a connection-oriented and reliable protocol.
Question 47
Answer: (D) Transport Layer
Explanation:
SCTP (Stream Control Transmission Protocol) is a transport layer protocol. It provides reliable, ordered delivery of data
between endpoints.
Related Facts and Points:
• SCTP is often used in VoIP and online gaming applications.
Question 48
Answer: (B) Cartesian product
Explanation:
The Cartesian product combines each tuple from one relation with every tuple from another relation, regardless of
matching attribute values.
Related Facts and Points:
• The result of a Cartesian product can be very large.
• Other relational algebra operations, like join, involve matching conditions.
Question 49
Answer: (B) Projection
Explanation:
Projection selects specific columns (attributes) from a relation, creating a new relation with only the specified columns.
Related Facts and Points:
• Projection is used to extract relevant information from a relation.
Question 50
Answer: (A) Domain
Explanation:
A domain defines the set of permissible values for an attribute in a relation.
Related Facts and Points:
• Domains help ensure data integrity.
Question 51
Answer: (C) External level data hiding
Explanation:
External level data hiding involves controlling the view of data presented to different users or applications. In this case,
employee data is hidden from managers.
Related Facts and Points:
• Data hiding is a crucial aspect of database security.
Question 52
Answer: (D) indeterminate state
Explanation:
In an SR flip-flop, when both S and R inputs are 1, the output is indeterminate, as both set and reset conditions are active
simultaneously.
Related Facts and Points:
• The indeterminate state should be avoided in digital circuit design.
Question 53
Answer: (B) n
Explanation:
An encoder with 2^n input lines can produce a unique code for each input combination, requiring n output lines to
represent the 2^n possible codes.
Related Facts and Points:
• Encoders are used to convert analog signals to digital signals.
Question 54
Answer: (A) 86740
Explanation:
The 10's complement of a number is found by subtracting the number from 10^n, where n is the number of digits in the
number. In this case, 100000 - 13250 = 86750. However, since we are calculating the 10's complement, we subtract 1 from
the result, giving 86740.
Related Facts and Points:
• 10's complement is used in arithmetic operations in computers.
Question 55
Answer: (B) Bubbled AND
Explanation:
DeMorgan's theorem states that the complement of a product (AND) is equal to the sum (OR) of the complements of the
individual terms, with the complements represented by bubbles. Therefore, a NOR gate (which is an inverted OR) is
equivalent to a bubbled AND gate.
Related Facts and Points:
• DeMorgan's theorem is used to simplify Boolean expressions.
Question 56
Answer: (B) B+BC
Explanation:
Let's simplify the expression step-by-step using Boolean algebra properties:
• AB + B((B+C') + B'C)
 • AB + B(B + C' + B'C) // Distributive law
• AB + BB + BC' + BB'C // Distributive law
• AB + B + BC' + 0 // BB = B and BB' = 0
• B(A + 1 + C') // Factor out B
• B(1) // A + 1 = 1
• B
Therefore, the simplified expression is B+BC.
Question 57
Answer: (C) Excess-3
Explanation:
Excess-3 code is a self-complementing code, meaning the 9's complement of a number can be obtained by simply inverting
the bits of its Excess-3 code.
Related Facts and Points:
• Other codes like 8421, 2421, and Gray code are not self-complementing.
Question 58
Answer: (A) NM 1
Explanation:
NM (Non-Maskable) interrupt has the highest priority in the 8086 microprocessor. It cannot be masked or ignored by the
processor.
Related Facts and Points:
• NM interrupt is typically used for critical error conditions.
Question 59
Answer: (C) ALE
Explanation:
ALE (Address Latch Enable) is the maximum mode signal in the 8085 microprocessor. It is used to latch the lower 8 bits of
the address onto the address bus.
Related Facts and Points:
• Other signals like DT/R', HOLD, and LOCK have different purposes in the 8085.
Question 60
Answer: (C) Division by zero interrupt
Explanation:
INT2 in the 8086 microprocessor is the interrupt generated when a division by zero operation occurs.
Related Facts and Points:
• Other interrupts like single step, non-maskable, and overflow have different interrupt numbers.
Question 61
Answer: (B) 8257
Explanation:
The 8257 is the programmable DMA controller in the 8086 microprocessor. It handles direct memory access operations,
transferring data between memory and I/O devices without involving the CPU.
Related Facts and Points:
• Other chips like 8259, 8251, and 8250 have different functions.
Question 62
Answer: (A) E-N+2
Explanation:
In cyclomatic complexity, V(G) is calculated as E - N + 2, where E is the number of edges and N is the number of nodes in
the flow graph.
Related Facts and Points:
• Cyclomatic complexity is a measure of the complexity of a program.
Question 63
Answer: (B) Spiral model
Explanation:
The Spiral model is a risk-driven process model that incorporates iterative development and risk management.
Related Facts and Points:
 • Other models like prototyping, component-based development, and waterfall model have different
characteristics.
Question 64
Answer: (C) Functional testing
Explanation:
Functional testing is typically used as the acceptance test for a software system. It verifies that the system meets the
specified requirements and functions correctly.
Related Facts and Points:
• Other testing methods like unit, integration, and regression testing have different purposes.
Question 65
Answer: (A) Hard real time
Explanation:
Applications like banking and reservation require a hard real-time operating system, which guarantees that critical tasks
will be completed within strict deadlines.
Related Facts and Points:
• Soft real-time systems prioritize tasks but allow for some flexibility in deadlines.
Question 66
Answer: (C) Before the CPU time slice expires
Explanation:
Preemptive scheduling involves suspending a running process before its allocated CPU time slice expires to allow other
processes to run.
Related Facts and Points:
• Preemptive scheduling improves system responsiveness.
Question 67
Answer: (C) Latency time
Explanation:
Latency time refers to the time it takes for a disk to rotate to the desired sector's starting position.
Related Facts and Points:
• Seek time is the time taken for the read/write head to move to the correct track.
• Transfer time is the time taken to transfer data from the disk to memory.
• Access time is the sum of seek time and latency time.
Question 68
Answer: (A) Process that share resources
Explanation:
Mutual exclusion is a problem that arises when multiple processes compete for access to shared resources.
Related Facts and Points:
• Mutual exclusion is a fundamental concept in operating systems.
• Solutions like semaphores, mutexes, and monitors are used to address mutual exclusion.
Question 69
Answer: (B) Portable Network Graphics
Explanation:
PNG stands for Portable Network Graphics.
Related Facts and Points:
• PNG is a lossless image format widely used on the internet.
Question 70
Answer: (B) Corrective maintenance
Explanation:
Corrective maintenance involves finding and fixing errors that occur during the operation of a system.
Related Facts and Points:
• Other types of maintenance include preventive maintenance (preventing failures), adaptive maintenance
(modifying the system to meet changing requirements), and perfective maintenance (improving the system's
performance).
Question 71
Answer: (C) Agile model
Explanation:
The Agile model emphasizes iterative development with short time frames and minimal planning.
Related Facts and Points:
• Agile methodologies include Scrum, Kanban, and Extreme Programming.
Question 72
Answer: (A) Remote login
Explanation:
Telnet is a network protocol used for remote login into a computer system.
Related Facts and Points:
• Telnet is an insecure protocol and has been largely replaced by SSH (Secure Shell).
Question 73
Answer: (D) Offshore outsourcing
Explanation:
Offshore outsourcing refers to the practice of outsourcing IT functions to companies in other countries.
Related Facts and Points:
• Offshore outsourcing is often driven by cost savings.
Question 74
Answer: (D) All of the above
Explanation:
All three methods - Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), and Code Division
Multiple Access (CDMA) - are used for mobile data internet working.
Related Facts and Points:
• Each method has its own advantages and disadvantages.
Question 75
Answer: (C) Intrusion-detection software
Explanation:
A honeypot is a decoy system designed to attract and detect intruders. It is a type of intrusion detection software.
Related Facts and Points:
• Honeypots can help in understanding attacker behavior and identifying vulnerabilities.
Question 76
Answer: (A) Shutdown the computer without closing the running application
Explanation:
Hibernation in Windows XP/7 saves the current system state to disk and then shuts down the computer. When the
computer is restarted, it resumes from the saved state, allowing the user to continue working where they left off without
closing running applications.
Question 77
Answer: (A) A command line interpreter
Explanation:
The UNIX Shell is a command-line interface that allows users to interact with the operating system by typing commands.
Question 78
Answer: (B) Second normal form
Explanation:
If every non-key attribute is functionally dependent on the primary key, and there are no partial dependencies (where a
non-key attribute depends on only part of the primary key), then the relation is in Second Normal Form (2NF).
Question 79
Answer: (B) Foreign key
Explanation:
A foreign key is an attribute in one table that references the primary key of another table. It establishes a link between
the two tables.
Question 80
Answer: (A) Record
Explanation:
In the relational model, a tuple represents a row of data, which is equivalent to a record in a file-based system.
Question 81
Answer: (A) Sardar Vallabhai Patel
Explanation:
Sardar Vallabhai Patel was not associated with the formation of the Congress Socialist Party in 1934. The other leaders
mentioned were key figures in the party's formation.
Question 82
Answer: (C) Germany and Soviet Union
Explanation:
Operation Barbarossa was the code name for the German invasion of the Soviet Union during World War II.
Question 83
Answer: (A) Erasmus
Explanation:
Erasmus was the author of "The Praise of Folly" (sometimes translated as "Prince of Folly").
Question 84
Answer: (A) Mannath Padmanabhan
Explanation:
Mannath Padmanabhan founded the Sadhu Jana Sangham, a social reform organization in Kerala.

Question 85
Answer: (B) Gopalakrishna Gokhale
Explanation: Gopal Krishna Gokhale was often referred to as the "Prince of Indian Politics" or the "Indian Gladstone"
due to his political acumen and dedication to the Indian people.
Question 86
Answer: (B) Annie Besant
Explanation: Annie Besant was a prominent Indian theosophist, educationist, and political activist. She founded the
newspaper "New India".
Question 87
Answer: (D) July 18, 1947
Explanation: The Indian Independence Act was passed by the British Parliament on July 18, 1947, which led to the
partition of India and the creation of independent India and Pakistan.
Question 88
Answer: (C) Kesari Balakrishna Pillai
Explanation: Kesari Balakrishna Pillai was a prominent social reformer and journalist in Kerala. He started the weekly
magazine "Prabhodakam".
Question 89
Answer: (C) Sikkim
Explanation: Sikkim is often referred to as the "Botanist's Paradise" due to its rich biodiversity and unique flora.
Question 90
Answer: (D) Quli Qutub Shah
Explanation: Quli Qutub Shah, the fifth ruler of the Qutb Shahi dynasty, built the iconic Charminar in Hyderabad.
Question 91
Answer: (B) Ganga
Explanation: The Ganga river is considered sacred by Hindus and holds immense cultural and religious significance in
India. It is often referred to as the "National River".
Question 92
Answer: (A) Chauri-Chaura
Explanation: The Chauri-Chaura incident, where British police opened fire on a peaceful protest, led to Mahatma Gandhi
suspending the Non-Cooperation Movement, which resulted in the formation of the Swaraj Party.
Question 93
Answer: (B) Dr. Palpu
Explanation: Dr. Palpu, a prominent social reformer and physician, was often referred to as the "Lincoln of Kerala" for
his contributions to the upliftment of the lower castes.
Question 94
Answer: (A) Writ
Explanation: Article 32 of the Indian Constitution deals with the fundamental right to constitutional remedies, including
the power of the Supreme Court to issue writs for the enforcement of fundamental rights.
Question 95
Answer: (B) Chattambi Swamikal
Explanation: Panmana Asramam is closely associated with Chattambi Swamikal, a prominent social reformer and
philosopher from Kerala.
Question 96
Answer: (D) Annie Besant
Explanation: Annie Besant presided over the Karachi session of the Indian National Congress in 1931.
Question 97
Answer: (D) 1896
Explanation: The famous Malayalam historical novel "Martandavarma" was published in 1896 by C.V. Raman Pillai.
Question 98
Answer: (C) 1792
Explanation: The last Mamankam festival at Thirunavaya was held in 1792.
Question 99
Answer: (C) Sakthan Thampuran
Explanation: Sakthan Thampuran, the ruler of Cochin, is credited with starting the Thrissur Pooram festival.
Question 100
Answer: (B) Bhagat Singh
Explanation: Bhagat Singh is known for raising the slogan "Inquilab Zindabad" for the first time.