Get complete RPSC Programmer Exam Paper-1 solved questions with detailed explanations. Practice previous year papers, boost your subject knowledge, and prepare effectively for the RPSC Programmer exam with authentic and accurate solutions.
In addition, this solution guide is not just about answers, it is designed as a learning companion. By studying these explanations, students can strengthen their problem-solving skills and approach future exams with greater clarity and confidence.
| Unit | Unit Name | Description |
|---|---|---|
| Unit 1 | Reasoning Test & Numerical Analysis & General Knowledge | Problem solving, Data Interpretation, Data Sufficiency, Logical Reasoning and Analytical Reasoning. General Knowledge and Current Affairs relating to India and Rajasthan. |
| Unit 2 | Data Base Management Systems | ER Diagram, Data Models - Relational and Object Oriented Databases. Data Base Design: Conceptual data base design, Normalization Primitive and Composite data types, concept of physical and logical databases, data abstraction and data independence, data aggregation and Relational Algebra. Application Development using SQL: Host Language interface, embedded SQL programming, Stored procedures and triggers and views, Constraints assertions. Internal of RDBMS: Physical data organisation in sequential, indexed random and hashed files. Inverted and multilist structures, B trees, B+ trees, Query Optimisation, Join algorithm. Transaction Processing, concurrency control and recovery management. Transaction model properties and state serialisability. Lock base protocols, Two Phase Locking. |
| Unit 3 | Data Communication and Computer Networks | Computer Network Architecture, Circuit Switching, Packet And Massage Switching, Network Structure. Physical Layer, Data Link Layer, Framing. Retransmission Algorithms. Multiple Access and Aloha. CSMA/CD and Ethernet. High Speed LANs and Topologies. Broadcast Routing and Spanning Trees. TCP/IP Stack. IP Networks and Internet. DNS and Firewalls. Intrusion Detection and Prevention. Transport Layer and TCP/IP. Network Management and Interoperability. |
| Exam Name | RPSC Programmer Exam Paper-1 : 2024 | |
|---|---|---|
| Exam Date | 27th October 2024 | |
| S.N. | Name of Subjects | No. of Questions Asked |
| 01. | Reasoning Test & Numerical Analysis & General Knowledge | 40 |
| 02. | Database Management Systems (DBMS) | 32 |
| 03. | Data Communication and Computer Networks (DCN) | 28 |
Q: 1 Two phase locking protocol has which of the following problem(s)?
Option D
Two-Phase Locking (2PL) protocol, which is used for concurrency control in database systems, has the problems of deadlock and cascading rollback.
Q: 2 Consider following two instances of relations, X and Y:
| X | |
|---|---|
| Code | Item |
| 100 | A |
| 200 | B |
| 300 | B |
| 400 | C |
| Y | |
|---|---|
| Item | Quantity |
| A | 5 |
| B | 6 |
| C | 3 |
How many total tuples a Cartesian Product between the two relations X and Y will produce?
Option A
A Cartesian Product between two relations (tables) pairs every row of the first table with every row of the second table. So the total number of tuples is:
Total Tuples = (Number of tuples in X) × (Number of tuples in Y)
Here, Number of tuples in X = 4 and Number of tuples in Y = 3. This means every row of X will pair with every row of Y, producing 4×3 = 12 total tuples.
Q: 3 Consider a relation with attributes {A, B, C, D} and the following functional dependencies:
A → B, B → C, and C → D. If A is the primary key, which of the following is true regarding BCNF?
Option C
Given the relation R(A, B, C, D) with functional dependencies:
A → B
B → C
C → D
Primary Key: A
Check for BCNF:
A relation is in Boyce-Codd Normal Form (BCNF) if for every functional dependency X→Y, X is a candidate key or super key.
So, BCNF ensures that each non—key (non—prime) attributes is dependent only on the candidate key.
A→B: A is the primary key (Super Key): Satisfy BCNF condition.
B→C: B is not a Super Key : Violates BCNF condition.
C→D: C is not a Super Key : Violates BCNF condition.
Check for 3NF:
The relation is in 3NF if there is no transitive dependency i.e., no non—prime attribute can determine another non—prime attribute.
A→B: A is the prime attribute : Satisfy 3NF condition.
B→C: Both B and C are non—prime attributes : Violates 3NF condition.
C→D: Both C and D are non—prime attributes : Violates 3NF condition.
Check for 2NF:
The relation is in 2NF if there is no partial dependency i.e., no proper subset of candidate key can determine the non—prime attribute.
The relation is at least in 2NF, if key contains only one attribute (here A is primary key, only one attribute no subset possible), then there is no partial dependency because one attribute has no subset. So, the relation is in 2NF. Among the given options the correct answer is The relation is not in BCNF.
Q: 4 Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
(I) 2PL (Two Phase Lock)
(II) Time-Stamp ordering
(III) Multiple granularity protocol
Option B
Concurrency Control in a database ensures that when multiple transactions run at the same time, they do not interfere with each other. Its main goal is to maintain correctness, consistency, and isolation so that the final result remains the same as if transactions were executed one by one.
When we check concurrency control protocols, we look for two important properties:
Two Phase Locking (2PL) ensures conflict serializability by enforcing that transactions lock data in two phases (growing and shrinking), but it does not guarantee freedom from deadlock. The deadlocks can still occur in 2PL.
Timestamp Ordering Protocol guarantees both conflict serializability and freedom from deadlock because it assigns timestamps to transactions and schedules operations based on these timestamps, avoiding cyclic waits and deadlocks.
Multiple Granularity Protocol primarily helps reduce lock overhead and increase concurrency by using locks at different levels of granularity, but it does not guarantee deadlock freedom by itself. The deadlock can still occur.
Q: 5 Which operation allows us to find tuples that are in one relation but are not in another relation?
Option C
In relational algebra, the set-difference operation (−) allows us to retrieve tuples that are present in one relation but not in another. It is written as R−S, returns all tuples that are in R but not in S.
This operation requires both relations to be Union-Compatible, meaning they must have the same set of attributes with compatible domains.
Q: 6 Indices whose search key specifies an order different from the sequential order of the file are called—
Option D
An Index in a database is a special data structure that helps the system locate records quickly without scanning the entire table.
Primary Indices correspond to the sequence of the data file itself, meaning the index key and the file are ordered the same way.
Secondary Indices have a search key order that is different from the sequential order of the data file. This allows access to data organized by non-primary keys, where the actual data storage is unrelated to the index ordering.
Q: 7 What is the advantage of setting up a DMZ (Demilitarized Zone) using firewall?
Option B
The primary advantage of setting up a DMZ (Demilitarized Zone) using a firewall is to create multiple zones of trust within a network, which enhances security. A DMZ acts as a buffer zone between the public Internet and the internal private network, isolating public-facing servers (such as web, email, and DNS servers) from sensitive internal resources. This setup allows external users to access services in the DMZ while preventing direct access to the internal network.
Q: 8 Consider the following instance of a relation District –
| District | |
|---|---|
| Name | Population |
| JA | 10 |
| AJ | 50 |
| MM | 5 |
Which of the District names will be returned by the following relational algebra expression?
(πName(σName=“AJ”(District)))–[(πName(σPopulation>5(District))∩(πName(σName=“AJ”(District)))]
DELETE
Q: 9 The primary use of scramblers in Line Coding Schemes is to—
Option A
A scrambler is used in line coding schemes to modify the original data before transmission.
Q: 10 Which of the following is true for Circuit Switching handling multiple simultaneous connections?
Option C
In Circuit Switching, a dedicated physical path (circuit) is created between the sender and receiver before communication starts. This path remains reserved for the entire duration of the call.
So, when multiple users communicate at the same time, each user gets a separate circuit.
Thank you so much for taking the time to read my Computer Science MCQs section carefully. Your support and interest mean a lot, and I truly appreciate you being part of this journey. Stay connected for more insights and updates! If you'd like to explore more tutorials and insights, check out my YouTube channel .
Don’t forget to subscribe and stay connected for future updates.
| Student Name | |
|---|---|
| College |
| What's Say |
|---|