50 MCQs – Computer Science & Aptitude Reasoning | Interactive Quiz

50 MCQs – Computer Science & Aptitude Reasoning | Interactive Quiz /* ---------- Global Reset & Base (Rajasthani Theme) ---------- */ * { margin: 0; padding: 0; box-sizing: border-box; } body { font-family: 'Segoe UI', 'Roboto', 'Noto Sans Devanagari', sans-serif; background: #fcf3e8; color: #2d1b0e; padding: 20px; min-height: 100vh; display: flex; justify-content: center; align-items: flex-start; } .container { max-width: 820px; width: 100%; margin: 0 auto; background: #fffdf9; border-radius: 28px; box-shadow: 0 20px 60px rgba(150, 80, 30, 0.15); padding: 30px 35px 50px; border: 1px solid #f0dcc8; transition: all 0.2s; } /* ---------- Breadcrumb ---------- */ .breadcrumb { font-size: 0.85rem; color: #7a5a3a; margin-bottom: 20px; padding: 8px 0; border-bottom: 1px solid #ecdccc; } .breadcrumb a { color: #8b1a1a; text-decoration: none; } .breadcrumb a:hover { text-decoration: underline; } .breadcrumb .sep { margin: 0 6px; color: #c0392b; } /* ---------- Header ---------- */ .blog-header { text-align: center; padding-bottom: 25px; border-bottom: 3px double #c0392b; margin-bottom: 30px; position: relative; } .blog-header::after { content: "✦"; position: absolute; bottom: -14px; left: 50%; transform: translateX(-50%); background: #fffdf9; padding: 0 14px; font-size: 22px; color: #c0392b; } .blog-header h1 { font-size: 2.2rem; font-weight: 700; color: #8b1a1a; letter-spacing: 1px; } .blog-header h1 i { color: #d4a017; margin: 0 6px; } .blog-header .subtitle { font-size: 1.05rem; color: #7a4a2a; margin-top: 8px; font-weight: 500; } .blog-header .subtitle i { color: #b8860b; } .meta-badge { display: inline-block; background: #c0392b; color: #fff; padding: 4px 18px; border-radius: 30px; font-size: 0.8rem; font-weight: 600; letter-spacing: 0.5px; margin-top: 12px; } .tags { display: flex; justify-content: center; gap: 0.8rem; flex-wrap: wrap; margin-top: 0.8rem; } .tags span { display: inline-block; background: #f8ede4; color: #8b1a1a; font-size: 0.7rem; font-weight: 600; padding: 0.15rem 1rem; border-radius: 30px; border: 1px solid #e6d3c4; letter-spacing: 0.3px; } /* ---------- Progress Area ---------- */ .progress-area { display: flex; align-items: center; gap: 1rem; margin-bottom: 1.6rem; flex-wrap: wrap; background: #f8ede4; padding: 0.4rem 1rem; border-radius: 60px; border: 1px solid #e6d3c4; } .progress-track { flex: 1; min-width: 80px; height: 8px; background: #e6d3c4; border-radius: 20px; overflow: hidden; } .progress-fill { height: 100%; width: 0%; background: linear-gradient(90deg, #c0392b, #d4a017); border-radius: 20px; transition: width 0.4s ease; } .q-counter { font-weight: 600; font-size: 0.85rem; color: #5a3a28; background: #f8ede4; padding: 0.15rem 1rem; border-radius: 30px; white-space: nowrap; border: 1px solid #e6d3c4; } .score-badge { font-weight: 600; font-size: 0.85rem; color: #1e7e34; background: #e6f5ea; padding: 0.15rem 1rem; border-radius: 30px; white-space: nowrap; border: 1px solid #b8d9b8; } /* ---------- Question Card ---------- */ .question-card { background: #fffcf8; border-radius: 20px; padding: 22px 28px 28px; margin-bottom: 1.2rem; border: 1px solid #ecdccc; box-shadow: 0 4px 12px rgba(180, 110, 60, 0.06); transition: 0.2s; } .question-card:hover { border-color: #dbbca4; } .question-text { font-size: 1.05rem; font-weight: 500; line-height: 1.7; color: #1f130b; margin-bottom: 1.4rem; } .question-text .q-num { display: inline-block; background: #8b1a1a; color: #fff; font-weight: 700; font-size: 0.7rem; padding: 0.05rem 0.8rem; border-radius: 30px; margin-right: 0.6rem; vertical-align: middle; } .question-text .q-tag { display: inline-block; background: #f8ede4; color: #8b1a1a; font-size: 0.65rem; font-weight: 600; padding: 0.05rem 0.7rem; border-radius: 30px; margin-left: 0.4rem; vertical-align: middle; border: 1px solid #e6d3c4; } .question-text .q-code { display: block; background: #1c2e3a; color: #d4ecee; font-family: 'Courier New', monospace; font-size: 0.85rem; padding: 10px 14px; border-radius: 8px; margin: 8px 0 4px; white-space: pre-wrap; word-break: break-word; border-left: 3px solid #d4a017; } /* ---------- Options ---------- */ .options { display: flex; flex-direction: column; gap: 0.5rem; } .option { display: flex; align-items: flex-start; gap: 0.8rem; padding: 0.6rem 1.2rem; background: #fcf6f0; border: 1.5px solid #e6d3c4; border-radius: 14px; cursor: pointer; transition: all 0.15s ease; font-size: 0.95rem; line-height: 1.5; color: #2d1b0e; } .option:hover { border-color: #dbbca4; background: #f5e8dd; } .option.selected { border-color: #c0392b; background: #fce9e4; box-shadow: 0 0 0 2px rgba(192, 57, 43, 0.12); } .option.correct-reveal { border-color: #1e7e34; background: #e6f5ea; } .option.wrong-reveal { border-color: #b22222; background: #fce4e4; } .option input[type="radio"] { margin-top: 0.15rem; accent-color: #c0392b; width: 17px; height: 17px; flex-shrink: 0; cursor: pointer; } .option .opt-label { font-weight: 700; color: #7a4a2a; margin-right: 0.15rem; } .option .opt-text { color: #2d1b0e; } /* ---------- Feedback ---------- */ .feedback { margin-top: 1.2rem; padding: 0.8rem 1.2rem; border-radius: 12px; font-weight: 500; font-size: 0.95rem; display: none; } .feedback.correct { display: block; background: #e6f5ea; color: #0b5a2e; border-left: 5px solid #1e7e34; } .feedback.wrong { display: block; background: #fce4e4; color: #8a2a2a; border-left: 5px solid #b22222; } .feedback .correct-answer { font-weight: 600; color: #0b5a2e; } .feedback .fb-explanation { font-weight: 400; color: #3d2415; font-size: 0.9rem; margin-top: 4px; padding-top: 4px; border-top: 1px dashed #dbbca4; } /* ---------- Navigation ---------- */ .nav-area { display: flex; justify-content: space-between; align-items: center; gap: 0.7rem; flex-wrap: wrap; margin-top: 0.3rem; } .nav-area button { padding: 0.6rem 1.5rem; border: none; border-radius: 40px; font-weight: 600; font-size: 0.9rem; cursor: pointer; transition: all 0.2s; display: inline-flex; align-items: center; gap: 0.4rem; flex: 1 1 auto; justify-content: center; min-width: 70px; } .nav-area button:hover:not(:disabled) { transform: translateY(-2px); } .nav-area button:disabled { opacity: 0.4; cursor: not-allowed; transform: none; } .nav-area .btn-prev { background: #f8ede4; color: #5a3a28; border: 1.5px solid #e6d3c4; } .nav-area .btn-prev:hover:not(:disabled) { background: #f0ddd0; } .nav-area .btn-primary { background: #8b1a1a; color: #fff; } .nav-area .btn-primary:hover:not(:disabled) { background: #6a1414; } .nav-area .btn-success { background: #1e7e34; color: #fff; } .nav-area .btn-success:hover:not(:disabled) { background: #16602a; } .nav-area .btn-outline { background: transparent; border: 1.5px solid #dbbca4; color: #5a3a28; } .nav-area .btn-outline:hover:not(:disabled) { background: #f5e8dd; } /* ---------- Results ---------- */ .results { display: none; text-align: center; padding: 2rem 1rem; } .results .big-score { font-size: 4rem; font-weight: 800; color: #8b1a1a; line-height: 1.1; } .results .big-score span { font-size: 1.6rem; font-weight: 500; color: #7a5a3a; } .results .sub-text { color: #5a3a28; font-size: 1.05rem; margin: 0.5rem 0 1.6rem; } .results .stat-grid { display: flex; justify-content: center; gap: 2rem; flex-wrap: wrap; margin: 1.6rem 0; } .results .stat-item { background: #f8ede4; padding: 0.7rem 1.8rem; border-radius: 40px; font-weight: 500; color: #5a3a28; border: 1px solid #e6d3c4; } .results .stat-item .num { font-weight: 700; font-size: 1.2rem; } .results .stat-item.green .num { color: #1e7e34; } .results .stat-item.red .num { color: #b22222; } .results .stat-item.blue .num { color: #0b5e7c; } .results .btn-restart { background: #8b1a1a; color: #fff; border: none; padding: 0.75rem 2.8rem; border-radius: 40px; font-weight: 600; font-size: 1rem; cursor: pointer; transition: 0.2s; margin-top: 0.3rem; } .results .btn-restart:hover { background: #6a1414; transform: translateY(-2px); } /* ---------- Footer ---------- */ .footer { margin-top: 40px; text-align: center; color: #7a5a3a; font-size: 0.9rem; border-top: 1px solid #ecdccc; padding-top: 25px; } .footer i { color: #c0392b; } /* ---------- Responsive ---------- */ @media (max-width: 680px) { .container { padding: 18px 16px 32px; } .blog-header h1 { font-size: 1.6rem; } .question-text { font-size: 0.98rem; } .option { font-size: 0.88rem; padding: 0.5rem 0.9rem; } .nav-area button { padding: 0.45rem 0.9rem; font-size: 0.8rem; flex: 1 1 40%; } .progress-area { padding: 0.3rem 0.7rem; gap: 0.4rem; } .q-counter, .score-badge { font-size: 0.75rem; padding: 0.1rem 0.6rem; } .results .big-score { font-size: 3rem; } .results .stat-grid { gap: 0.8rem; } .results .stat-item { padding: 0.4rem 1rem; font-size: 0.85rem; } .tags span { font-size: 0.6rem; padding: 0.1rem 0.7rem; } .question-text .q-code { font-size: 0.75rem; padding: 8px 10px; } } @media (max-width: 450px) { .blog-header h1 { font-size: 1.3rem; } .container { padding: 12px 10px 24px; } .nav-area button { flex: 1 1 100%; } .option { font-size: 0.82rem; padding: 0.4rem 0.7rem; } .question-text { font-size: 0.92rem; } .question-card { padding: 16px 16px 20px; } .question-text .q-code { font-size: 0.7rem; padding: 6px 8px; } } /* ---------- Print ---------- */ @media print { .nav-area button, .btn-restart { display: none; } .option input[type="radio"] { accent-color: #1e7e34; } .feedback { display: block !important; } .progress-area { break-inside: avoid; } .container { box-shadow: none; border: 1px solid #ddd; } } /* ---------- Scrollbar ---------- */ ::-webkit-scrollbar { width: 8px; } ::-webkit-scrollbar-track { background: #f3ede7; border-radius: 10px; } ::-webkit-scrollbar-thumb { background: #c0392b; border-radius: 10px; } ::-webkit-scrollbar-thumb:hover { background: #a52a2a; } Home › Quiz › 50 MCQs Practice 50 MCQs Practice Computer Science · Aptitude · Reasoning · RPSC · REET · CET 50 Interactive MCQs · Instant Feedback 💻 CS 🧮 Aptitude 🧩 Reasoning 📐 Mathematics 1 / 50 ✅ 0 Previous Reset Next 0 / 50 Keep practicing! ✅ Correct 0 ❌ Wrong 0 ⏭ Skipped 0 Start Over 50 MCQs • RPSC · REET · CET · Patwari · SI · LDC • CS · Aptitude · Reasoning (function() { // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // DATA – 50 questions (25 CS + 25 Aptitude) // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ const questions = [{ id: 1, tag: '💻 CS', text: 'In computer architecture, Cache Memory operates on which fundamental principle?', options: [ 'Principle of Locality (Temporal & Spatial Locality)', 'Virtual Paging', 'Direct Memory Access (DMA)', 'Branch Prediction' ], answer: 0, explanation: 'Cache memory relies on the Principle of Locality — Temporal (recently used data will be used again) and Spatial (nearby data will be accessed).' }, { id: 2, tag: '💻 CS', text: 'Which OSI layer is responsible for logical IP addressing and routing packets across networks?', options: ['Data Link Layer', 'Transport Layer', 'Network Layer', 'Session Layer'], answer: 2, explanation: 'The Network Layer (Layer 3) handles logical IP addressing and routing packets across networks.' }, { id: 3, tag: '💻 CS', text: 'In SQL, which data control language (DCL) command is used to grant privileges to a database user?', options: ['`REVOKE`', '`GRANT`', '`COMMIT`', '`ALTER`'], answer: 1, explanation: '`GRANT` is the DCL command used to give privileges to database users.' }, { id: 4, tag: '💻 CS', text: 'What is the worst-case time complexity of searching in an Unbalanced Binary Search Tree (BST)?', options: ['$O(1)$', '$O(\\log n)$', '$O(n)$', '$O(n \\log n)$'], answer: 2, explanation: 'In an unbalanced BST, the tree can degenerate into a linked list, giving worst-case search complexity of $O(n)$.' }, { id: 5, tag: '💻 CS', text: 'Which C storage class variable is stored in CPU registers instead of RAM for faster access?', options: ['`auto`', '`register`', '`static`', '`extern`'], answer: 1, explanation: 'The `register` storage class suggests that the variable be stored in a CPU register for faster access.' }, { id: 6, tag: '💻 CS', text: 'In relational database design, 2NF eliminates which type of dependency?', options: ['Multivalued Dependency', 'Transitive Dependency', 'Partial Dependency', 'Join Dependency'], answer: 2, explanation: '2NF (Second Normal Form) eliminates partial dependencies — where a non-prime attribute depends on part of a candidate key.' }, { id: 7, tag: '💻 CS', text: 'Which logic gate gives output $1$ only when all inputs are $0$?', options: ['NAND', 'NOR', 'XOR', 'XNOR'], answer: 1, explanation: 'A NOR gate outputs 1 only when all inputs are 0.' }, { id: 8, tag: '💻 CS', text: 'In CPU scheduling, the "Convoy Effect" is commonly observed in which algorithm?', options: ['Round Robin', 'Shortest Job First (SJF)', 'First-Come, First-Served (FCFS)', 'Priority Scheduling' ], answer: 2, explanation: 'The Convoy Effect occurs in FCFS scheduling when short processes get stuck behind long ones.' }, { id: 9, tag: '💻 CS', text: 'What is the maximum number of nodes in a complete binary tree of height $h$ (where root height is 0)?', options: ['$2^h$', '$2^{h+1} - 1$', '$2^h - 1$', '$2^{h-1}$'], answer: 1, explanation: 'A complete binary tree of height h has maximum nodes = $2^{h+1} - 1$.' }, { id: 10, tag: '💻 CS', text: 'In Python, which operator is used for integer floor division?', options: ['`/`', '`//`', '`%`', '`**`'], answer: 1, explanation: 'The `//` operator performs floor division in Python, returning the integer part of the quotient.' }, { id: 11, tag: '💻 CS', text: 'Which IP address class is reserved for multicast addressing?', options: ['Class A', 'Class B', 'Class C', 'Class D'], answer: 3, explanation: 'Class D (224.0.0.0 to 239.255.255.255) is reserved for multicast addressing.' }, { id: 12, tag: '💻 CS', text: 'What memory management problem occurs when allocated memory blocks leave unusable small gaps between them?', options: ['Internal Fragmentation', 'External Fragmentation', 'Page Fault', 'Segmentation Fault'], answer: 1, explanation: 'External fragmentation occurs when free memory is split into small, unusable gaps between allocated blocks.' }, { id: 13, tag: '💻 CS', text: 'In Object-Oriented Programming, dynamic binding is achieved using:', options: ['Static Functions', 'Virtual Functions', 'Friend Functions', 'Inline Functions'], answer: 1, explanation: 'Virtual functions enable dynamic binding (runtime polymorphism) in OOP.' }, { id: 14, tag: '💻 CS', text: 'Which sorting algorithm is stable and uses the Divide and Conquer strategy?', options: ['Quick Sort', 'Heap Sort', 'Merge Sort', 'Selection Sort'], answer: 2, explanation: 'Merge Sort is stable and follows the Divide and Conquer paradigm.' }, { id: 15, tag: '💻 CS', text: 'In C, what is the output of `sizeof(char)`?', options: ['1', '2', '4', 'Compiler dependent'], answer: 0, explanation: 'In C, `sizeof(char)` is always 1 byte as per the C standard.' }, { id: 16, tag: '💻 CS', text: 'What is the default port for secure SSH protocol?', options: ['20', '21', '22', '80'], answer: 2, explanation: 'SSH (Secure Shell) uses port 22 by default.' }, { id: 17, tag: '💻 CS', text: 'Which data structure is naturally used to evaluate postfix arithmetic expressions?', options: ['Queue', 'Stack', 'Priority Queue', 'Tree'], answer: 1, explanation: 'Stacks are used to evaluate postfix expressions by pushing operands and applying operators.' }, { id: 18, tag: '💻 CS', text: 'In HTML, which tag is used to create a table row?', options: ['``', '``', '``', '``'], answer: 1, explanation: 'The `` tag defines a table row in HTML.' }, { id: 19, tag: '💻 CS', text: 'What is the number of bits in a standard MAC address?', options: ['32 bits', '48 bits', '64 bits', '128 bits'], answer: 1, explanation: 'A standard MAC address is 48 bits (6 bytes) in length.' }, { id: 20, tag: '💻 CS', text: 'Which scheduling policy prevents starvation by periodically increasing the priority of long-waiting processes?', options: ['Aging', 'Multilevel Queue', 'Round Robin', 'Preemption'], answer: 0, explanation: 'Aging gradually increases the priority of processes that have waited a long time to prevent starvation.' }, { id: 21, tag: '💻 CS', text: 'In SQL, which aggregate function returns the highest value in a specified column?', options: ['`HIGH()`', '`TOP()`', '`MAX()`', '`SUM()`'], answer: 2, explanation: 'The `MAX()` aggregate function returns the maximum value in a column.' }, { id: 22, tag: '💻 CS', text: 'Which flip-flop converts into a Toggle (T) flip-flop when both inputs are connected together?', options: ['SR Flip-Flop', 'JK Flip-Flop', 'D Flip-Flop', 'Master-Slave Flip-Flop'], answer: 1, explanation: 'A JK flip-flop acts as a toggle flip-flop when both inputs (J and K) are connected together (J=K=1).' }, { id: 23, tag: '💻 CS', text: 'In Boolean algebra, $A \\cdot (A + B)$ simplifies to:', options: ['$A$', '$B$', '$A \\cdot B$', '$A + B$'], answer: 0, explanation: '$A \\cdot (A + B) = A \\cdot A + A \\cdot B = A + A \\cdot B = A$ (Absorption Law).' }, { id: 24, tag: '💻 CS', text: 'In networking, what device connects two different LAN segments operating on different protocols?', options: ['Hub', 'Switch', 'Gateway', 'Repeater'], answer: 2, explanation: 'A Gateway connects networks with different protocols, translating between them.' }, { id: 25, tag: '💻 CS', text: 'What is the space complexity of Breadth-First Search (BFS) on a graph with branching factor $b$ and depth $d$?', options: ['$O(d)$', '$O(b^d)$', '$O(b \\cdot d)$', '$O(1)$'], answer: 1, explanation: 'BFS space complexity is $O(b^d)$ where $b$ is the branching factor and $d$ is the depth.' }, { id: 26, tag: '🧮 Aptitude', text: 'What is the 1\'s complement of binary number `11010`?', options: ['`00101`', '`00110`', '`11011`', '`01010`'], answer: 0, explanation: '1\'s complement flips all bits: 11010 → 00101.' }, { id: 27, tag: '🧮 Aptitude', text: 'How many subsets can be formed from a set containing 6 elements?', options: ['12', '36', '64', '128'], answer: 2, explanation: 'Number of subsets = $2^n = 2^6 = 64$.' }, { id: 28, tag: '🧮 Aptitude', text: 'If $A$ and $B$ are two sets such that $|A| = 10$, $|B| = 15$, and $|A \\cap B| = 5$, then $|A \\cup B|$ is:', options: ['20', '25', '30', '15'], answer: 0, explanation: '$|A \\cup B| = |A| + |B| - |A \\cap B| = 10 + 15 - 5 = 20$.' }, { id: 29, tag: '🧮 Aptitude', text: 'What is the sum of the first $n$ natural numbers?', options: ['$n^2$', '$\\frac{n(n+1)}{2}$', '$\\frac{n(n-1)}{2}$', '$n(n+1)$'], answer: 1, explanation: 'Sum of first n natural numbers = $\\frac{n(n+1)}{2}$.' }, { id: 30, tag: '🧮 Aptitude', text: 'Convert decimal $25$ to its binary equivalent:', options: ['$(11001)_2$', '$(10101)_2$', '$(11100)_2$', '$(10011)_2$'], answer: 0, explanation: '25 = 16 + 8 + 1 = $(11001)_2$.' }, { id: 31, tag: '🧮 Aptitude', text: 'In Boolean Logic, $A + A\' \\cdot B$ is equal to:', options: ['$A + B$', '$A \\cdot B$', '$A\'$', '$B$'], answer: 0, explanation: '$A + A\' \\cdot B = A + B$ (by Boolean algebra rules).' }, { id: 32, tag: '🧮 Aptitude', text: 'What is the value of $5!$ (5 factorial)?', options: ['60', '100', '120', '720'], answer: 2, explanation: '$5! = 5 \\times 4 \\times 3 \\times 2 \\times 1 = 120$.' }, { id: 33, tag: '🧮 Aptitude', text: 'The proposition $P \\leftrightarrow Q$ is True when:', options: [ '$P$ and $Q$ have the same truth value', '$P$ is True and $Q$ is False', '$P$ is False and $Q$ is True', 'Always True' ], answer: 0, explanation: '$P \\leftrightarrow Q$ is true when both P and Q have the same truth value (both true or both false).' }, { id: 34, tag: '🧮 Aptitude', text: 'If a card is drawn at random from a standard deck of 52 cards, what is the probability of getting an Ace?', options: ['$\\frac{1}{52}$', '$\\frac{1}{26}$', '$\\frac{1}{13}$', '$\\frac{1}{4}$'], answer: 2, explanation: 'There are 4 Aces in 52 cards, so probability = $\\frac{4}{52} = \\frac{1}{13}$.' }, { id: 35, tag: '🧮 Aptitude', text: 'Simplify $\\log_{10}(1000)$:', options: ['1', '2', '3', '4'], answer: 2, explanation: '$\\log_{10}(1000) = \\log_{10}(10^3) = 3$.' }, { id: 36, tag: '🧮 Aptitude', text: 'In a simple graph with 8 vertices, what is the maximum number of edges possible?', options: ['28', '56', '64', '16'], answer: 0, explanation: 'Maximum edges in a simple graph = $\\frac{n(n-1)}{2} = \\frac{8 \\times 7}{2} = 28$.' }, { id: 37, tag: '🧮 Aptitude', text: 'How many 2-input NOR gates are required to implement a 2-input AND gate?', options: ['2', '3', '4', '5'], answer: 1, explanation: 'A 2-input AND gate can be implemented using 3 NOR gates.' }, { id: 38, tag: '🧮 Aptitude', text: 'What is the hex equivalent of binary `11110000`?', options: ['`F0`', '`FF`', '`0F`', '`E0`'], answer: 0, explanation: '1111 = F, 0000 = 0 → `F0`.' }, { id: 39, tag: '🧮 Aptitude', text: 'A sum of money doubles itself at simple interest in 10 years. What is the annual rate of interest?', options: ['5%', '10%', '12%', '20%'], answer: 1, explanation: 'If money doubles, interest = principal. Rate = $\\frac{100}{10} = 10\\%$.' }, { id: 40, tag: '🧮 Aptitude', text: 'If 12 men can complete a work in 20 days, how many days will 15 men take to complete the same work?', options: ['14 days', '16 days', '18 days', '22 days'], answer: 1, explanation: '$M_1 \\times D_1 = M_2 \\times D_2 \\Rightarrow 12 \\times 20 = 15 \\times D_2 \\Rightarrow D_2 = 16$ days.' }, { id: 41, tag: '🧮 Aptitude', text: 'What is the value of $\\binom{6}{2}$?', options: ['12', '15', '30', '36'], answer: 1, explanation: '$\\binom{6}{2} = \\frac{6!}{2! \\times 4!} = \\frac{6 \\times 5}{2} = 15$.' }, { id: 42, tag: '🧮 Aptitude', text: 'A pipe can fill a tank in 6 hours, while another pipe can empty it in 12 hours. If both are opened together, the tank fills in:', options: ['8 hours', '10 hours', '12 hours', '18 hours'], answer: 2, explanation: 'Net fill rate = $\\frac{1}{6} - \\frac{1}{12} = \\frac{1}{12}$ → Time = 12 hours.' }, { id: 43, tag: '🧮 Aptitude', text: 'What is the base of the Hexadecimal number system?', options: ['2', '8', '10', '16'], answer: 3, explanation: 'Hexadecimal (hex) has base 16.' }, { id: 44, tag: '🧮 Aptitude', text: 'In Boolean Algebra, $A \\cdot 0 =$', options: ['$0$', '$1$', '$A$', '$A\'$'], answer: 0, explanation: '$A \\cdot 0 = 0$ (AND with 0 always gives 0).' }, { id: 45, tag: '🧮 Aptitude', text: 'What is the unit digit of $3^{40}$?', options: ['3', '9', '7', '1'], answer: 3, explanation: 'Powers of 3 cycle: 3,9,7,1. 40 is divisible by 4, so unit digit = 1.' }, { id: 46, tag: '🧮 Aptitude', text: 'In binary addition, $1 + 1$ produces:', options: [ 'Sum = 0, Carry = 0', 'Sum = 0, Carry = 1', 'Sum = 1, Carry = 0', 'Sum = 1, Carry = 1' ], answer: 1, explanation: 'Binary 1+1 = 0 with a carry of 1 (10 in binary).' }, { id: 47, tag: '🧮 Aptitude', text: 'If the ratio of two numbers is $3:4$ and their LCM is 60, what is the smaller number?', options: ['12', '15', '20', '25'], answer: 1, explanation: 'Let numbers be 3x and 4x. LCM = 12x. Given 12x = 60 → x = 5. Smaller = 3×5 = 15.' }, { id: 48, tag: '🧮 Aptitude', text: 'If $x - \\frac{1}{x} = 3$, what is $x^2 + \\frac{1}{x^2}$?', options: ['7', '9', '11', '13'], answer: 2, explanation: '$(x - \\frac{1}{x})^2 = x^2 + \\frac{1}{x^2} - 2 = 9$ → $x^2 + \\frac{1}{x^2} = 11$.' }, { id: 49, tag: '🧮 Aptitude', text: 'How many prime numbers are there between 20 and 40?', options: ['3', '4', '5', '6'], answer: 1, explanation: 'Primes between 20 and 40: 23, 29, 31, 37 → 4 primes.' }, { id: 50, tag: '🧮 Aptitude', text: 'How many bits are needed to encode 16 distinct symbols in binary?', options: ['2 bits', '3 bits', '4 bits', '8 bits'], answer: 2, explanation: 'To encode 16 symbols, $2^n \\geq 16 \\Rightarrow n = 4$ bits.' }]; // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // APP STATE // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ const state = { current: 0, answers: new Array(questions.length).fill(null), revealed: new Array(questions.length).fill(false), score: 0, finished: false }; // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // DOM REFS // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ const $ = (id) => document.getElementById(id); const questionText = $('questionText'); const optionsContainer = $('optionsContainer'); const feedback = $('feedback'); const prevBtn = $('prevBtn'); const nextBtn = $('nextBtn'); const resetBtn = $('resetBtn'); const restartBtn = $('restartBtn'); const progressFill = $('progressFill'); const qCounter = $('qCounter'); const scoreBadge = $('scoreBadge'); const questionContainer = $('questionContainer'); const resultsContainer = $('resultsContainer'); const finalScore = $('finalScore'); const finalMessage = $('finalMessage'); const correctCount = $('correctCount'); const wrongCount = $('wrongCount'); const skippedCount = $('skippedCount'); // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // RENDER // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ function render() { if (state.finished) { showResults(); return; } const q = questions[state.current]; const idx = state.current; const selected = state.answers[idx]; const revealed = state.revealed[idx]; // Question text with tag const tagEmoji = q.tag || '📝'; questionText.innerHTML = ` Q${idx+1} ${tagEmoji} ${q.text.replace(/\n/g, '')} `; // Options optionsContainer.innerHTML = ''; const labels = ['A', 'B', 'C', 'D']; q.options.forEach((opt, i) => { const div = document.createElement('div'); div.className = 'option'; if (selected === i) div.classList.add('selected'); if (revealed) { if (i === q.answer) div.classList.add('correct-reveal'); else if (selected === i && selected !== q.answer) div.classList.add('wrong-reveal'); } const radio = document.createElement('input'); radio.type = 'radio'; radio.name = 'question'; radio.value = i; radio.checked = (selected === i); radio.disabled = revealed; radio.addEventListener('change', () => selectOption(i)); const labelSpan = document.createElement('span'); labelSpan.className = 'opt-label'; labelSpan.textContent = labels[i] + '.'; const textSpan = document.createElement('span'); textSpan.className = 'opt-text'; textSpan.textContent = opt; div.appendChild(radio); div.appendChild(labelSpan); div.appendChild(textSpan); optionsContainer.appendChild(div); }); // Feedback if (revealed) { const isCorrect = (selected === q.answer); feedback.className = `feedback ${isCorrect ? 'correct' : 'wrong'}`; const expl = q.explanation ? `💡 ${q.explanation}` : ''; feedback.innerHTML = isCorrect ? '✅ Correct!' + expl : `❌ Wrong. Correct answer: ${labels[q.answer]}. ${q.options[q.answer]}${expl}`; feedback.style.display = 'block'; } else { feedback.style.display = 'none'; } // Progress const total = questions.length; const answered = state.answers.filter(a => a !== null).length; progressFill.style.width = `${(answered / total) * 100}%`; qCounter.textContent = `${idx+1} / ${total}`; // Score const correct = state.answers.reduce((acc, ans, i) => { return acc + (ans !== null && ans === questions[i].answer ? 1 : 0); }, 0); state.score = correct; scoreBadge.textContent = `✅ ${correct}`; // Buttons prevBtn.disabled = (idx === 0); const isLast = (idx === total - 1); nextBtn.innerHTML = isLast ? '📊 Finish' : 'Next '; nextBtn.className = isLast ? 'btn-success' : 'btn-primary'; // Scroll to top of card document.querySelector('.question-card').scrollIntoView({ behavior: 'smooth', block: 'nearest' }); } // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // ACTIONS // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ function selectOption(index) { if (state.finished) return; const idx = state.current; if (state.revealed[idx]) return; state.answers[idx] = index; render(); } function goPrev() { if (state.current > 0) { state.current--; render(); } } function goNext() { const idx = state.current; const total = questions.length; // If not revealed, auto-reveal if (!state.revealed[idx] && state.answers[idx] !== null) { state.revealed[idx] = true; render(); return; } // If at last and answered, finish if (idx === total - 1) { if (state.answers[idx] !== null && !state.revealed[idx]) { state.revealed[idx] = true; render(); return; } finishQuiz(); return; } // Move to next if (idx < total - 1) { state.current++; render(); } } function finishQuiz() { for (let i = 0; i < questions.length; i++) { if (state.answers[i] !== null && !state.revealed[i]) { state.revealed[i] = true; } } state.finished = true; render(); } function showResults() { questionContainer.style.display = 'none'; resultsContainer.style.display = 'block'; const total = questions.length; const correct = state.answers.reduce((acc, ans, i) => { return acc + (ans !== null && ans === questions[i].answer ? 1 : 0); }, 0); const wrong = state.answers.reduce((acc, ans, i) => { return acc + (ans !== null && ans !== questions[i].answer ? 1 : 0); }, 0); const skipped = total - correct - wrong; finalScore.innerHTML = `${correct} / ${total}`; correctCount.textContent = correct; wrongCount.textContent = wrong; skippedCount.textContent = skipped; const pct = Math.round((correct / total) * 100); let msg = ''; if (pct >= 90) msg = '🏆 Excellent! You\'re a quiz master!'; else if (pct >= 70) msg = '🌟 Great job! Keep learning!'; else if (pct >= 50) msg = '📖 Good effort! Review the topics you missed.'; else msg = '💪 Keep practicing — you\'ll get better!'; finalMessage.textContent = msg; progressFill.style.width = '100%'; qCounter.textContent = `${total} / ${total}`; scoreBadge.textContent = `✅ ${correct}`; } function resetQuiz() { state.current = 0; state.answers.fill(null); state.revealed.fill(false); state.finished = false; state.score = 0; questionContainer.style.display = 'block'; resultsContainer.style.display = 'none'; render(); } // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // EVENT BINDING // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ prevBtn.addEventListener('click', goPrev); nextBtn.addEventListener('click', goNext); resetBtn.addEventListener('click', resetQuiz); restartBtn.addEventListener('click', resetQuiz); // Keyboard shortcuts document.addEventListener('keydown', (e) => { if (e.target.tagName === 'INPUT') return; if (e.key === 'ArrowRight' || e.key === 'Enter') { e.preventDefault(); if (!state.finished) goNext(); } if (e.key === 'ArrowLeft') { e.preventDefault(); if (!state.finished) goPrev(); } if (e.key === 'r' || e.key === 'R') { resetQuiz(); } }); // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ // INIT // ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ render(); })();

You might also like