Skip to content
PSCNET App 100K+ installs · 4.6 ★ rating Install

PSC Assistant Professor Information Technology Model Questions and Answers

51
To implement a 2 input EXCLUSIVE OR function, the minimum number of NAND gates required is (use NAND gates only):
Answer
C. 5
52
The number (A72E)16 is equivalent to:
Answer
A. (123456)8 and (22130232)4
53
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O bandwidth?
Answer
D. Block transfer and polling interrupts
54
Which of the following statements is FALSE about relative addressing mode?
Answer
B. It allows indexing of array elements with same instruction
55
The TRAP interrupt mechanism of the 8085 microprocessor:
Answer
A. Executes an instruction supplied by an external device through the INTA signal
56
Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) Without explicitly declaring them?
Answer
A. Session and request only
57
The address bus of 8086 CPU is:
Answer
B. 20 bits
58
The register which keeps track of the execution of a program and which contains the memory address of the instruction currently being executed is called:
Answer
C. Program counter
59
The register used as a working area in CPU is:
Answer
D. Accumulator
60
In the absolute addressing mode:
Answer
D. Location of the operand is implicit
61
In a software project, COCOMO (Constructive Cost Model) is used to estimate
Answer
C. effort and cost based on the duration of the software
62
A relation EMPLOYEE is defined with attributes empcode (unique), name, street, city, state and pin code. For any pin code, there is only one city and state. Also, for any given street, city and state, there is just one pin code. In normalization terms, EMPLOYEE is a relation in:
Answer
B. 2NF and hence also in 1NF
63
A software configuration management tool helps in:
Answer
B. Maintaining different versions of the configurable items
64
A relational database contains two tables employee and department in which employee table has columns emp-no, name and dept-id and department table has columns dept-id and dept-name. The following insert statement were executed successfully to populate the empty tables:
Insert into department Values (1, ‘computer science’)
Insert into department values (2, ‘information technology’)
Insert into employee values (1, ‘Navin’, 1)
Insert into employee values (2, ‘Mukesh’, 2)
Insert into employee values (3, ‘Suresh’, 1)
How many rows and columns will be retrieved by the following SQL statement?
Select *from employee, department
Answer
D. 6 rows and 5 columns
65
A table has fields F1, F2, F3, F4, F5 with the following functional dependencies F1→ F3,
F2→ F4, (F1, F2)→F5 in terms of normalization, this table is in:
Answer
A. 1NF
66
A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index ,then the maximum number of nodes that could be newly created in the process are:
Answer
A. 5
67
Amongst the ACID properties of a transaction, the ‘durability’ property requires that the changes made to the database by a successful transaction persist:
Answer
D. Always, even if there is a failure of any kind
68
Consider a relation R with five attributes V, W, X, Y and Z. The following functional dependencies hold: VY→W, WX→Z and ZY→V. Which of the following is a candidate key for R?
Answer
B. VXY
69
Which of the following is a realization of polymorphism?
Answer
D. All of these
70
A major advantage of inheritance is:
Answer
A. Reducing the time it takes to create new objects
71
The technique used to summarize the financial, statistical, mathematical, scientific and economic data is:
Answer
C. Presentation Graphics
72
Graphics and image processing technique used to produce a transformation of one object into another is called:
Answer
A. Animation
73
In a binary tree, for every node the difference between the number of nodes in the Left and right subtrees is atmost 2. If the height of the tree is h>0, then the minimum number of nodes in the tree is:
Answer
B. 2 h-1+1
74
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is 5, 3, 1, 2, 4, 6, 8, 7. If the tree is traversed in post-order, the sequence obtained would be:
Answer
D. 2,1,4,3,7,8,6,5
75
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e, which of the following statements is always true?
Answer
C. Edge e cannot be contained in a cycle

Related reading

Most Recommended Links

Discussion

Ask a doubt or share a tip.

No comments yet — start the discussion.

Leave a comment

Your email address and number are never published. Required fields are marked

Never published. We use it only to reach you on WhatsApp.