RPSC Programmer Past Paper PDF 2024

COMPUTECH ACADEMY BY-SUNIL YADAV SIR 1 COMPUTECH 120 Test Date 29-09-2024 100 100 RPSC Programmer Paper -14...

COMPUTECH ACADEMY BY-SUNIL YADAV SIR 1 COMPUTECH 120 Test Date 29-09-2024 100 100 RPSC Programmer Paper -14 13 (Mock Test Paper – 14) Instructions For Candidates 1. All questions carry equal marks. 1. 2. Give only one answer to each question. 2. 3. If more than one answer is given, the answer to 3. the question would be treated as wrong. 4. OMR 4. Four options are given for each question. On the OMR answer sheet, the candidate should fill only one of the circles or bubbles with blue or black ball point pen indicating the correct answer. 5. 5. 1/3 part of the mark(s) of each question will be deducted for each wrong answer. (A wrong answer means an incorrect answer or more than one answer for any question) 6. 6. Please correctly fill your mobile number and other required information carefully on the OMR sheet. Filling up of incorrect or incomplete information can result in deduction of 5 marks from the total marks or withholding of result for which the candidate will be solely responsible. Warnining: If a candidate is caught copying or any unauthorized materaial is found in his/her possession, then action can be taken against that candidate under various rules and provisions. Do not open this Test Booklet Untile you are asked to do so. JOIN OFFLINE TEST CONTACT @ 9694473047 COMPUTECH ACADEMY BY-SUNIL YADAV SIR 2 1. Which of these encoding Codes mechanisms are not “self- (a) A-3, B-4, C-2, D-1 clocking”? (b) A-3, B-2, C-4, D-1 1 Manchester encoding (c) A-2, B-4, C-1, D-3 2 Differential Manchester encoding (d) A-4, B-3, C-2, D-1 3. Binary encoding 4. Consider the following figure 4. Nonreturn to zero 5. Return to zero Select the correct option: (a) 1, 2 and 3 (b) 1, 2 and 5 (c) 2, 4 and 5 (d) 3 and 4 2. Choose the best matching between Where A1, B1, C1 are three List-1 and List -2 networks and R1 and R2 are A. Data link layer routers. Then network B belongs to B. Network layer which of the following class. C. Transport layer (a) Class A (b) Class B List-2 (c) Class C (d) Class D 1. Ensure reliable transport of 5. An organization has a class C data over a physical point to network and wants to form, subnet point link four departments with hosts as 2. Encodes/decodes data for follows. physical transmission A. 72 B. 35 3. Allow end to end B. 20 D. 18 communication between 2 What are the possible processes arrangements of subnets? 4. Routes data from one network (a) For A-255.255.255.128; node to the next For B- 255.255.255.192; Codes For C & D-255.255.255.244 (a) A-1, B-4, C-3 (b) A-2, B-4, C-1 (b) For A-255.255.255.224; (c) A-2, B-3, C-1 (d) A-1, B-3, C-2 For B-255.255.255.192; 3. Match List – I with List- II For C & D-255.255.255.128 List- I (c) For A-255.255.255.192; A. Session layer For B-255.255.255.128; B. Transport layer C. Application layer For C & D-255.255.255.244 D. MDI (Medium Dependent (d) For A-255.255.255.224 Interface) B & C & D-255.255.255.224 List-II 6. Which of the following statements 1. Connects DCE into physical is/are TRUE about IP address. channel P: IP address 128.128.255.255 is 2. Provides end to end used for broadcasting on class B connectivity 3. Provides organised means to network exchange data between users Q: IP address 127.127.255.255 is 4. Supports an end user process used for loopback testing. and perform required file (a) P only transfer (b) Q only (c) Both P and Q (d) Neither P nor Q JOIN OFFLINE TEST CONTACT @ 9694473047 COMPUTECH ACADEMY BY-SUNIL YADAV SIR 3 7. Which of the following is a MAC (a) A-2, B-1, C-4, D-3 address? (b) A-3, B-1, C-4, D-3 (a)192.166.200.50 (c) A-3, B-4, C-2, D-1 (b) 00056A:01A5CCA7FF60 (d) A-4, B-1, C-2, D-3 (c) 568 Airport Road 12. Which of the following make(s) (d) 01:A5:BB:A7:FF:60 filtering decisions based on 8. The subnet mask for a particular application payload? network is 255.255.31.0 which of (a) Packet filter the following pairs of IP addresses (b) Deep inspection firewall could belong to this network? (c) Reverse prroxy (a) 172.57.88.62 and 172.56.87.23 (d) Stateful packet inspection firewall (b) 10.35.28.2 and 10.35.29.4 13. A cryptographic system that uses (c) 191.203.31.87 and 191.234.31.88 only symmetric key cryptography (d) 128.8.129.43 and 128.8.161.55 cannot provide digital signature 9. Assertion (A): Data link protocols because: almost always put the CRC in a (a) Symmetric key cryptography is trailer rather than in a header. computationally infeasible. Reason (R): The CRC is computed (b) Symmetric key cryptography during transmission and appended involves key distribution to the output stream as soon as (c) Symmetric key cryptography is the last bit goes out. unreliable. (a) Both [A] and [R] are true and [R] is (d) Digital signature requires a pair the correct reason for [A] of private-public keys. (b) Both [A] and [R] are true but [R] is 14. The main purpose of encryption is not the correct reason for [A] to provide (c) Both [A] and [R] are false (a) Data Security (b) Data integrity (d) [A] is true but [R] is false (c) Data Redundancy (d) (1) and (2) 10. Assertion (A): Selective repeat 15. Silly Window Syndrome (SWS) protocol requires more sequence occurs during? numbers than Go-back-N protocol. (a) Packet scheduling at routers Reason (R): Selective repeat (b) Intserv and Difflerv protocol uses comulative (c) Congestion Control acknowledments. (d) Flow control (a) Both (A) and (R) are true and (R) 16. Match the following: is the correct reason for (A) 1. Gateway P. Physical layer (b) Both (A) and (R) are true and (R) 2. Switch Q. Data link layer is not the correct reason for (A) 3. Router R. Network layer (c) Both (A) and (R) are false 4. Hub S. Transport layer (d) (A) is true but (R) is false (a) 1-S, 2-P, 3-R, 4-Q 11. Match the following cryptographic (b) 1-S, 2-R, 3-Q, 4-P algorithms with their design (c) 1-R, 2-Q, 3-S, 4-P (d) 1-S, 2-Q, 3-R, 4-P issues: 17. Which of the following are List-I List-II Dynamic Algorithms? A. DES 1. Message Digest 1. Distance Vector Routing B. AES 2. Public Key 2. Flooding Algorithm C. RSA 3. 56-bit key 3. Link State Routing D. SHA-1 4. 128-bit key 4. Path Vector Algorithm JOIN OFFLINE TEST CONTACT @ 9694473047 COMPUTECH ACADEMY BY-SUNIL YADAV SIR 4 (a) Only 2, 3 and 4(b) Only 1, 2 and 4 22. Consider a relation R(A, B, C, D) (c) Only 1, 2 and 3(d) Only 1, 3 and 4 with FDs A B and C D then the 18. Pick the true statements from the decomposition of R into R1(A,B) following. and R2(C, D) is 1. Circuit switching is a store and (a) Dependency preserving and forward technique lossless join 2. Packet switching is faster (b) Lossless but NOT dependency compared to circuit switching. preserving 3. Packet switching wastes less (c) Dependency preserving but not resources compared to circuit lossless join switching (d) Not dependency preserving and 4. Packet switching is not a store not lossless join and forward technique. 23. Given a relation R(A, B, C) with (a) Only 2 (b) 2 and 3 FDs set {A B, B C, C B} (c) Only 1 and 4 (d) All of these 1. Lossless decomposition is 19. Errors in the header or option always possible for R fields of an IP datagram require a 2. Dependency preserving _____ error message. decomposition is always (a) Parameter problem possible for R. (b) Source quench Assume decomposition includes all (c) Router solicitation (d) Redirection the attributes of R. 20. Suppose Host A sends over a TCP (a) Both 1 and 2 true connection to Host B one segment (b) 1 is true and 2 is false sequence number 38 and 4 bytes of (c) 1 is false and 2 is true data. What will be (d) Both 1 and 2 are false acknowledgments number for the 24. Choose the correct statement: subsequent segment? (a) If table R has a forgien key (a) 38 (b) 39 (c) 42 (d) 54 constraint referencing table S 21. Select the correct statement from then each tuple in R is necessarily the following? related to some tuple in S via (a) Role names are not technically forgien key necessary in relationship types (b) The SQL statement DELETE when all participating entity types FROM R might cause tuples in the are distinct table other than just R to be (b) When different entity types deleted participate only once in a single (c) NULL values can be used to opt a relationship types. It is called a tuple out of enforcement of a recursive relationship forgien key. (c) Partial participation which is also (d) Anything that can be expressed in called existence dependency is an ER diagram via ternary displayed as a double line relationship can be expressed in connecting the participating entity some other logically equivalent type to the relationship. way without the use of ternary (d) Cardinally ratio far binary relationship. relationship are displayed on entity relationship diagrams by using a diamond shape notation JOIN OFFLINE TEST CONTACT @ 9694473047 COMPUTECH ACADEMY BY-SUNIL YADAV SIR 5 25. Relation algebra is (a) Select name from emp (a) Data definition language Where sal = (select max (sal) from (b) Meta language emp) (c) Procedural query language (b) Select name from emp (d) None of the above Where sal >= (select sal from emp) 26. Consider the relations: (c) Both (a) and (b) are correct S (sid, sname, city) queries but the processing time is P (pid, pname, color) too high in (b) than in (a) SP (sid, pid) (d) Both (a) and (b) are correct but Consider the following SQL query processing is too high in (a) than Select distinct sname in (b) From S 29. Consider the following employee Where EXISTS schema employee (name, salary, (Select *From SP where SP.sid = dept. no. phone). Consider the s.sid AND SP.pid =‟P1‟) following SQL query. The above query represents which Select ename from employee of the following? where ename like (a) Get supplier names from suppliers “_ _ _” who supply part P1 It returns the name of employee. (b) Get supplier names who supply (a) Whose name is at least three part P1 only characters long. (c) Get supplier names who does not (b) Whose name is most three supply part P1 characters long. (d) None of these (c) Whose name is exactly three 27. Consider the relation characters long. Project (pno, pname, budget, city) (d) Whose name is. “_ _ _” Q1: SELECT pname 30. Consider the following relational FROM proj schema student (Sid, Sname) WHERE NOT (budget