##### Computer MCQs Test

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

## Computer MCQs Test

- In IPv4 header, the ______ field is needed to allow the destination host to determine which datagram a newly arrived fragment belongs to.
**Identification** - Given L1=L (a*baa*) and L2=L (ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
**a*ba*** - Given the production rules of a grammar G1 as S
_{1}→ AB | aaB, A → a | Aa, B → b and the production rules of a grammar G2 as, S_{2}→ aS_{2}bS_{2}| bS_{2}aS_{2}| λ. Which of the following is correct statement?**G1 is ambiguous and G2 is ambiguous.** - Given a grammar: S1 → Sc, S → SA | A, A → aSb | ab, there is a rightmost derivation S1 ⇒ Sc ⇒SAC ⇒ SaSbc. Thus, SaSbc is a right sentential form, and its handle is
**aSb** - The equivalent production rules corresponding to the production rules S → Sα
_{1}|Sα_{2}| β_{1}| β_{2}is**S → β**_{1}| β_{2}| β_{1}A | β_{2}A, A → α_{1}A | α_{2}A | λ - Which is the correct statement(s) for Non-Recursive predictive parser? S1: First (α) = {t| α ⇒ * tβ for some string β} ⇒*tβ, S2: Follow(X) = {a| S⇒ *αXaβ for some strings α and β}
**Both statements S1 and S2 are correct.** - Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is
**Atmost (1/α) ln 1/(1– α)** - For a B-tree of height h and degree t, the total CPU time used to insert a node is
**O(th)** - The time complexity to build a heap with a list of n numbers is
**O(n)** - The value of postfix expression: 8 3 4 + – 3 8 2 / + * 2 $ 3 + is
**52** - Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as
**Data warehousing** - The task of correcting and pre-processing data is called as
**Data cleaning** - Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE
**BUTAEEZ** - The relation “divides” on a set of positive integers is
**Anti symmetric and transitive (Solved MCQs of Computer Science)** - Give as good a big–O estimate as possible for the following functions: (nlogn+n
^{2}) (n^{3}+2) and (n! +2^{n}) (n^{3}+log(n^{2}+1))**O(n**^{5}) & O(n^{3}* n!) - A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also?
**3**^{100} - How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?
**M–N+C** - Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?
**(p ∧ q ∧⎤ r) ∨ ( p ∧⎤ q ∧ r) ∨ (⎤ p ∧ q ∧ r)** - The truth value of the statements: ∃!xP(x) → ∃xP(x) and ∃!x⎤ P(x) → ⎤∀xP(x), (where the notation ∃!xP(x) denotes the proposition “There exists a unique x such that P(x) is true”) are:
**True and True** - How many different Boolean functions of degree 4 are there?
**2**^{16} - A Boolean operator s is defined as follows: 1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0 s 0 = 1. What will be the truth value of the expression (x s y) s z = x s (y s z)?
**Always true** - Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?
**– 22** - A set of processors P1, P2….… Pk can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is P1 || P2 || P3 || ….. || Pk if and only if:
**Pi || Pj for all i ≠ j** - When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as
**Handoff** - A virtual memory based memory management algorithm partially swaps out a process. This is an example of
**Medium term scheduling** - Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67:
**321** - Let the page fault service time be 10 millisecond (ms) in a computer with average memory access time being 20 nanosecond (ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory?
**30 ns** - Consider the following UNIX command: Sort <in> temp; head – 30 <temp; rm temp which of the following functions shall be performed by this command?
**Sort, taking the input from “in” and writing the output to “temp” then prints 30 lines from temp on terminal. Finally “temp” is removed.** - The MV command changes
**The directory entry** - A file is downloaded in a home computer using a 56 kbps MODEM connected to an Internet Service Provider. If the download of file completes in 2 minutes, what is the maximum size of data downloaded?
**6.72 Mbs** - ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generator.
**p-persistent** - Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many?
**Polyalphabetic** - What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?
**100 meters** - The ______ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result should be used.
**Common Gateway Interface (Solved MCQs of Computer Science)** - The count-to-infinity problem is associated with
**Distance vector routing algorithm** - The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ______ and ______ respectively.
**32 bits and 64 bits** - Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is
**4851** - The amortized time complexity to perform ______ operation(s) in Splay trees is O(Ig n).
**Search, Insert and Delete** - Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0 < β ≤ 0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately
**– (Ig n)/Ig (1 – β)** - The minimum number of nodes in a binary tree of depth d (root is at level 0) is
**d + 1** - The efficient data structure to insert/delete a number in a stored set of numbers is
**Doubly linked list** - The number of states in a minimal deterministic finite automaton corresponding to the language L = { a
^{n}| n≥4 } is**5** - Regular expression for the language L = {w ∈ {0, 1}* | w has no pair of consecutive zeros} is
**(1 + 01)* (0 + λ)** - Consider the following two languages: L
_{1}= {a^{n}b^{l}a^{k}| n + l +k>5} L_{2}= {a^{n}b^{l}a^{k}|n>5, l >3, k≤ l} Which of the following is true?**L**_{1}is regular language and L_{2}is not regular language. - LL grammar for the language L = {a
^{n}b^{m}c^{n+m}| m≥0, n≥0} is**S → aSc | S**_{1}| λ; S_{1}→ bS_{1}c| λ - The number of eight-bit strings beginning with either 111 or 101 is
**64**(Computer MCQs On-line Test) - Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.
**1, 66,320** - Consider the In-order and Post-order traversals of a tree as given below: In-order: j e n k o p b f a c l g m d h i Post-order: j n o p k e f b c l m g h i d a. The Pre-order traversal of the tree shall be
**a b e j k n o p f c d g l m h i** - A simple graph G with n-vertices is connected if the graph has
**More than (n – 1) (n – 2)/2 edges** - Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?
**EX-OR, EX-NOR** - The quantification ∃!x P(x) denotes the proposition “There exists a unique x such that P(x) is true”, express the quantification using universal and existential quantifications and logical operators:
**∃x P(x) ∧∀x∀y ((P(x) ∧ P(y)) → x = y)** - If F and G are Boolean functions of degree n. Then, which of the following is true?
**F ≤ F + G and F G ≤ F** - In which one of the following, continuous process improvement is done?
**CMM** - The ______ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them.
**Software architecture (Solved MCQs of Computer Science)** - Working software is not available until late in the process in
**Waterfall model** - Equivalence partitioning is a ______ testing method that divides the input domain of a program into classes of data from which test cases can be derived.
**Black box** - Linked Lists are not suitable for
**Binary Search** - Usage of Preemption and Transaction Rollback prevents
**Deadlock situation** - The _____ language was originally designed as the Transformation Language for Style Sheet facility.
**XSTL** - Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view.
**Hiding** - The decision tree classifier is a widely used technique for
**Classification** - Cross_tab displays permit users to view ______ of multidimensional data at a time.
**Two dimensions**(Computer MCQs Test) - A method to provide secure transmission of email is called
**PGP** - Thoma’s-write rule is
**Timestamp ordering protocol** - The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is
**140 ns**