UGC NET Computer Science - 50 MCQs

UGC NET Computer Science · 50 MCQs * { box-sizing: border-box; margin: 0; padding: 0; } body { background: #f4f7fc; font-family: 'Segoe UI', Roboto, system-ui, sans-serif; padding: 2rem 1.5rem; color: #1e293b; } .container { max-width: 1100px; margin: 0 auto; background: white; border-radius: 32px; padding: 2rem 2rem 3rem; box-shadow: 0 20px 40px -12px rgba(0,0,0,0.15); } h1 { font-size: 2.2rem; font-weight: 600; letter-spacing: -0.02em; border-left: 6px solid #2563eb; padding-left: 1.2rem; margin-bottom: 0.5rem; color: #0b1e3a; } .subhead { color: #475569; margin-left: 1.8rem; margin-bottom: 2.5rem; font-size: 1.05rem; border-bottom: 1px solid #e2e8f0; padding-bottom: 0.75rem; display: flex; justify-content: space-between; flex-wrap: wrap; gap: 0.5rem; } .subhead span { background: #eef2ff; padding: 0.2rem 1.2rem; border-radius: 30px; font-weight: 500; color: #2563eb; } .question-card { background: #ffffff; border-radius: 20px; padding: 1.5rem 1.8rem; margin-bottom: 1.5rem; box-shadow: 0 4px 12px rgba(0,0,0,0.03); border: 1px solid #eef2f6; transition: border-color 0.15s; } .question-card:hover { border-color: #b9d0f0; } .q-header { display: flex; align-items: baseline; gap: 0.75rem; margin-bottom: 0.75rem; } .q-number { font-weight: 700; background: #dbeafe; color: #1e4f8a; padding: 0.2rem 0.8rem; border-radius: 30px; font-size: 0.85rem; letter-spacing: 0.3px; } .q-text { font-size: 1.1rem; font-weight: 500; line-height: 1.5; color: #0b1e3a; } .options-grid { display: grid; grid-template-columns: repeat(auto-fit, minmax(200px, 1fr)); gap: 0.6rem 1.2rem; margin: 1rem 0 0.3rem; } .opt-label { display: flex; align-items: center; gap: 10px; background: #f8fafc; padding: 0.6rem 1rem 0.6rem 1.2rem; border-radius: 40px; border: 1px solid #e9edf3; cursor: pointer; transition: 0.1s ease; font-size: 0.98rem; } .opt-label:hover { background: #eff6ff; border-color: #94b9f0; } .opt-label input[type="radio"] { accent-color: #2563eb; width: 17px; height: 17px; flex-shrink: 0; margin: 0; } .opt-label .opt-letter { font-weight: 600; color: #3b5f8a; min-width: 18px; } .action-bar { display: flex; flex-wrap: wrap; justify-content: space-between; align-items: center; margin-top: 2.5rem; gap: 1rem; } .btn-group { display: flex; gap: 0.8rem; flex-wrap: wrap; } .btn { background: white; border: 1px solid #cbd5e1; padding: 0.6rem 1.6rem; border-radius: 60px; font-weight: 500; font-size: 0.95rem; color: #1e293b; cursor: pointer; transition: 0.15s; box-shadow: 0 2px 4px rgba(0,0,0,0.02); } .btn-primary { background: #2563eb; border: 1px solid #2563eb; color: white; box-shadow: 0 6px 12px -8px #2563eb60; } .btn-primary:hover { background: #1d4ed8; transform: scale(0.97); } .btn-outline { background: transparent; border: 1px solid #cbd5e1; } .btn-outline:hover { background: #f1f5f9; } .btn-success { background: #0b8b4a; border-color: #0b8b4a; color: white; } .btn-success:hover { background: #0a733d; } .stats { background: #f1f5f9; padding: 0.4rem 1.4rem; border-radius: 60px; font-size: 0.95rem; font-weight: 500; display: inline-flex; align-items: center; gap: 0.8rem; } .stats strong { color: #0b1e3a; font-weight: 700; } .footer-note { margin-top: 2rem; text-align: right; font-size: 0.9rem; color: #64748b; border-top: 1px solid #e9edf3; padding-top: 1.5rem; } .correct-badge { display: inline-block; background: #dcfce7; color: #0b5e2e; font-weight: 600; padding: 0.2rem 1rem; border-radius: 40px; font-size: 0.8rem; margin-left: 0.8rem; } .highlight-correct .opt-label.correct-selected { background: #dcfce7; border-color: #2b8f4e; font-weight: 500; } .highlight-correct .opt-label.wrong-selected { background: #fee2e2; border-color: #b91c1c; } @media (max-width: 650px) { body { padding: 1rem 0.8rem; } .container { padding: 1.2rem; } .options-grid { grid-template-columns: 1fr; } .q-text { font-size: 1rem; } .action-bar { flex-direction: column; align-items: stretch; } .btn-group { justify-content: center; } } 📘 Computer Science · UGC NET June 2012 Paper-II 50 questions · MCQ ✅ Submit & check ↺ Reset answers 📊 0 / 50 correct ⏳ not attempted * Click "Submit & check" to reveal correct answers. Red = wrong, Green = correct. (function() { // ------------- raw data from the provided 50 MCQ ----------------- const questions = [ { q: "The postfix expression AB + CD–* can be evaluated using a", options: ["Stack", "Tree", "Queue", "Linked list"], correct: 0 }, { q: "The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.", options: ["ABFCDE", "ADBFEC", "ABDECF", "None of the above"], correct: 2 }, { q: "The branch logic that provides making capabilities in the control unit is known as", options: ["Controlled transfer", "Conditional transfer", "Unconditional transfer", "None of the above"], correct: 0 }, { q: "The number of colours required to properly colour the vertices of every planer graph is", options: ["2", "3", "4", "5"], correct: 2 }, { q: "Networks that use different technologies can be connected by using", options: ["Packets", "Switches", "Bridges", "Routers"], correct: 3 }, { q: "Both hosts and routers are TCP/IP protocol software. However, routers do not use protocol from all layers. The layer for which protocol software is not needed by a router is", options: ["Layer–5 (Application)", "Layer–1 (Physical)", "Layer–3 (Internet)", "Layer–2 (Network Interface)"], correct: 0 }, { q: "In multiuser database if two users wish to update the same record at the same time, they are prevented from doing so by", options: ["Jamming", "Password", "Documentation", "Record lock"], correct: 3 }, { q: "A binary search tree is a binary tree", options: ["All items in the left subtree are less than root", "All items in the right subtree are greater than or equal to the root", "Each subtree is itself a binary search tree", "All of the above"], correct: 3 }, { q: "What deletes the entire file except the file structure?", options: ["ERASE", "DELETE", "ZAP", "PACK"], correct: 2 }, { q: "Which command is the fastest among the following?", options: ["COPY TO ", "COPY STRUCTURE TO ", "COPY FILE ", "COPY TO MFILE-DAT DELIMITED"], correct: 1 }, { q: "B + tree are preferred to binary tree in Database because", options: ["Disk capacity are greater than memory capacities", "Disk access is much slower than memory access", "Disk data transfer rates are much less than memory data transfer rate", "Disks are more reliable than memory"], correct: 1 }, { q: "A Transaction Manager is which of the following?", options: ["Maintains a log of transactions", "Maintains before and after database images", "Maintains appropriate concurrency control", "All of the above"], correct: 3 }, { q: "Leaves of which of the following trees are at the same level?", options: ["Binary tree", "B–tree", "AVL–tree", "Expression tree"], correct: 1 }, { q: "Which of the following TCP/IP Internet protocol is diskless machine uses to obtain its IP address from a server?", options: ["RAP", "RIP", "ARP", "X.25"], correct: 2 }, { q: "Decryption and encryption of data are the responsibility of which of the following layer?", options: ["Physical layer", "Data Link layer", "Presentation layer", "Session layer"], correct: 2 }, { q: "In which circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM?", options: ["Space division", "Time division", "Virtual", "packet"], correct: 1 }, { q: "In which Routing Method do all the routers have a common database?", options: ["Distance vector", "Link state", "Link vector", "Dijkestra method"], correct: 1 }, { q: "Page Shift Keying (PSK) Method is used to modulate digital signal at 9600 bps using 16 level. Find the line signals and speed (i.e. Modulation rate).", options: ["2400 bauds", "1200 bauds", "4800 bauds", "9600 bauds"], correct: 0 }, { q: "The station to hub distance in which it is 2000 metres.", options: ["100 Base-Tx", "100 Base-Fx", "100 Base-T4", "100 Base-T1"], correct: 1 }, { q: "Main aim of software engineering is to produce", options: ["Program", "Software", "Within budget", "Software within budget in the given schedule"], correct: 3 }, { q: "Key process areas of CMM level 4 are also classified by a process which is", options: ["CMM level 2", "CMM level 3", "CMM level 5", "All of the above"], correct: 2 }, { q: "Validation means", options: ["Are we building the product right", "Are we building the right product", "Verification of fields", "None of the above"], correct: 1 }, { q: "If a process is under statistical control, then it is", options: ["Maintainable", "Measurable", "Predictable", "Verifiable"], correct: 2 }, { q: "In a function oriented design, we", options: ["Minimize cohesion and maximize coupling", "Maximize cohesion and minimize coupling", "Maximize cohesion and maximize coupling", "Minimize cohesion and minimize coupling"], correct: 1 }, { q: "Which of the following metric does not depend on the programming language used?", options: ["Line of code", "Function count", "Member of token", "All of the above"], correct: 1 }, { q: "A/B + tree index is to be built on the name attribute of the relation STUDENT, Assume that all students names are of length 8 bytes, disk block are of size 512 bytes and index pointers are of size 4 bytes. Given this scenario what would be the best choice of the degree (i.e. number of pointers per node) of the B + tree?", options: ["16", "42", "43", "44"], correct: 2 }, { q: "The In order traversal of the tree will yield a sorted listing of elements of tree in", options: ["Binary tree", "Binary search tree", "Heaps", "None of the above"], correct: 1 }, { q: "Mobile IP provides two basic functions", options: ["Route discovery and registration", "Agent discovery and registration", "IP binding and registration", "None of the above"], correct: 1 }, { q: "Pre-emptive scheduling is the strategy of temporarily suspending a gunning process", options: ["Before the CPU time slice expires", "To allow starving processes to run", "When it requests I/O", "To avoid collision"], correct: 0 }, { q: "In round robin CPU scheduling as time quantum is increased the average turn around time", options: ["Increases", "Decreases", "Remains constant", "Varies irregularly"], correct: 3 }, { q: "Resources are allocation to the process nonshare below basis is :", options: ["Mutual exclusion", "Hold and wait", "No pre-emption", "Circular wait"], correct: 0 }, { q: "Catch on and interleaved memories are ways of speeding up memory access between CPU and slower RAM. Which memory models are best suited (i.e. Improves the performance mostly which program) (1) Cached memory is best suited for small loops. (2) Interleaved memory is best suited for small loops (3) Interleaved memory is best suited for large sequential code. (4) Cached memory is best suited for large sequential code.", options: ["1 and 2 are true", "1 and 3 are true", "4 and 2 are true", "4 and 3 are true"], correct: 1 }, { q: "Consider the following page trace : 4, 3, 2, 1, 4, 3, 2, 1, 5 Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frame for JOB m = 4 will be :", options: ["8", "9", "10", "12"], correct: 2 }, { q: "Check sum used along with each packet computes the sum of the data, where data is treated as a sequence of", options: ["Integer", "Character", "Real numbers", "Bits"], correct: 1 }, { q: "If an integer needs two bytes of storage, then the maximum value of a signed integer is", options: ["216 – 1", "215 – 1", "216", "215"], correct: 1 }, { q: "Which of the following logic families is well suited for high-speed operations?", options: ["TTI", "ECL", "MOS", "CMOS"], correct: 1 }, { q: "Interrupts which are initiated by an instruction are", options: ["Internal", "External", "Hardware", "Software"], correct: 2 }, { q: "printf('%c' 100)", options: ["Prints 100", "Prints ASCII equivalent of 100", "Prints garbage", "None of the above"], correct: 1 }, { q: "For the transmission of the signal, Bluetooth wireless technology uses", options: ["Time division multiplexing", "Frequency division multiplexing", "Time division duplex", "Frequency division duplex"], correct: 2 }, { q: "Consider the following statements a. Recursive languages are closed under complementation. b. Recursively enumerable languages are closed under union. c. Recursively enumerable languages are closed under complementation. Which of the above statements are true?", options: ["1 only", "1 and 2", "1 and 3", "2 and 3"], correct: 1 }, { q: "What is the routing algorithm used by RIP and IGRP?", options: ["OSPF", "Link-state", "Dynamic", "Dijkstra vector"], correct: 3 }, { q: "Identify the incorrect statement", options: ["The overall strategy drives the E-Commerce data warehousing strategy.", "Data warehousing in an E-Commerce environment should be done in a classical manner.", "E-Commerce opens up an entirely new world of web server.", "E-Commerce security threats can be grouped into three major categories."], correct: 3 }, { q: "Reliability of software is directly dependent on", options: ["Quality of the design", "Number of errors present", "Software engineers experience", "User requirement"], correct: 1 }, { q: "..................... is not an E-Commerce application.", options: ["House banking", "Buying stocks", "Conducting an auction", "Evaluating an employee"], correct: 3 }, { q: ".................... is a satellite based tracking system that enables the determination of person's position.", options: ["Bluetooth", "WAP", "Short Message Service", "Global Positioning System"], correct: 3 }, { q: "A complete microcomputer system consists of", options: ["Microprocessor", "Memory", "Peripheral equipment", "All of the above"], correct: 3 }, { q: "Where does a computer add and compare data?", options: ["Hard disk", "Floppy disk", "CUP chip", "Memory chip"], correct: 2 }, { q: "Pipelining strategy is called implement", options: ["Instruction execution", "Instruction prefetch", "Instruction decoding", "Instruction manipulation"], correct: 1 }, { q: "Which of the following data structure is linear type?", options: ["Strings", "Lists", "Queues", "All of the above"], correct: 3 }, { q: "To represent hierarchical relationship between elements, which data structure is suitable?", options: ["Dequeue", "Priority", "Tree", "All of the above"], correct: 2 } ]; // ---------- render ---------- const container = document.getElementById('questionList'); let selectedAnswers = new Array(questions.length).fill(null); function renderQuestions() { let html = ''; questions.forEach((item, idx) => { const letters = ['a', 'b', 'c', 'd']; const optHtml = item.options.map((opt, oi) => { const letter = letters[oi]; return ` ${letter}. ${opt} `; }).join(''); html += ` Q${idx+1} ${item.q} ${optHtml} `; }); container.innerHTML = html; // attach change listeners document.querySelectorAll('.opt-label input[type="radio"]').forEach(radio => { radio.addEventListener('change', function(e) { const card = this.closest('.question-card'); const idx = parseInt(card.id.split('-')[1]); const val = parseInt(this.value); selectedAnswers[idx] = val; updateStats(); }); }); updateStats(); } // -------- score & stats -------- function updateStats() { const answered = selectedAnswers.filter(a => a !== null).length; document.getElementById('scoreCount').textContent = '?'; document.getElementById('attemptStatus').textContent = `📝 ${answered}/${questions.length} answered`; } function computeScore() { let correct = 0; questions.forEach((q, idx) => { if (selectedAnswers[idx] === q.correct) correct++; }); return correct; } // -------- submit (show correct) -------- function submitAndShow() { // remove old highlights document.querySelectorAll('.question-card').forEach(c => { c.classList.remove('highlight-correct'); c.querySelectorAll('.opt-label').forEach(lbl => { lbl.classList.remove('correct-selected', 'wrong-selected'); }); }); let correctCount = 0; questions.forEach((q, idx) => { const card = document.getElementById(`card-${idx}`); if (!card) return; const chosen = selectedAnswers[idx]; const labels = card.querySelectorAll('.opt-label'); labels.forEach((lbl, oi) => { lbl.classList.remove('correct-selected', 'wrong-selected'); if (oi === q.correct) { lbl.classList.add('correct-selected'); } else if (oi === chosen && chosen !== q.correct) { lbl.classList.add('wrong-selected'); } }); if (chosen === q.correct) correctCount++; card.classList.add('highlight-correct'); }); document.getElementById('scoreCount').textContent = correctCount; document.getElementById('attemptStatus').textContent = `✅ ${correctCount}/50 correct`; } // -------- reset -------- function resetAll() { selectedAnswers.fill(null); document.querySelectorAll('input[type="radio"]').forEach(r => r.checked = false); document.querySelectorAll('.question-card').forEach(c => { c.classList.remove('highlight-correct'); c.querySelectorAll('.opt-label').forEach(lbl => { lbl.classList.remove('correct-selected', 'wrong-selected'); }); }); document.getElementById('scoreCount').textContent = '0'; document.getElementById('attemptStatus').textContent = '⏳ not attempted'; updateStats(); } // -------- init -------- renderQuestions(); document.getElementById('submitBtn').addEventListener('click', submitAndShow); document.getElementById('resetBtn').addEventListener('click', resetAll); // initial stats updateStats(); })();

📘 Computer Science · UGC NET

You might also like