Rajasthan BCI · Paper-II (100 MCQs) * { margin: 0; padding: 0; box-sizing: border-box; font-family: 'Segoe UI', Roboto, system-ui, sans-serif; } body { background: #f0f4fc; padding: 2rem 1rem; display: flex; justify-content: center; } .container { max-width: 1100px; width: 100%; background: white; border-radius: 32px; box-shadow: 0 20px 40px -12px rgba(0,20,40,0.25); padding: 2rem 2rem 1.5rem; } h1 { font-size: 1.8rem; font-weight: 700; color: #0b1e33; display: flex; align-items: center; flex-wrap: wrap; gap: 0.5rem; border-bottom: 2px solid #eef2f7; padding-bottom: 0.75rem; margin-bottom: 1.5rem; } h1 small { font-size: 0.85rem; font-weight: 400; color: #4b6a8b; margin-left: auto; background: #eef2f7; padding: 0.25rem 1rem; border-radius: 40px; } .status-bar { display: flex; flex-wrap: wrap; align-items: center; justify-content: space-between; gap: 0.5rem 1rem; background: #f0f4fe; padding: 0.7rem 1.4rem; border-radius: 60px; margin-bottom: 1.5rem; font-weight: 500; color: #1e3a5f; } .q-counter { background: #d4e0f5; padding: 0.2rem 1.2rem; border-radius: 40px; font-size: 0.95rem; } .score-badge { background: #1e3a5f; color: white; padding: 0.2rem 1.5rem; border-radius: 40px; font-size: 0.95rem; } .progress-container { width: 100%; background: #d4e0f5; border-radius: 20px; height: 8px; margin: 0.3rem 0 0.8rem; overflow: hidden; } .progress-bar { height: 100%; background: #1e3a5f; border-radius: 20px; transition: width 0.3s; width: 0%; } .question-nav-grid { display: flex; flex-wrap: wrap; gap: 0.4rem; margin: 0.5rem 0 1rem; padding: 0.3rem 0; } .q-dot { width: 34px; height: 34px; border-radius: 50%; border: 2px solid #ccd9eb; background: white; display: flex; align-items: center; justify-content: center; font-size: 0.7rem; font-weight: 600; color: #1e3a5f; cursor: pointer; transition: 0.1s; } .q-dot:hover { background: #eef4fb; transform: scale(1.05); } .q-dot.active { border-color: #1e3a5f; background: #1e3a5f; color: white; } .q-dot.answered { border-color: #28a745; background: #d4edda; } .q-dot.answered.active { background: #1e3a5f; color: white; border-color: #1e3a5f; } .question-card { background: white; border-radius: 24px; padding: 1.5rem 1.8rem; border: 1px solid #eaf0f8; box-shadow: 0 4px 12px rgba(0,0,0,0.02); margin-bottom: 1.5rem; } .q-meta { font-size: 0.8rem; color: #6f8aa8; background: #f5f8fc; padding: 0.2rem 0.8rem; border-radius: 20px; display: inline-block; margin-bottom: 0.8rem; } .q-text { font-size: 1.2rem; font-weight: 500; color: #0b1e33; line-height: 1.5; margin-bottom: 1.5rem; } .q-text .eng { display: block; } .q-text .hin { display: block; font-weight: 400; font-size: 0.95rem; color: #3d5a78; margin-top: 0.3rem; } .options { display: flex; flex-direction: column; gap: 0.6rem; } .option { display: flex; align-items: center; gap: 0.8rem; background: #fafcff; padding: 0.7rem 1.2rem; border-radius: 16px; border: 1.5px solid #e2eaf3; transition: 0.15s ease; cursor: pointer; } .option:hover { background: #f0f6ff; border-color: #a0bada; } .option input[type="radio"] { width: 18px; height: 18px; accent-color: #1a4b7a; cursor: pointer; flex-shrink: 0; } .option label { font-size: 1rem; color: #1a2e47; cursor: pointer; flex: 1; display: flex; flex-wrap: wrap; gap: 0.2rem 0.8rem; } .option .opt-label { font-weight: 500; color: #2a4a6a; min-width: 24px; } .option.selected { background: #e1ebfb; border-color: #336699; } .option.correct-reveal { background: #d4edda; border-color: #28a745; } .option.wrong-reveal { background: #f8d7da; border-color: #dc3545; } .nav-area { display: flex; flex-wrap: wrap; align-items: center; justify-content: space-between; gap: 1rem; margin-top: 1.2rem; } .btn-group { display: flex; gap: 0.6rem; flex-wrap: wrap; } .btn { background: white; border: 1.5px solid #ccd9eb; color: #1e3a5f; padding: 0.5rem 1.6rem; border-radius: 60px; font-weight: 600; font-size: 0.9rem; cursor: pointer; transition: 0.1s ease; } .btn-primary { background: #1e3a5f; border-color: #1e3a5f; color: white; } .btn-primary:hover { background: #143049; } .btn-outline { background: transparent; } .btn-outline:hover { background: #eef4fb; } .btn-success { background: #28a745; border-color: #28a745; color: white; } .btn-success:hover { background: #218838; } .btn:disabled { opacity: 0.5; pointer-events: none; } .result-panel { background: #e5edf9; border-radius: 28px; padding: 1.5rem 2rem; margin: 1.2rem 0 0.5rem; border-left: 6px solid #1e3a5f; display: none; flex-wrap: wrap; align-items: center; justify-content: space-between; gap: 1rem; } .result-panel .score-detail { font-size: 1.2rem; font-weight: 600; color: #0a1e32; } .result-panel .score-detail span { background: #1e3a5f; color: white; padding: 0.1rem 1.2rem; border-radius: 60px; margin-left: 0.5rem; } .result-stats { display: flex; gap: 1.2rem; flex-wrap: wrap; font-size: 0.95rem; } .result-stats span { background: white; padding: 0.1rem 1rem; border-radius: 40px; } .marking-note { font-size: 0.9rem; color: #2f4b6b; background: rgba(255,255,255,0.5); padding: 0.2rem 1.2rem; border-radius: 40px; } .footer-note { text-align: right; font-size: 0.8rem; color: #6f8aa8; margin-top: 0.8rem; border-top: 1px solid #e2ebf6; padding-top: 1rem; } @media (max-width: 600px) { .container { padding: 1rem; } .question-card { padding: 1rem; } .q-text { font-size: 1.05rem; } .status-bar { flex-direction: column; align-items: stretch; text-align: center; } .result-panel { flex-direction: column; text-align: center; } } 📘 Rajasthan BCI · Paper-II 100 MCQs · Full Practice Test Q1 / 100 ⚡ 0.00 0 answered Paper-II · Q1 Loading question... ◀ Prev Next ▶ ⟳ Reset 📊 Show Result 🎯 Score 0.00 ✅ 0 ❌ 0 ⬜ 0 ✔ +1 · ✘ –1/3 • 100 Paper-II questions • negative marking: 1/3 per wrong answer • click dots to jump (function() { // ----- ALL 100 PAPER-II QUESTIONS (from your provided files) ----- const questions = [ // ==== Rajasthan BCI Practice Test–1 Paper–II (Q61-80) ==== { id: 1, paper: "Paper-II", eng: "Which SQL command is used to remove specific rows from a table while keeping the table structure intact?", hin: "Table की structure को बनाए रखते हुए specific rows हटाने के लिए कौन-सा SQL command प्रयोग होता है?", options: ["DROP", "DELETE", "TRUNCATE", "REMOVE"], correct: 1 }, { id: 2, paper: "Paper-II", eng: "Which normal form removes transitive dependency?", hin: "कौन-सा normal form transitive dependency को हटाता है?", options: ["1NF", "2NF", "3NF", "4NF"], correct: 2 }, { id: 3, paper: "Paper-II", eng: "Consider relation R(A, B, C) with functional dependencies A → B and B → C. Which dependency necessarily follows?", hin: "Relation R(A, B, C) में functional dependencies A → B और B → C हैं। कौन-सी dependency निश्चित रूप से follow करती है?", options: ["B → A", "A → C", "C → A", "C → B"], correct: 1 }, { id: 4, paper: "Paper-II", eng: "A relation has attributes {A, B, C, D} and FDs A → B, B → C, C → D. What is the closure of A?", hin: "एक relation में attributes {A, B, C, D} और FDs A → B, B → C, C → D हैं। A का closure क्या है?", options: ["{A, B}", "{A, B, C}", "{A, C, D}", "{A, B, C, D}"], correct: 3 }, { id: 5, paper: "Paper-II", eng: "Which key is a minimal superkey?", hin: "Minimal superkey को क्या कहा जाता है?", options: ["Foreign Key", "Candidate Key", "Alternate Attribute", "Secondary Key"], correct: 1 }, { id: 6, paper: "Paper-II", eng: "Which protocol is used to securely transfer files over an SSH connection?", hin: "SSH connection के माध्यम से files को securely transfer करने के लिए कौन-सा protocol प्रयोग किया जाता है?", options: ["FTP", "SFTP", "SMTP", "SNMP"], correct: 1 }, { id: 7, paper: "Paper-II", eng: "Which protocol translates an IP address into a MAC address on a local network?", hin: "Local network में IP address को MAC address में translate करने के लिए कौन-सा protocol प्रयोग होता है?", options: ["DNS", "ARP", "DHCP", "HTTP"], correct: 1 }, { id: 8, paper: "Paper-II", eng: "What is the primary purpose of subnetting?", hin: "Subnetting का primary purpose क्या है?", options: ["Increase monitor resolution", "Divide a network into smaller logical networks", "Encrypt passwords", "Increase CPU speed"], correct: 1 }, { id: 9, paper: "Paper-II", eng: "Which IP address belongs to the private IPv4 address range?", hin: "निम्नलिखित में से कौन-सा IP address private IPv4 range में आता है?", options: ["8.8.8.8", "172.20.5.10", "1.1.1.1", "203.0.113.5"], correct: 1 }, { id: 10, paper: "Paper-II", eng: "Which OSI layer provides end-to-end delivery and reliability?", hin: "OSI model की कौन-सी layer end-to-end delivery और reliability प्रदान करती है?", options: ["Network Layer", "Transport Layer", "Session Layer", "Presentation Layer"], correct: 1 }, { id: 11, paper: "Paper-II", eng: "Which TCP mechanism helps control the rate at which a sender transmits data to avoid overwhelming the receiver?", hin: "Receiver को overload होने से बचाने के लिए sender की transmission rate को control करने वाला TCP mechanism कौन-सा है?", options: ["Congestion control", "Flow control", "Routing", "Encryption"], correct: 1 }, { id: 12, paper: "Paper-II", eng: "Which attack attempts to make a service unavailable by overwhelming it with traffic?", hin: "अत्यधिक traffic भेजकर किसी service को unavailable करने वाला attack कौन-सा है?", options: ["Phishing", "DDoS", "Keylogging", "Spoofing"], correct: 1 }, // ==== Rajasthan BCI Practice Test–1 Paper–II (Q81-100) ==== { id: 13, paper: "Paper-II", eng: "Which data structure is most appropriate for implementing a priority queue?", hin: "Priority Queue को implement करने के लिए कौन-सा data structure सबसे उपयुक्त है?", options: ["Stack", "Heap", "Linked List only", "Array only"], correct: 1 }, { id: 14, paper: "Paper-II", eng: "What is the worst-case time complexity of Quick Sort?", hin: "Quick Sort की worst-case time complexity क्या है?", options: ["O(log n)", "O(n)", "O(n log n)", "O(n²)"], correct: 3 }, { id: 15, paper: "Paper-II", eng: "Which traversal is commonly used to delete all nodes of a binary tree safely?", hin: "Binary tree के सभी nodes को safely delete करने के लिए कौन-सी traversal उपयुक्त है?", options: ["Preorder", "Inorder", "Postorder", "Level order"], correct: 2 }, { id: 16, paper: "Paper-II", eng: "Which algorithm is used to detect negative-weight cycles reachable from a source?", hin: "Source से reachable negative-weight cycles को detect करने के लिए कौन-सा algorithm उपयोग किया जाता है?", options: ["Dijkstra", "Bellman-Ford", "Prim", "Kruskal"], correct: 1 }, { id: 17, paper: "Paper-II", eng: "Which graph representation is generally more space-efficient for a sparse graph?", hin: "Sparse graph के लिए कौन-सा graph representation सामान्यतः अधिक space-efficient होता है?", options: ["Adjacency Matrix", "Adjacency List", "2D Array", "Incidence Matrix"], correct: 1 }, { id: 18, paper: "Paper-II", eng: "What is the main purpose of an index in a database?", hin: "Database में index का मुख्य उद्देश्य क्या है?", options: ["Reduce data accuracy", "Speed up data retrieval", "Increase redundancy", "Delete duplicate records"], correct: 1 }, { id: 19, paper: "Paper-II", eng: "Which ACID property ensures that a transaction is treated as an indivisible unit?", hin: "कौन-सी ACID property सुनिश्चित करती है कि transaction को indivisible unit माना जाए?", options: ["Consistency", "Isolation", "Atomicity", "Durability"], correct: 2 }, { id: 20, paper: "Paper-II", eng: "Which ACID property ensures that committed data survives a system failure?", hin: "कौन-सी ACID property सुनिश्चित करती है कि committed data system failure के बाद भी सुरक्षित रहे?", options: ["Atomicity", "Consistency", "Isolation", "Durability"], correct: 3 }, { id: 21, paper: "Paper-II", eng: "Which concurrency-control technique uses locks to control simultaneous access to database data?", hin: "Database data के simultaneous access को control करने के लिए locks का उपयोग करने वाली technique कौन-सी है?", options: ["Lock-Based Protocol", "Hashing", "Indexing", "Sorting"], correct: 0 }, { id: 22, paper: "Paper-II", eng: "Which SQL operation combines the result of two compatible SELECT queries and removes duplicate rows?", hin: "दो compatible SELECT queries के results को combine करके duplicate rows हटाने वाला SQL operation कौन-सा है?", options: ["UNION", "JOIN", "INTERSECT ALL", "CROSS JOIN"], correct: 0 }, { id: 23, paper: "Paper-II", eng: "Which command is used to give privileges to a database user?", hin: "Database user को privileges देने के लिए कौन-सा SQL command प्रयोग किया जाता है?", options: ["GRANT", "ALLOW", "PERMIT", "AUTHORIZE"], correct: 0 }, { id: 24, paper: "Paper-II", eng: "Which protocol is primarily associated with sending email between mail servers?", hin: "Mail servers के बीच email भेजने के लिए मुख्यतः कौन-सा protocol प्रयोग होता है?", options: ["SMTP", "POP3", "IMAP", "HTTP"], correct: 0 }, { id: 25, paper: "Paper-II", eng: "Which protocol is commonly used by email clients to retrieve messages while keeping them synchronized on the server?", hin: "Email messages को server पर synchronized रखते हुए retrieve करने के लिए कौन-सा protocol commonly used है?", options: ["SMTP", "IMAP", "FTP", "ARP"], correct: 1 }, { id: 26, paper: "Paper-II", eng: "Which IPv4 address class traditionally provides the largest number of hosts per network?", hin: "Traditional IPv4 classful addressing में किस class में प्रति network सबसे अधिक hosts होते हैं?", options: ["Class A", "Class B", "Class C", "Class D"], correct: 0 }, { id: 27, paper: "Paper-II", eng: "Which device regenerates or strengthens a signal to extend network transmission distance?", hin: "Network transmission distance बढ़ाने के लिए signal को regenerate करने वाला device कौन-सा है?", options: ["Router", "Switch", "Repeater", "Gateway"], correct: 2 }, { id: 28, paper: "Paper-II", eng: "Which type of software is specifically designed to detect and remove malicious programs?", hin: "Malicious programs को detect और remove करने के लिए कौन-सा software बनाया जाता है?", options: ["Compiler", "Antivirus", "Debugger", "Assembler"], correct: 1 }, { id: 29, paper: "Paper-II", eng: "Which backup method stores only the changes made since the last backup of any type?", hin: "कौन-सा backup method पिछले किसी भी backup के बाद हुए केवल changes को store करता है?", options: ["Full Backup", "Differential Backup", "Incremental Backup", "Mirror Backup"], correct: 2 }, { id: 30, paper: "Paper-II", eng: "Which software development model is most suitable when requirements are well-defined and unlikely to change?", hin: "जब requirements clearly defined हों और बदलने की संभावना कम हो, तो कौन-सा software development model अधिक उपयुक्त है?", options: ["Waterfall Model", "Agile Model", "Prototype Model", "Spiral Model"], correct: 0 }, { id: 31, paper: "Paper-II", eng: "Which testing technique checks the internal logic and structure of a program?", hin: "Program की internal logic और structure को check करने वाली testing technique कौन-सी है?", options: ["Black-box Testing", "White-box Testing", "Acceptance Testing", "Usability Testing"], correct: 1 }, { id: 32, paper: "Paper-II", eng: "Which approach is most effective for teaching programming to beginners?", hin: "Beginners को programming सिखाने के लिए कौन-सा approach अधिक effective है?", options: ["Only memorizing syntax", "Only theoretical lectures", "Concept explanation followed by guided hands-on practice", "Avoiding practical exercises"], correct: 2 }, // ==== Rajasthan BCI Practice Test–2 Paper–II (Q1-20) ==== { id: 33, paper: "Paper-II", eng: "Which of the following represents the correct hierarchy of memory from fastest to slowest?", hin: "निम्नलिखित में से memory का fastest से slowest सही क्रम कौन-सा है?", options: ["Cache → Registers → RAM → Secondary Storage", "Registers → Cache → RAM → Secondary Storage", "RAM → Registers → Cache → Secondary Storage", "Registers → RAM → Cache → Secondary Storage"], correct: 1 }, { id: 34, paper: "Paper-II", eng: "Which type of ROM can be electrically erased and reprogrammed?", hin: "कौन-सी ROM electrically erase और reprogram की जा सकती है?", options: ["PROM", "EPROM", "EEPROM", "Mask ROM"], correct: 2 }, { id: 35, paper: "Paper-II", eng: "Which CPU register temporarily stores intermediate arithmetic and logical results?", hin: "कौन-सा CPU register arithmetic और logical operations के intermediate results को temporarily store करता है?", options: ["Program Counter", "Accumulator", "Instruction Register", "Memory Address Register"], correct: 1 }, { id: 36, paper: "Paper-II", eng: "What is the hexadecimal equivalent of binary 11101110?", hin: "Binary 11101110 का hexadecimal equivalent क्या है?", options: ["CE", "DE", "EE", "FE"], correct: 2 }, { id: 37, paper: "Paper-II", eng: "What is the binary representation of decimal 25?", hin: "Decimal 25 का binary representation क्या है?", options: ["10101", "11001", "11011", "11100"], correct: 1 }, { id: 38, paper: "Paper-II", eng: "Which Boolean expression is equivalent to A + AB?", hin: "A + AB के equivalent Boolean expression क्या है?", options: ["A", "B", "AB", "A+B"], correct: 0 }, { id: 39, paper: "Paper-II", eng: "Which logic gate produces output 1 when its inputs are different?", hin: "कौन-सा logic gate inputs के different होने पर output 1 देता है?", options: ["AND", "OR", "XOR", "XNOR"], correct: 2 }, { id: 40, paper: "Paper-II", eng: "Which type of software translates an entire high-level program into machine code before execution?", hin: "कौन-सा software पूरे high-level program को execution से पहले machine code में translate करता है?", options: ["Interpreter", "Compiler", "Loader", "Linker"], correct: 1 }, { id: 41, paper: "Paper-II", eng: "Which translator converts and executes a high-level program statement by statement?", hin: "कौन-सा translator high-level program को statement-by-statement translate और execute करता है?", options: ["Compiler", "Assembler", "Interpreter", "Linker"], correct: 2 }, { id: 42, paper: "Paper-II", eng: "Which of the following is NOT a characteristic of an algorithm?", hin: "निम्नलिखित में से कौन algorithm की characteristic नहीं है?", options: ["Finiteness", "Definiteness", "Effectiveness", "Ambiguity"], correct: 3 }, { id: 43, paper: "Paper-II", eng: "What is the time complexity of accessing the first element of an array?", hin: "Array के first element को access करने की time complexity क्या है?", options: ["O(1)", "O(log n)", "O(n)", "O(n²)"], correct: 0 }, { id: 44, paper: "Paper-II", eng: "Which data structure is best suited for implementing an undo operation?", hin: "Undo operation को implement करने के लिए कौन-सा data structure सबसे उपयुक्त है?", options: ["Queue", "Stack", "Graph", "Heap"], correct: 1 }, { id: 45, paper: "Paper-II", eng: "In a circular queue, when the rear reaches the last position, where can the next insertion occur?", hin: "Circular queue में rear last position पर पहुँचने के बाद next insertion कहाँ हो सकता है?", options: ["Only at the same position", "At the first position if it is free", "Never", "Only in the middle"], correct: 1 }, { id: 46, paper: "Paper-II", eng: "Which linked list allows traversal in both forward and backward directions?", hin: "कौन-सी linked list में forward और backward दोनों directions में traversal संभव है?", options: ["Singly Linked List", "Circular Singly Linked List", "Doubly Linked List", "Linear Array"], correct: 2 }, { id: 47, paper: "Paper-II", eng: "What is the maximum number of edges in a simple undirected graph having n vertices?", hin: "n vertices वाले simple undirected graph में maximum edges कितनी हो सकती हैं?", options: ["n", "n−1", "n(n−1)/2", "n²"], correct: 2 }, { id: 48, paper: "Paper-II", eng: "Which traversal of a graph uses a queue?", hin: "Graph की कौन-सी traversal queue का उपयोग करती है?", options: ["DFS", "BFS", "Inorder", "Postorder"], correct: 1 }, { id: 49, paper: "Paper-II", eng: "Which traversal of a graph normally uses a stack or recursion?", hin: "Graph की कौन-सी traversal सामान्यतः stack या recursion का उपयोग करती है?", options: ["BFS", "DFS", "Level Order", "Hash Traversal"], correct: 1 }, { id: 50, paper: "Paper-II", eng: "Which sorting algorithm is generally considered stable and has O(n log n) worst-case complexity?", hin: "कौन-सा sorting algorithm generally stable है और जिसकी worst-case complexity O(n log n) है?", options: ["Quick Sort", "Selection Sort", "Merge Sort", "Bubble Sort"], correct: 2 }, { id: 51, paper: "Paper-II", eng: "Which algorithmic technique solves a problem by dividing it into smaller independent subproblems and combining their results?", hin: "कौन-सी algorithmic technique problem को छोटे independent subproblems में divide करके उनके results combine करती है?", options: ["Greedy Method", "Divide and Conquer", "Backtracking", "Brute Force"], correct: 1 }, { id: 52, paper: "Paper-II", eng: "Which technique is commonly used to solve the 0/1 Knapsack problem efficiently compared with brute force?", hin: "0/1 Knapsack problem को brute force की तुलना में efficiently solve करने के लिए कौन-सी technique commonly used है?", options: ["Dynamic Programming", "Linear Search", "Binary Search", "Simple Traversal"], correct: 0 }, // ==== Rajasthan BCI Practice Test–2 Paper–II (Q21-40) ==== { id: 53, paper: "Paper-II", eng: "Which of the following is NOT a valid C data type?", hin: "निम्नलिखित में से कौन-सा valid C data type नहीं है?", options: ["int", "float", "real", "char"], correct: 2 }, { id: 54, paper: "Paper-II", eng: "What will be the value of x after executing: int x = 5; x++;?", hin: "int x = 5; x++; execute करने के बाद x का मान क्या होगा?", options: ["4", "5", "6", "7"], correct: 2 }, { id: 55, paper: "Paper-II", eng: "Which operator has higher precedence in C/C++?", hin: "C/C++ में निम्नलिखित में से किस operator की precedence अधिक होती है?", options: ["+", "*", "=", "&&"], correct: 1 }, { id: 56, paper: "Paper-II", eng: "Which keyword is used to dynamically allocate memory in C++?", hin: "C++ में dynamically memory allocate करने के लिए कौन-सा keyword प्रयोग होता है?", options: ["malloc", "alloc", "new", "create"], correct: 2 }, { id: 57, paper: "Paper-II", eng: "Which concept allows a derived class to redefine a method of its base class?", hin: "कौन-सा concept derived class को base class की method को redefine करने की अनुमति देता है?", options: ["Encapsulation", "Method Overriding", "Method Overloading", "Abstraction"], correct: 1 }, { id: 58, paper: "Paper-II", eng: "Which access specifier makes class members accessible from outside the class?", hin: "कौन-सा access specifier class members को class के बाहर accessible बनाता है?", options: ["private", "protected", "public", "internal"], correct: 2 }, { id: 59, paper: "Paper-II", eng: "Which OOP principle combines data and methods into a single unit?", hin: "कौन-सा OOP principle data और methods को एक single unit में combine करता है?", options: ["Inheritance", "Encapsulation", "Polymorphism", "Abstraction"], correct: 1 }, { id: 60, paper: "Paper-II", eng: "What is the main purpose of a constructor?", hin: "Constructor का मुख्य उद्देश्य क्या है?", options: ["Destroy an object", "Initialize an object", "Compile a class", "Allocate CPU time"], correct: 1 }, { id: 61, paper: "Paper-II", eng: "Which Java keyword prevents a class from being inherited?", hin: "कौन-सा Java keyword class को inherit होने से रोकता है?", options: ["static", "final", "private", "super"], correct: 1 }, { id: 62, paper: "Paper-II", eng: "Which Java component converts bytecode into machine-level instructions at runtime?", hin: "Java का कौन-सा component runtime पर bytecode को machine-level instructions में convert करता है?", options: ["JDK", "JRE", "JVM", "JAR"], correct: 2 }, { id: 63, paper: "Paper-II", eng: "Which operating system component decides which process gets the CPU next?", hin: "Operating System का कौन-सा component तय करता है कि अगली process को CPU कौन मिलेगा?", options: ["Memory Manager", "Scheduler", "File Manager", "Loader"], correct: 1 }, { id: 64, paper: "Paper-II", eng: "Which scheduling algorithm selects the process with the smallest CPU burst time?", hin: "कौन-सा scheduling algorithm smallest CPU burst time वाली process को select करता है?", options: ["FCFS", "SJF", "Round Robin", "FIFO"], correct: 1 }, { id: 65, paper: "Paper-II", eng: "Which scheduling algorithm is most suitable for time-sharing systems?", hin: "Time-sharing systems के लिए कौन-सा scheduling algorithm अधिक उपयुक्त है?", options: ["FCFS", "Round Robin", "SJF", "Non-preemptive Priority"], correct: 1 }, { id: 66, paper: "Paper-II", eng: "What is a page fault?", hin: "Page fault क्या होता है?", options: ["Failure of CPU", "A requested page is not currently in main memory", "Failure of hard disk", "A page is permanently deleted"], correct: 1 }, { id: 67, paper: "Paper-II", eng: "Which memory-management technique divides physical memory into fixed-size blocks called frames?", hin: "कौन-सी memory-management technique physical memory को fixed-size blocks यानी frames में divide करती है?", options: ["Segmentation", "Paging", "Compaction", "Swapping"], correct: 1 }, { id: 68, paper: "Paper-II", eng: "Which deadlock avoidance algorithm uses the concept of safe state?", hin: "कौन-सा deadlock avoidance algorithm safe state की concept का उपयोग करता है?", options: ["FIFO Algorithm", "Banker's Algorithm", "Round Robin", "Dijkstra's Algorithm"], correct: 1 }, { id: 69, paper: "Paper-II", eng: "Which SQL command is used to create a new table?", hin: "नई table बनाने के लिए कौन-सा SQL command प्रयोग किया जाता है?", options: ["MAKE", "CREATE", "BUILD", "INSERT"], correct: 1 }, { id: 70, paper: "Paper-II", eng: "Which SQL command is used to add a new column to an existing table?", hin: "Existing table में नया column जोड़ने के लिए कौन-सा SQL command प्रयोग होता है?", options: ["UPDATE", "INSERT", "ALTER", "MODIFY"], correct: 2 }, { id: 71, paper: "Paper-II", eng: "A table has a composite primary key consisting of A and B. Which dependency represents a partial dependency?", hin: "किसी table की composite primary key A और B से बनी है। कौन-सी dependency partial dependency को दर्शाती है?", options: ["AB → C", "A → C", "AB → D", "ABC → D"], correct: 1 }, { id: 72, paper: "Paper-II", eng: "If X → Y and Y → Z, which inference rule gives X → Z?", hin: "यदि X → Y और Y → Z है, तो X → Z किस inference rule से प्राप्त होगा?", options: ["Reflexivity", "Augmentation", "Transitivity", "Union"], correct: 2 }, // ==== Rajasthan BCI Practice Test–2 Paper–II (Q41-60) ==== { id: 73, paper: "Paper-II", eng: "Which normal form requires every non-key attribute to be fully functionally dependent on the whole candidate key?", hin: "कौन-सा normal form सुनिश्चित करता है कि प्रत्येक non-key attribute पूरी candidate key पर fully functionally dependent हो?", options: ["1NF", "2NF", "3NF", "BCNF"], correct: 1 }, { id: 74, paper: "Paper-II", eng: "Consider R(A,B,C,D) with FDs A→B and B→C. Which attribute is transitively dependent on A?", hin: "R(A,B,C,D) में A→B और B→C हैं। कौन-सा attribute A पर transitively dependent है?", options: ["A", "B", "C", "D"], correct: 2 }, { id: 75, paper: "Paper-II", eng: "Which normal form requires every determinant to be a candidate key?", hin: "कौन-सा normal form यह आवश्यक करता है कि प्रत्येक determinant candidate key हो?", options: ["2NF", "3NF", "BCNF", "4NF"], correct: 2 }, { id: 76, paper: "Paper-II", eng: "Which relational algebra operation selects specific columns from a relation?", hin: "Relational algebra में specific columns चुनने के लिए कौन-सा operation प्रयोग होता है?", options: ["Selection", "Projection", "Join", "Union"], correct: 1 }, { id: 77, paper: "Paper-II", eng: "Which relational algebra operation selects tuples satisfying a condition?", hin: "Condition को satisfy करने वाले tuples चुनने के लिए कौन-सा relational algebra operation प्रयोग होता है?", options: ["Projection", "Selection", "Join", "Difference"], correct: 1 }, { id: 78, paper: "Paper-II", eng: "Which SQL clause is used to arrange query results in ascending or descending order?", hin: "Query results को ascending या descending order में arrange करने के लिए कौन-सा SQL clause प्रयोग होता है?", options: ["GROUP BY", "ORDER BY", "HAVING", "SORT BY"], correct: 1 }, { id: 79, paper: "Paper-II", eng: "Which SQL clause is generally used with aggregate functions to group rows having the same values?", hin: "Aggregate functions के साथ rows को समान values के आधार पर groups में बाँटने के लिए कौन-सा SQL clause प्रयोग होता है?", options: ["ORDER BY", "GROUP BY", "WHERE", "DISTINCT"], correct: 1 }, { id: 80, paper: "Paper-II", eng: "Which JOIN returns only the rows having matching values in both tables?", hin: "कौन-सा JOIN केवल दोनों tables में matching values वाली rows return करता है?", options: ["LEFT JOIN", "RIGHT JOIN", "INNER JOIN", "FULL OUTER JOIN"], correct: 2 }, { id: 81, paper: "Paper-II", eng: "Which JOIN returns all rows from the left table and matching rows from the right table?", hin: "कौन-सा JOIN left table की सभी rows और right table की matching rows return करता है?", options: ["INNER JOIN", "LEFT OUTER JOIN", "RIGHT OUTER JOIN", "CROSS JOIN"], correct: 1 }, { id: 82, paper: "Paper-II", eng: "Which SQL keyword eliminates duplicate rows from a result?", hin: "Result से duplicate rows हटाने के लिए कौन-सा SQL keyword प्रयोग होता है?", options: ["UNIQUE", "DISTINCT", "REMOVE", "DIFFERENT"], correct: 1 }, { id: 83, paper: "Paper-II", eng: "Which protocol maps a domain name such as example.com to an IP address?", hin: "example.com जैसे domain name को IP address में map करने वाला protocol कौन-सा है?", options: ["DHCP", "DNS", "ARP", "FTP"], correct: 1 }, { id: 84, paper: "Paper-II", eng: "Which protocol provides reliable, connection-oriented transport?", hin: "कौन-सा protocol reliable और connection-oriented transport प्रदान करता है?", options: ["UDP", "IP", "TCP", "ARP"], correct: 2 }, { id: 85, paper: "Paper-II", eng: "Which protocol is connectionless and generally has lower overhead than TCP?", hin: "कौन-सा protocol connectionless है और सामान्यतः TCP से कम overhead रखता है?", options: ["TCP", "UDP", "FTP", "SMTP"], correct: 1 }, { id: 86, paper: "Paper-II", eng: "Which device connects devices within a LAN and forwards frames based on MAC addresses?", hin: "LAN में devices को connect करके MAC addresses के आधार पर frames forward करने वाला device कौन-सा है?", options: ["Router", "Switch", "Modem", "Repeater"], correct: 1 }, { id: 87, paper: "Paper-II", eng: "Which network topology provides a dedicated point-to-point link between every pair of devices?", hin: "कौन-सी network topology प्रत्येक pair of devices के बीच dedicated point-to-point link प्रदान करती है?", options: ["Bus", "Star", "Ring", "Mesh"], correct: 3 }, { id: 88, paper: "Paper-II", eng: "Which OSI layer is responsible for converting data formats, encryption and compression?", hin: "Data formats conversion, encryption और compression के लिए OSI की कौन-सी layer responsible है?", options: ["Application", "Presentation", "Session", "Transport"], correct: 1 }, { id: 89, paper: "Paper-II", eng: "Which OSI layer establishes, manages and terminates communication sessions?", hin: "Communication sessions को establish, manage और terminate करने वाली OSI layer कौन-सी है?", options: ["Transport", "Network", "Session", "Presentation"], correct: 2 }, { id: 90, paper: "Paper-II", eng: "Which attack attempts to guess passwords by trying many possible combinations?", hin: "बहुत-से possible combinations try करके password guess करने वाला attack कौन-सा है?", options: ["Phishing", "Brute-force attack", "DDoS", "SQL Injection"], correct: 1 }, { id: 91, paper: "Paper-II", eng: "Which attack injects malicious SQL statements through an application's input fields?", hin: "Application के input fields के माध्यम से malicious SQL statements insert करने वाला attack कौन-सा है?", options: ["XSS", "SQL Injection", "Phishing", "Spoofing"], correct: 1 }, { id: 92, paper: "Paper-II", eng: "Which attack injects malicious scripts into web pages viewed by users?", hin: "User द्वारा देखे जाने वाले web pages में malicious scripts inject करने वाला attack कौन-सा है?", options: ["XSS", "DDoS", "Brute Force", "ARP Spoofing"], correct: 0 }, // Additional questions to reach 100 { id: 93, paper: "Paper-II", eng: "Which security principle ensures that information is accessible only to authorized users?", hin: "कौन-सा security principle सुनिश्चित करता है कि information केवल authorized users के लिए accessible हो?", options: ["Confidentiality", "Integrity", "Availability", "Authenticity"], correct: 0 }, { id: 94, paper: "Paper-II", eng: "Which type of malware is designed to replicate itself and spread to other computers?", hin: "किस प्रकार का malware खुद को replicate करके दूसरे computers में फैलने के लिए डिज़ाइन किया गया है?", options: ["Virus", "Trojan", "Ransomware", "Adware"], correct: 0 }, { id: 95, paper: "Paper-II", eng: "Which programming paradigm focuses on data and methods operating on that data?", hin: "कौन-सा programming paradigm data और उस पर काम करने वाली methods पर केंद्रित है?", options: ["Procedural", "Functional", "Object-Oriented", "Logic"], correct: 2 }, { id: 96, paper: "Paper-II", eng: "Which software development methodology emphasizes iterative development and customer collaboration?", hin: "कौन-सी software development methodology iterative development और customer collaboration पर जोर देती है?", options: ["Waterfall", "Agile", "Spiral", "V-Model"], correct: 1 }, { id: 97, paper: "Paper-II", eng: "What is the time complexity of binary search on a sorted array?", hin: "Sorted array पर binary search की time complexity क्या है?", options: ["O(1)", "O(log n)", "O(n)", "O(n²)"], correct: 1 }, { id: 98, paper: "Paper-II", eng: "Which data structure is used for implementing a symbol table in a compiler?", hin: "Compiler में symbol table implement करने के लिए कौन-सा data structure प्रयोग होता है?", options: ["Stack", "Queue", "Hash Table", "Linked List"], correct: 2 }, { id: 99, paper: "Paper-II", eng: "What does the acronym SQL stand for?", hin: "SQL का पूरा रूप क्या है?", options: ["Structured Query Language", "System Query Language", "Structured Question Language", "Simple Query Language"], correct: 0 }, { id: 100, paper: "Paper-II", eng: "Which protocol is used for sending error messages on IP networks?", hin: "IP networks पर error messages भेजने के लिए कौन-सा protocol प्रयोग होता है?", options: ["ICMP", "IGMP", "RIP", "BGP"], correct: 0 } ]; // ----- state ----- let currentIndex = 0; const userAnswers = new Array(questions.length).fill(null); let resultShown = false; // DOM refs const qTextEng = document.querySelector('#questionText .eng'); const qTextHin = document.querySelector('#questionText .hin'); const qMeta = document.getElementById('qMeta'); const optionsContainer = document.getElementById('optionsContainer'); const prevBtn = document.getElementById('prevBtn'); const nextBtn = document.getElementById('nextBtn'); const resetBtn = document.getElementById('resetBtn'); const submitBtn = document.getElementById('submitBtn'); const questionCounter = document.getElementById('questionCounter'); const liveScoreDisplay = document.getElementById('liveScoreDisplay'); const answeredCount = document.getElementById('answeredCount'); const progressBar = document.getElementById('progressBar'); const resultPanel = document.getElementById('resultPanel'); const finalScoreSpan = document.getElementById('finalScore'); const correctCountSpan = document.getElementById('correctCount'); const wrongCountSpan = document.getElementById('wrongCount'); const unansweredCountSpan = document.getElementById('unansweredCount'); const navDots = document.getElementById('navDots'); function getAnsweredCount() { return userAnswers.filter(a => a !== null).length; } function calculateScore() { let marks = 0; for (let i = 0; i < questions.length; i++) { const ans = userAnswers[i]; if (ans === null) continue; if (ans === questions[i].correct) marks += 1; else marks -= (1/3); } return Math.round(marks * 100) / 100; } function getStats() { let correct = 0, wrong = 0, unanswered = 0; for (let i = 0; i < questions.length; i++) { const ans = userAnswers[i]; if (ans === null) { unanswered++; continue; } if (ans === questions[i].correct) correct++; else wrong++; } return { correct, wrong, unanswered }; } function updateLiveScore() { const score = calculateScore(); liveScoreDisplay.textContent = `⚡ ${score.toFixed(2)}`; const answered = getAnsweredCount(); answeredCount.textContent = `${answered} answered`; progressBar.style.width = `${(answered / questions.length * 100).toFixed(1)}%`; document.querySelectorAll('.q-dot').forEach((dot, idx) => { dot.classList.toggle('answered', userAnswers[idx] !== null); dot.classList.toggle('active', idx === currentIndex); }); } function renderQuestion(index) { const q = questions[index]; if (!q) return; qMeta.textContent = `${q.paper} · Q${q.id}`; qTextEng.textContent = q.eng; qTextHin.textContent = q.hin; optionsContainer.innerHTML = ''; const labels = ['A', 'B', 'C', 'D']; q.options.forEach((optText, idx) => { const div = document.createElement('div'); div.className = 'option'; if (userAnswers[index] === idx) div.classList.add('selected'); if (resultShown) { if (idx === q.correct) div.classList.add('correct-reveal'); else if (userAnswers[index] === idx && idx !== q.correct) div.classList.add('wrong-reveal'); } const radio = document.createElement('input'); radio.type = 'radio'; radio.name = 'question'; radio.value = idx; radio.checked = (userAnswers[index] === idx); if (resultShown) radio.disabled = true; const label = document.createElement('label'); label.innerHTML = `${labels[idx]}. ${optText}`; div.appendChild(radio); div.appendChild(label); optionsContainer.appendChild(div); div.addEventListener('click', (e) => { if (resultShown) return; if (e.target.tagName === 'INPUT' && e.target.type === 'radio') return; const radioInput = div.querySelector('input[type="radio"]'); if (radioInput) { radioInput.checked = true; radioInput.dispatchEvent(new Event('change')); } }); radio.addEventListener('change', () => { if (resultShown) return; document.querySelectorAll('.option').forEach(opt => opt.classList.remove('selected')); div.classList.add('selected'); userAnswers[currentIndex] = Number(radio.value); updateLiveScore(); updateCounterAndButtons(); }); }); updateCounterAndButtons(); } function updateCounterAndButtons() { questionCounter.textContent = `Q${currentIndex+1} / ${questions.length}`; prevBtn.disabled = (currentIndex === 0); nextBtn.disabled = (currentIndex === questions.length - 1); updateLiveScore(); } function buildNavDots() { navDots.innerHTML = ''; for (let i = 0; i < questions.length; i++) { const dot = document.createElement('div'); dot.className = 'q-dot'; dot.textContent = i + 1; if (i === currentIndex) dot.classList.add('active'); if (userAnswers[i] !== null) dot.classList.add('answered'); dot.addEventListener('click', () => goTo(i)); navDots.appendChild(dot); } } function showResult() { resultShown = true; const score = calculateScore(); const stats = getStats(); finalScoreSpan.textContent = score.toFixed(2); correctCountSpan.textContent = `✅ ${stats.correct}`; wrongCountSpan.textContent = `❌ ${stats.wrong}`; unansweredCountSpan.textContent = `⬜ ${stats.unanswered}`; resultPanel.style.display = 'flex'; submitBtn.textContent = '📊 Result Shown'; submitBtn.disabled = true; renderQuestion(currentIndex); resultPanel.scrollIntoView({ behavior: 'smooth', block: 'center' }); } function resetAll() { if (confirm('Reset all answers?')) { for (let i = 0; i < userAnswers.length; i++) userAnswers[i] = null; resultShown = false; resultPanel.style.display = 'none'; submitBtn.textContent = '📊 Show Result'; submitBtn.disabled = false; renderQuestion(currentIndex); buildNavDots(); updateLiveScore(); } } function goTo(index) { if (index < 0) index = 0; if (index >= questions.length) index = questions.length - 1; currentIndex = index; renderQuestion(index); buildNavDots(); document.getElementById('questionContainer').scrollIntoView({ behavior: 'smooth', block: 'start' }); } // Events prevBtn.addEventListener('click', () => { if (currentIndex > 0) goTo(currentIndex - 1); }); nextBtn.addEventListener('click', () => { if (currentIndex < questions.length - 1) goTo(currentIndex + 1); }); resetBtn.addEventListener('click', resetAll); submitBtn.addEventListener('click', showResult); document.addEventListener('keydown', (e) => { if (e.key === 'ArrowLeft' && !prevBtn.disabled) prevBtn.click(); else if (e.key === 'ArrowRight' && !nextBtn.disabled) nextBtn.click(); }); // Init buildNavDots(); renderQuestion(0); resultPanel.style.display = 'none'; })();