Computer Science MCQs Test are here. All the Computer Science MCQs Test have been taken from the past papers which are the most repeated and the most important Computer Science MCQs Test. Let us prepare Computer Science MCQs Test or click here for more.

Computer Science MCQs Test

1. If f(x, y) is a digital image, then x, y and amplitude values of f are Finite
2. Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored): Process            A B C D  Arrival time     0 123   CPU cycle       8 495. The average turnaround time of these processes will be 18.25 milliseconds
3. A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are 9 and 8
4. Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct? T1 < T2
5. Working set model is used in memory management to implement the concept of Principal of Locality
6. A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? 16 GB
7. A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? OS maintains only CPU registers for each thread
8. The versions of windows operating system like windows XP and window Vista uses following file system: (A) FAT-16 (B) FAT-32 (C) NTFS (NT File System) (D) All of the above
9. Which one of the following is a correct implementation of the meta-predicate “not” in PROLOG (Here G represents a goal)? not (G):– call(G), !, fail. not(G).
10. Which one of the following is not an informed search technique? Depth first search
11. If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as Skolemization
12. Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be 7
13. The map colouring problem can be solved using which of the following technique? Constraint satisfaction
14. Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? Scripts (Solved MCQs of Computer Science)
15. A fuzzy set A on R is ________ if A (λx₁ + (1 – λ) x₂) ≥ min [A(x₁), A(x₂)] for all x₁, x₂ ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. Convex
16. Which of the following is a correct predicate logic statement for “Every Natural number has one successor”? ∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
17. α – β cutoffs are applied to Minimax search
18. Which of the following is not a part of an expert system shell? Knowledge Base
19. The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Planning system
20. Means-Ends Analysis process centres on the detection of difference between the current state and the goal state. Once such a difference is found, and then to reduce the difference one applies An operator that can reduce the difference
21. Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is 0.2 second
22. Which of the following is the size of Network bits and Host bits of Class Aof IP address? Network bits 7, Host bits 24
23. Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged? Window size
24. Which of the following is a bit rate of an 8-PSK signal having 2500 Hz bandwidth? 7500 bps
25. Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address? 201.14.78.64
26. If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Infeasible solution
27. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of Rows or columns
28. Assume, L is regular language. Let statements S₁ and S₂ are defined as: S₁: SQRT (L) = {x| for some y with |y| = |x|², xy∈L}. S₂: LOG (L) = {x| for some y with |y| = 2^|x|, xy∈ L}. Which of the following is true? Both S₁ and S₂ are correct.
29. A regular grammar for the language L = {aⁿb^m | n is even and m is even} is given by S→aaS | S₁; S₁ → bbS₁ | λ
30. The language L = {aⁿ bⁿ a^m b^m | n ≥ 0, m ≥ 0} is Context fr-ee but not linear
31. Assume statements S₁ and S₂ defined as: S₁: L₂-L₁ is recursive enumerable where L₁ and L₂ are recursive and recursive enumerable respectively. S₂: The set of all Turing machines is countable. Which of the following is true? Both S₁ and S₂ are correct
32. _______ constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation. Referential Integrity
33. The SQL expression, Select distinct T, branch_name from branch T, branch S where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of All branches that have greater assets than some branch located in Mumbai.
34. Let A be the set of comfortable houses given as A = {x₁/0.8, x₂/0.9, x₃/0.1, x₄/0.7} and B be the set of affordable houses B = {x₁/0.9, x₂/0.8, x₃/0.6, x₄/0.2} Then the set of comfortable and affordable houses is {x₁/0.8, x₂/0.8, x₃/0.1, x₄/0.2} (Solved MCQs of Computer Science)
35. Support of a fuzzy set A = { x₁/0.2, x₂/0.15, x₃/0.9, x₄/0.95, x₅/0.15} within a universal set X is given as {x₁, x₂, x₃, x₄, x₅} (Computer Science MCQs Test)
36. In a single perceptron, the updation rule of weight vector is given by w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
37. ______ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values. Error
38. Which logic family dissipates the minimum power? CMOS
39. Which of the following electronic component is not found in IC’s? Inductor
40. A given memory chip has 14 address pins and 8 data pins. It has the following number of locations. 2¹⁴
41. The instruction: MOV CL, [BX] [DI] + 8 represent the _____ addressing mode. Based Indexed
42. The power dissipation of a flip-flop is 3mW. The power dissipation of a digital system with 4 flip-flops is given by 12 mW
43. A binary ripple counter is required to count up to 16383. How many flip-flops are required? 14
44. The time complexity of recurrence relation T(n) = T(n/3) + T(2n/3) + O(n) is O(n Ig n)
45. How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year? At least 23
46. The number of possible parenthesizations of a sequence of n matrices is Ω(2ⁿ)
47. The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is O(n Ig n)
48. Given 0-1 knapsack problem and fractional knapsack problem and the following statements: S₁: 0-1 knapsack is efficiently solved using Greedy algorithm. S₂: Fractional knapsack is efficiently solved using Dynamic programming. Which of the following is true? Both S₁ and S₂ are not correct.
49. Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so that if a program works correctly for a value, then it will work correctly for all the other values in that class. This is used To reduce the number of test cases required
50. The failure intensity for a basic model as a function of failures experienced is given as λ(μ)-λ₀[1 – (μ)/(V₀)] where λ₀ is the initial failure intensity at the start of the execution, μ is the average or expected number of failures at a given point in time, the quantity V₀ is the total number of failures that would occur in infinite time. Assume that a program will experience 100 failures in infinite time; the initial failure intensity was 10 failures/CPU hr. Then the decrement of failures intensity per failure will be –0.1 per CPU hr.
51. Improving processing efficiency or performance or restructuring of software to improve changeability is known as Perfective maintenance
52. In ____, modules A and B make use of a common data type, but perhaps perform different operations on it. Stamp coupling
53. Sixty (60) reusable components were available for an application. If only 70% of these components can be used, rest 30% would have to be developed from scratch. If average component is 100 LOC and cost of each LOC is Rs. 14, what will be the risk exposure if risk probability is 80%? Rs. 20,160
54. Consider the following two function declarations: (i) int *f( ) (ii) int (*f)( ) Which of the following is true? The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning integer. (Solved MCQs of Computer Science)
55. Assume that we have constructor function for both Base and Derived classes. Now consider the declaration: main ( )            Base *p = new Derived;         In what sequence, the constructor will be executed? Base class constructor is followed by Derived class constructor
56. MPEG involves both spatial compression and temporal compression. The spatial compression is similar to JPEG and temporal compression removes ______ frames. Redundant
57. If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division? 111111000
58. If user A wants to send an encrypted message to user B. The plain text of A is encrypted with the Public Key of user B
59. A _____ can forward or block packets based on the information in the network layer and transport layer header. Proxy firewall
60. The two color systems – the HSV and HLS are Hue, Saturation, Value and Hue, Lightness, Saturation
61. The parametric representation of the line segment between the position vectors P₁(2, 3) and P₂(5, 4) is given as x (t)= 2+3t, y(t)=3+t 0 ≤ t ≤ 1
62. The programming languages C and C++ are not strongly typed languages because: Both C and C++ allow functions for which parameters are not type checked and also the union types in these languages are not type checked.
63. The tracing model in Prolog describes program execution in terms of certain events. These events are Call, exit, redo and fail
64. Which of the following statements is not correct with reference to distributed systems? In a distributed system, if a user wants to run the program on other nodes or share the resources on remote sites due to their beneficial aspects, user has to log on to that site.
65. Which of the following shell scripts will produce the output “my first script”? For i in my first script; do echo –i $i; done
66. The portion of Windows 2000 operating system which is not portable is Virtual memory management
67. Which of the following statements is not true for UNIX Operating System? UNIX kernel uses modules with well specified interfaces and provides advantages like simplified testing and maintenance of kernel. It has better extensibility as the kernel is not monolithic.
68. The first home computer in 1977 sold in millions of units, was Apple II.
69. ‘PARAM’ is a supercomputer.
70. Father of the Computer is called Charles Babbage.
71. The worst case time complexity of AVL tree is better in comparison to binary search tree for Search and Insert Operations
72. The GSM network is divided into the following three major systems: BSS, BSC, MSC
73. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disks queue of I/O blocks requests are 98, 37, 14, 124, 65, 67. 310
74. Component level design is concerned with Flow oriented analysis
75. The Mobile Application Protocol (MAP) typically runs on top of which protocol? HTTP (Hyper Text Transfer Protocol)
76. If a packet arrives with an M-bit value is ‘l’ and a fragmentation offset value ‘0’, and then it is ______ fragment. (A) First (B) Middle (C) Last (D) All of the above
77. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be 160.
78. In compiler design ‘reducing the strength’ refers to Reducing efficiency of program.
79. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register? Indirect
80. Which of the following is true? A relation in 3NF is always in BCNF.
81. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed? 200 K