Consider the polynomial p(x)=c₀ + c₁x + c₂x^2 + c_3x^3, where no coefficient is 0. The minimum number of multiplications required to evaluate p on an input x is

If S={x|0 < x < 12}, M={x|1 < x < 9} and N={x|0 < x< 5}, find M' ∩ N'

Let E, F and G be finite sets and let A = (E∩ F) - (F ∩ G) and B = (E - (E ∩ G)) - (E - F). Which one of the following is true?

If the word FORGET is encoded as DPPHCU, then THINK is encoded as

Seven (distinct) road accidents occurred in a week. What is the probability that they all occurred on the same day?

What is the maximum number of different Boolean functions involving n Boolean variables?

Given below is a chart of rainfall amounts in Quinquinox city on a distant planet Quinox revolving around an equally distant Star. It has its own months and years. Year is, of course, the time takenin their own units of measurement to revolve once around their Star.

Examine the chart carefully and answer Question



How many months are there in a year on Quinox?

Given below is a chart of rainfall amounts in Quinquinox city on a distant planet Quinox revolving around an equally distant Star. It has its own months and years. Year is, of course, the time taken in their own units of measurement to revolve once around their Star.

Examine the chart carefully and answer Question



If climate is classified into the following three categories,

QNd Seasonal rainfall with wet season being short

QNe Uniform rainfall throughout the year

QNm Seasonal rainfall with wet season being long

Which category describes the climate of Quinquinox?

If the year on Quinox starts with Mon-Ol (which is also the first data point), which month in a year is the wettest?

Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are

Here is a puzzle: find a number x such that x leaves a remainder of 9 when divided by 10, a remainder of 8 when divided by 9, a remainder of 7 when divided by 8, ... , a remainder of 2 when divided by 3 and a remainder of 1 when divided by 2.

How many such numbers are there?

Car A goes 200 Kms at an average speed of 40 Kmph in one direction and returns to the starting point covering the distance of 200 Kms at an average speed of 50 Kmph. Another Car B goes 200 Kms at an average speed of 45 Kmph and does the return journey of 200 Kms also at an average speed of 45 Kmph. Which statement is TRUE about the two cars A and B?

Which of the following is correctly represented by the Venn diagram above?

Questions 14 - 16 are based on the Venn diagram below. S represents all integers between 1 and 30, P represents prime numbers between 1 and 30, M represents multiples of 3 between 1 and 30, and F represents all factors of 30.



If G = P ∩ M ∩ F, then

Questions 14 - 16 are based on the Venn diagram below. S represents all integers between 1 and 30, P represents prime numbers between 1 and 30, M represents multiples of 3 between 1 and 30, and F represents all factors of 30.



What are the numbers in F but not in P or M?

Questions 14 - 16 are based on the Venn diagram below. S represents all integers between 1 and 30, P represents prime numbers between 1 and 30, M represents multiples of 3 between 1 and 30, and F represents all factors of 30.



What is the cardinality of P ∩ F?

Read the paragraphs below and answer Question.

When looking back on any kind of movement or revolution, one always likes to point to a beginning: "It began right there - it all started with so-and-so's famous speech ... " If structured

programming can be thought of as a revolution, then surely Dijkstra's land-mark paper, "Programming Considered as a Human Activity," published in 1965, marks its beginning. Virtually

the entire gospel of structured programming is contained in a few short pages: the arguments

against goto statements, the notion of top-down design, the emphasis on program correctness

and quality (or "elegance," as Dijkstra prefers to call it), and the strong argument against programs that modify themselves.

In addition to these fundamental concepts, there are some rather classic phrases that first appeared in this paper, and that have popped-up in dozens of subsequent articles and books. For

example, when discussing the "divide and conquer" approach characterizing top-down design,

Dijkstra admits, "I have only a very small head, ,and must live with it." What seems obvious to us today was a rather novel idea in 1965: the idea that while computers were - and still are

- getting faster and more powerful, human beings weren't.

This theme is repeated again and again, and is essentially the entire subject matter of Dijkstra's

1972 speech, "The Humble Programmer." ... Once you do read it, you can see why Dijkstra has

the reputation he does. His writing is succinct and yet convincing. Reading Dijkstra, someone

said, has been compared to eating marzipan - it's best to take very small bites, chew slowly,

and digest the mouthful before moving on to the next bite.

What is said to have begun with Dijkstra's landmark paper, "Programming Considered as a Human Activity" in 1965?

Read the paragraphs below and answer Question.

When looking back on any kind of movement or revolution, one always likes to point to a beginning: "It began right there - it all started with so-and-so's famous speech ... " If structured

programming can be thought of as a revolution, then surely Dijkstra's land-mark paper, "Programming Considered as a Human Activity," published in 1965, marks its beginning. Virtually

the entire gospel of structured programming is contained in a few short pages: the arguments

against goto statements, the notion of top-down design, the emphasis on program correctness

and quality (or "elegance," as Dijkstra prefers to call it), and the strong argument against programs that modify themselves.

In addition to these fundamental concepts, there are some rather classic phrases that first appeared in this paper, and that have popped-up in dozens of subsequent articles and books. For

example, when discussing the "divide and conquer" approach characterizing top-down design,

Dijkstra admits, "I have only a very small head, ,and must live with it." What seems obvious to us today was a rather novel idea in 1965: the idea that while computers were - and still are

- getting faster and more powerful, human beings weren't.

This theme is repeated again and again, and is essentially the entire subject matter of Dijkstra's

1972 speech, "The Humble Programmer." ... Once you do read it, you can see why Dijkstra has

the reputation he does. His writing is succinct and yet convincing. Reading Dijkstra, someone

said, has been compared to eating marzipan - it's best to take very small bites, chew slowly,

and digest the mouthful before moving on to the next bite.

Which of the following is NOT a part of structured programming?

Read the paragraphs below and answer Question.

When looking back on any kind of movement or revolution, one always likes to point to a beginning: "It began right there - it all started with so-and-so's famous speech ... " If structured

programming can be thought of as a revolution, then surely Dijkstra's land-mark paper, "Programming Considered as a Human Activity," published in 1965, marks its beginning. Virtually

the entire gospel of structured programming is contained in a few short pages: the arguments

against goto statements, the notion of top-down design, the emphasis on program correctness

and quality (or "elegance," as Dijkstra prefers to call it), and the strong argument against programs that modify themselves.

In addition to these fundamental concepts, there are some rather classic phrases that first appeared in this paper, and that have popped-up in dozens of subsequent articles and books. For

example, when discussing the "divide and conquer" approach characterizing top-down design,

Dijkstra admits, "I have only a very small head, ,and must live with it." What seems obvious to us today was a rather novel idea in 1965: the idea that while computers were - and still are

- getting faster and more powerful, human beings weren't.

This theme is repeated again and again, and is essentially the entire subject matter of Dijkstra's

1972 speech, "The Humble Programmer." ... Once you do read it, you can see why Dijkstra has

the reputation he does. His writing is succinct and yet convincing. Reading Dijkstra, someone

said, has been compared to eating marzipan - it's best to take very small bites, chew slowly,

and digest the mouthful before moving on to the next bite.

Reading Dijkstra should be like eating marzipan - what does this mean?

Two cards are drawn together from a pack of 52 cards (a set of traditional playing cards) at random. What is the probability that one is a spade and qne is a heart?

The ratio of the number of boys and girls in a class is 4:3. If 100% of the boys and 20% of the girls are scholarship holders, what is the percentage of students who do not get scholarships?

How many squares are there in the following figure?

Two candidates were contesting for the post of the chairperson of a committee, 3/4th of the members voted for A and 3/5th for B, 30 members voted in favour of both the candidates and 9 members did not cast their vote. Find the total number of members who cast their votes.

Answer Questions 24 - 26 based on the following information.

A, 'B, C, D, E and Fare 6 relatives. Their relationships are:

(a) B is the son of C, but C is not the mother of B

(b) D is the daughter of A

(c) F is the brother of B

(d) A and C are a married couple

(e) E is the brother of C

Who is the mother of B?

Answer Questions 24 - 26 based on the following information.

A, 'B, C, D, E and Fare 6 relatives. Their relationships are:

(a) B is the son of C, but C is not the mother of B

(b) D is the daughter of A

(c) F is the brother of B

(d) A and C are a married couple

(e) E is the brother of C

How many children does A have?

Answer Questions 24 - 26 based on the following information.

A, 'B, C, D, E and Fare 6 relatives. Their relationships are:

(a) B is the son of C, but C is not the mother of B

(b) D is the daughter of A

(c) F is the brother of B

(d) A and C are a married couple

(e) E is the brother of C

Which of the following statements is/are TRUE?

Words are sorted according to the following two rules applied in order: (a) nouns come before verbs, verbs come before adjectives, adjectives come before adverb; (b) a letter with less number of straight line segments comes before one with more straight lines, e.g., V (2 straight lines) comes before E (4 straight lines).

Given the words, ACADEMY, NEST, SUPERB. SUNDAY, NOTING, the correct ascending order is

A shelf has between 75 and 100 books. 1/6th of them are novels and 12.5% of them are biographies_ .Find the number of books.

A box contains 4 black 3 red and 5 green balls, 2 balls are drawn from the box at random. What is the probability that both the balls are of the same color?

What is the first letter of a meaningful English word formed from the 1st, 4th, 7th and 11th letters of "SUPERFLUOUS"?

The following figure shows a ring containing 105 teeth inside which is a wheel with 80 teeth. The black dots - one on the wheel and one on the ring are initially aligned as shown. The wheel is now rotated anti-clockwise along the ring with no slippage.After how many revolutions of the wheel will it return to the initial alignment?

What is the cardinality of the power set of {a, b, {a, b} }?

In Research Methodology, what does the word Ontology refer to?

Which of the following is given as a classic example of proof by contradiction?

Some possible reasons for Literature Review in research are given below. Read them and answer the question given below.

I. Show the state·of-the-art so that the significance of the solution proposed is clear to the reader.

II. Give a correct context to the scope of the work proposed in the thesis.

III. Demonstrate the scholarliness of the thesis writer.

IV. FiJI the minimum page requirement for a thesis.

Which of the above statements are VALID reasons?

What is the language of the Non-deterministic Finite Automaton(NFA) on Σ={a,b} given below?

The language of the following CFG on Σ= {a, b} given by

S → aSb I SS I ε

with n^a (w) denoting the number of a's present in w is

Consider the ultimate software verification problem: A software that can verify any program submitted as input to check if it is correct or not. This problem is

Which of the following statements is FALSE?

A random-access read/write semiconductor memory chip is organized into 128 words of 8 bits each. A larger memory of 4K words of 16 bits each (K = 1024) may be obtained by connecting

A certain computer represents floating point numbers by means of a signed magnitude fractional mantissa and an excess-16 base 4 exponent. The floating point format number is 110010111000. What is its decimal value?

Which of the following is true of interrupts?

The following assembly language program fragment was written for a single-address computer with one accumulator register. What is stored in z?

LOAD b

MULT c

STORE t1

ADD a

STORE t2

MULT t2

ADD tl

STORE z

The logic circuit given below is used to compare two unsigned 2-bit numbers, X₁X₀ = X and Y₁ Y₀ = Y, where X_o and Y_o are the least significant bits. (A small circle on any line in a logic diagram indicates logical NOT). Which of the following always makes the output Z have the value 1?

The constraint that specifies the number of entities to which another entity can be associated via a relationship set in E-R model is referred as

An attribute "Address" is divided into Street, City, state, Zip and Country. The attribute "Address" is referred as

The relationship associating the weak entity set with the identifying set is called

If E1 and E2 are relational algebra expressions then which of the following is NOT a relational algebra expression

The set of statements that are executed automatically as a side effect of a modification to the database is a

A digital signaling system is required to operate at 9600 bps. If a signal element encodes a 4-bit word, what is the minimum required bandwidth of the channel?

Host 130.37.56.201 is on a Class Network.

A TCP segment consisting of 1500 bits of data and 160 bits of header is sent to the IP layer, which appends another 160 bits of header. This is then transmitted through two networks, each of which uses a 24-bit packet header. The destination network has a maximum packet size of 800 bits. How many bits, including headers, are delivered to the network layer protocol at the destination?

A slotted LAN has m stations. The probability for an individual station to transmit is t in a time slot. What shall be the probability that in a given time slot ONLY one station transmits?

Two systems S1 and S2 are configured with the following IP address:

S1: 203.197.2.53; netmask 255.255.128.0

S2: 203. 197.75.201;netmask 255.255.192.0

Which one of the following statements is true?

Computer P sends 64 byte messages to Computer Q through a sliding window protocol. The delay between P and Q is 160 ms and the bandwidth is 256 kbps. What is the optimal size of the window for P to send messages?

In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state. Now, consider the following statements.



I. If a process makes a transition D, it would result in another process making transition A immediately

II. A process P2 in blocked state can make transition E while another process PI is in running state

III. The OS uses preemptive scheduling

IV. The OS uses non-preemptive scheduling

Which of the above statements are TRUE?

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector.· The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:

Identify the correct order in which a server process must invoke the function calls accept, bind, listen and recv according to UNIX socket API.

Let f be a Boolean expression in 8 variables which has true value exactly for 4 combinations out of 2^8 possible combinations. Then f can be expressed as sum of minterms.

One of the main limitations of Hierarchical databases is

Consider a Relational schema R(A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition of R into R1 (A, B) and R2(C, D) is

What is the highest normal form of a relation R(A, B, C, D, E) with FD set?

{B → A, A → C, BC → D, AC→ BE}

Which of the following statements is TRUE about static variables in C?

An array of integers is declared in C language as

int pat [32] [10] ;

Which of the following array elements are in adjacent locations in memory?

A shop announces a grand 13th anniversary sale where every customer is allowed to take 1300 worth of goods from the items listed below (each weighs 5 Kg). A person wishes to take items totalling 15 Kg in weight because airlines allow only 15 Kg to be carried. Which type of algorithm gives the correct solution to the problem of picking up items satisfying both the weight and free gift amount constraints?

Item A: 100, Item B: 300, Item C: 600, Item D: 800, Item E: 750

Consider the following statements:

I. SRAMs are made up of flip-flops each storing 1 bit

II. SRAMs are slower than DRAMs because SRAMs need more transistors than DRAMs which

use a transistor and a capacitor

Ill. SRAMs are more expensive than DRAMs

Which of the above statements are TRUE?

Processes PI and P2 use cri tical_flag in the following routine to achieve mutual exclusion.

Assume that critical_flag is initialized to FALSE in the main program.

get_exclusive_access ( )

{

}

if (critical _flag == FALSE) {

critical_flag = TRUE ;

critical_region () ;

critical_flag = FALSE;

}

Consider the following statements.

I. It is possible for both PI and P2 to enter the critical region concurrently.

II. It is possible for deadlock to occur.

Which of the following holds TRUE?

A Page Table is given below in a virtual memory system having a page size of 1024. Each virnal address is in the form [p, d] where p and d are the page number and the displacement in that page, respectively. A virtual address of [0, 514] maps to an actual address of

Nodes in a Resource Allocation Graph are

Which of the following page replacement algorithms DOES NOT suffer from Belady's Anomaly?