Q1. When data and acknowledgement are sent in the same frame, this is called as

Q2. Encryption and Decryption is the responsibility of _____________ Layer .

Q3. An analog signal carries 4 bits in each signal unit. If 1000 signal units are sent per second, then baud rate and bit rate of the signal are ___________________ and ____________________

Q4.The VLF and LF bauds use ______________ propagation for communication.

Q5.Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is

Q6. FAN IN of a component A is defined as

Q7. The relationship of data elements in a module is called

Q8. Software Configuration Management is the discipline for systematically controlling

Q9. Which one of the following is not a step of requirement engineering ?

Q10. Testing of software with actual data and in actual environment is called

Q11. The student marks should not be greater than 100. This is

Q12. GO BOTTOM and SKIP-3 commands are given one after another in a database file of 30 records. It shifts the control to

Q13. An ER Model includes
I. An ER diagram portraying entity types.
II. Attributes for each entity type
III. Relationships among entity types.
IV . Semantic integrity constraints that reflects the business rules about data not captured in the ER diagram.

Q14.Based on the cardinality ratio and participation ___________ associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design.

Q15. Data Integrity control uses _______________

Q16. What does the following declaration mean ?
int (*ptr) [10];

Q17. Which of the following has compilation error in C ?

Q18. Which of the following operators cannot be overloaded in C+ + ?

Q19. ______________ allows to create classes which are derived from other classes, so that they automatically include some of its "parent's" members, plus its own members.

Q20. The correct way to round off a floating number x to an integer value is

Q21. What is the value of the postfix expression ? a b c d + - * (where a = 8, b = 4, c = 2 and d = 5)

Q22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer , which of these pointers will change during an insertion into a non-empty queue?

Q23. _______________ is often used to prove the correctness of a recursive function.

Q24. For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ___________ keys and every node can have at most ___________ keys.

Q25. Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be

Q26. Given the following statements :
S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser.
S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars.
Which of the following is true ?

Q27. The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is

Q28.Given the following statements :
S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular.
S2 : L = {wwR} is regular language.
Which of the following is true ?

Q29. The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called _________

Q30. Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right.

Q31. The dual of a Boolean expression is obtained by interchanging

Q32. Given that (292)10 = (1204)x in some number system x. The base x of that number system is

Q33.The sum of products expansion for the function F(x, y, z) = (x + y)z’ is given as

Q34. Let P(m, n) be the statement
"m divides n" where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the following propositions:
I. ∀ m ∀ n P(m,n),
II. ∃ m ∀ n P(m, n)

Q35.Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as

Q36. How many edges are there in a forest of t-trees containing a total of n vertices ?

Q37. Let f and g be the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and g(x) = 3x + 2
Then the composition of f and g and g and f is given as

Q38. If n and r are non-negative integers and n≥r , then p(n + 1, r) equals to

Q39. A graph is non-planar if and only if it contains a subgraph homeomorphic to

Q40. Which of the following statements are true ?
I. A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.
II. A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV . A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter.

Q41. Active X controls are Pentium binary programs that can be embedded in __________

Q42.Match the following :
a. Wireless Application Environment         i. HTTP
b. Wireless Transaction Protocol               ii. IP
c. Wireless Datagram Protocol                   iii. Scripts
d. Wireless                                                   iv. UDP

Q43. Which of the following is widely used inside the telephone system for long-haul data traffic ?

Q44. The document standards for EDI were first developed by large business house during the 1970s and are now under the control of the following standard organisation:

Q45. Electronic Data Interchange Software consists of the following four layers:

Q46. Consider a pre-emptive priority based scheduling algorithm based on dynamically changing priority. Larger priority number implies higher priority. When the process is waiting for CPU in the ready queue (but not yet started execution), its priority changes at a rate a = 2. When it starts running, its priority changes at a rate b = 1. All the processes are assigned priority value 0 when they enter ready queue. Assume that the following processes want to execute :
Process ID           Arrival Time           Service Time
      P1                             0                             4
      P2                             1                             1
      P3                             2                             2
      P4                             3                             1
The time quantum q = 1. When two processes want to join ready queue simultaneously, the process which has not executed recently is given priority. The finish time of processes P1, P2, P3 and P4 will respectively be

Q47. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is

Q48. Consider a disk queue with request for input/output to block on cylinders
98, 183, 37, 122, 14, 124, 65, 67 in that order . Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively

Q49. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?

Q50. Linux operating system uses