Steel Structure Design

1.The effective length of a compression member of length L held in position and restrained in direction at one end and effectively restrained in direction but not held in position at the other end, is

L 0.67 L 0.85 L 2 L

2.The ratio of shearing stress to shearing strain within elastic limit, is known as

modulus of elasticity shear modulus of elasticity bulk modulus of elasticity tangent modulus of elasticity

3.For determination of allowable stress in axial compression, Indian Standard Institution has adopted

Euler's formula Rankine formula Engesser formula Secant formula

4.The method of design of steel framework for greatest rigidity and economy in weight, is known as

simply design semi-rigid design fully rigid design none of these.

5. If the pitch is 6 cm and rivet value is 4 tonnes, the number of rivets required for a riveted connection carrying an eccentric load of 15 tonnes at a distance of 30 cm from the centre line, is

6 8 10 12

Language Processors

1.Which of the following functions is/ are performed by the loader?

Allocate space in memory for the programs and resolve symbolic references between object decks Physically place the machine instructions and data into memory Adjust all address dependent locations, such as address constants, to correspond to the allocated space All of the above

2. Convert the 11014B machine language instructions into assembly language, assuming that they were not generated by pseudo-ops

ASRA LOADA h#OD4E, i STOREA h#014B, d ADDA h#01FE, i

3.The advantage(s) of incorporating the macro processor into pass 1 is/ are

many functions do not have to be implemented twice Functions are combined and it is not necessary to create intermediate files as output from the macro processor and input to the assembler more flexibility is available to the programmer in which he/she may use all the features of the assembler in conjunction with macros All of the above

4.In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register?

absolute mode indirect mode immediate mode index mode

5.A self-relocating program is one which

cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation consists of a program and relevant information for its relocation can itself perform the relocation of its address-sensitive portions All of the above

Electronic Principles

1. In an intrinsic semiconductor, the number of free electrons

Equals the number of holes Is less than the number of holes Is greater than the number of holes Impossible to say

2.A device that converts mechanical into electrical energy is?

solar cell thermocouple chemical cell generator

3.Which one of the following kinds of materials has the lowest permeability?

A diamagnetic material A paramagnetic material A feiTomagnetic material All of the above

4.The total impedance of a parallel RLC circuit:

always increases as the applied frequency increases is equal to the sum of the values of resistance, inductive reactance and capacitive reactance always decreases as the applied frequency increases is maximum at the resonant frequency

5.The rise time of a pulse waveform is the time required for the voltage to rise:

from zero to its rms value from zero to its peak value from 10% of the peak value to 70.7% of the peak value from 10% of the peak value to 90% of the peak value

Programming and data structures

1.In the runtime environment, the languages that necessarily need heap allocation is
The one that use global variables The one that allow dynamic data structures The one that support recursion The one that use dynamic scoping

2.What is the requirement for evaluating an expression without any embedded function calls?
Two stack One stack In general case a turning machine is needed As many stacks as the height of an expression tree

3.What is the advantage of chained hash table (external hashing) over open addressing scheme?
Easier deletion is possible Less space is required Worst case complexity of search operations is less None of the above

4.The process in which load addresses are assigned to various parts of the program and to reflect the assigned addresses, code and date in a program are adjusted is called
Relocation Symbol resolution Parsing Assembly

5.Why there are security concerns in case of dynamic linking?
Because cryptographic procedures are not available for dynamic linking. Because security is dynamic Because linking is not secured Because the path for searching dynamic libraries is not known till runtime.

Programming and data structures questions and answers

1.Consider a two dimensional array of integers arr[1…. 10][1…. 15]. One memory location is occupied by each integer. The first element of array is stored at location 100 and the array is stored in row-major order. The address of the element arr[i][j] is
15j + i + 84 15i + j + 84 21i + j + 93 21j + I + 93

2.Assuming that the height of a tree with a single node is 0, the maximum height of any AVL-tree with 7 nodes is
5 4 3 2

3.Consider an empty binary search tree into which the following numbers are inserted in the given order: 10,1, 3, 5, 15, 12, 16. The height of the maximum distance of a leaf node from the root is
2 4 3 8

4.Linked list are not suitable data structures of _________________
Binary search Insertion sort Polynomial manipulation Radix sort

5.For efficiently converting an infix expression to the post fix form, use
A parse tree An operand stack An operator stack Both an operator and an operand stack

OS Concepts

(1) When the result of computation depends on the speed of the processes involved there is said to be
A deadlock A time lock Cycle stealing Race condition

(2) Consider a counting semaphore which was initialized to 10 and then 6P (wait) operation and 4v (signal) operations were completed on this semaphore. What is the resulting value of semaphore?
10 9 8 0

(3) Software interrupt is required by the processor to
Return from subroutine Obtain system services, which need execution of privileged instruction Test the interrupt system of the processor Implement co-routines

(4) How many child processes are created if a process executes the code fork();fork();fork();
5 8 7 9

(5) If hardware does not support _________ a multi-user, multi-processing operating system cannot be implemented.
At least two modes of CPU execution Demand paging DMA for disk transfer Address translation

Programming and data structures questions and answers

1.Consider a program that reads 500 integers in the range of [0, 100] that represents the score of 500 students. Frequency of each score above 50 is then printed. For the program to store the frequencies the best way is
A dynamically allocated array of 550 numbers An array of 100 numbers An array of 500 numbers An array of 50 numbers

2.What is the goal of structured programming?
Able to infer the flow of control from the program text Able to infer the flow of control from the Compiled code To avoid the use of GOTO statements None of the above

3.To check whether an arithmetic expression has balanced parenthesis, the best data structure that can be used is
Stack Tree List Queue

4.Consider a stack S of size n ≥ 1 which is initially empty. In an empty stack first n natural numbers are pushed in sequence and then n pop operations are performed. Push and pop operations take x seconds each. The time elapse between the end of one stack operation and the start of the next operation is y. For m ≥ 1, define the stack-life of m as the time elapsed from the end of push (m) to the start of the pop operation that removes m from stack S. What is the average stack-life of an element of this stack?
3y + 2x n (x + y) - x n (x + y) y + 2x

5.The logic programming languages and functional languages have the common properties that
Both use Horn-clauses Both are declarative Both are procedural languages Both are based on -calculus.

Database test questions for interview

1.The two relation schemes R1 (A, B) and R2 (C, D) has two corresponding relation instances r1 and r2. B from R1 is the foreign key that refers to C in R2. The statement that always holds true if data in r1 and r2 satisfy referential integrity constraints is
πB (r1) – πC (r2) ≠E πB (r1) = πC (r2) πB (r1) – πC (r2) = E πC (r2) – πB (r1) = E

2.The relation R that has x number of tuples is joined with relation S that has y number of tuples. The maximum and minimum sizes of join respectively are
xy and x + y x + y and I x - yI xy and 0 x + y and 0

3.Consider a B+ tree in which order of the internal node is 3 and that of the leaf node is 2. The key values are inserted into this tree in the order given as 10, 3, 6, 8, 4, 2, 1. The order of the internal node is the maximum number of tree pointers in each node and the order of the leaf node is the maximum number of data items that can be stored in it. Assume that the B+ tree is initially empty. As a result of this iteration the maximum number of times leaf nodes would get split up is
2 3 4 5

4.Which one of the following statement is incorrect for the basic ER and relational models?
An attribute of an entity can be composite An attribute of an entity can have more than one value An attribute can have exactly one value or a NULL value in a row of a relational table An attribute can have more than one value in a row of a relational table.

5. Which one of the following statement about B+ trees is correct?
B+ trees are for secondary indexes and B trees are for primary indexes B+ trees are for main memory and B trees are for storing data on disk B+ trees height is independent of the number of records On B+ trees range queries are faster

Algorithm questions and answers

(1) Starting from the root and performing ____________, level order traversal of a rooted tree can be done.
Breadth first search Depth first search In-order traversal Pre-order traversal

(2) We have a hash function and a hash table. The size of hash table is 7 with starting index zero. The hash function is (3x+4) mod 7. Assume that initially the hash table is empty and the sequence 1, 3, 8, 10 is inserted into the table using closed hashing. The content of the table is (‘_’ denotes an empty location in the table)
1, _, _, _, _, _, 3 8, _, _, _, _, _, 10 1, 8, 10, _, _, _, 3 1, 10,8, _, _, _, 3

(3) Which one of the following statement is false if G is an undirected graph with distinct edge weight, Emax is the edge with maximum weight and Emin is the edge with minimum weight?
Emin is present in every minimum spanning tree of G Emax is not present in any minimum spanning tree. The removal of Emax must disconnect G, if Emax is in a minimum spanning tree. G has a unique minimum spanning tree.

(4) Consider an array L. If an element in an array L is greater than all elements to the right of it then it is called a leader. The best algorithm to find all leaders in an array
Solves it in time θ (n²) Solves it in linear time using a left to right pass of the array Solves it in linear time using a right to left pass of the array Solves it using divide and conquer in time θ (n logn)

(7) Consider a complete n-array tree. This tree is such that each node has either n number of children or no children. Let l = 10 be the number of internal nodes and L = 41 be the number of leaves in a complete n-array tree. The value of n is
5 4 3 2

Operating system test questions for interview

(1) The use of __________ works on the principle of locality.
Cache memory Interrupts Polling DMA

(2) Consider a computer system with 6 tape drives and n processes completing for them. What is the maximum value of n for the system to be deadlock free assuming each processes may need 3 tape drives?
3 2 4 7

(3) When size of the memory is increased the page replacement policy that sometimes leads to more page faults is
FIFO Optimal LRU None of the above

(4) The capacity of a memory unit = The number of words x The number of bits/words. For the memory of 4k x 16 the number of separate address and data lines needed is
12 address and 16 data lines 12 address and 12 data lines 11 address and 6 data lines 12 address and 8 data lines

(5) A system has m number of resources of same type and 3 processes A, B and C. share these resources. A, B and C have the peak demand of 3, 4 and 6 respectively. Deadlock will not occur if
m = 15 m = 8 m = 13 m = 9

Web technologies questions and answers

(1) Out of the options given below the one, which is not a client server application is
Ping E-mail Web browsing Internet chat

(2) We have an HTML form that is to be designed to enable purchase of office stationary. For the items that are selected mark it with check. Submit button is to be pressed ones the credit card details are filled. Assuming that security is handled in a way that is transparent to the form design, the option that would be appropriate for sending the data to the server is
Only POST Only GET Either GET or POST Neither GET nor POST

(3) The objects that can be used in expression and scriplets in JSP without explicitly declaring them is
Response and session only Session and request only Request and response only Session, request and response

(4) _____________ indicates a correct association of the three commands PROMPT, HEAD and RCPT with protocols where these are used
FTP, HTTP, SMTP HTTP, FTP,SMTP SMTP,HTTP,FTP HTTP, SMTP,FTP

(5) Which one of the following statement about HTTP is false?
It can be used to test the validity of a hypertext links It allows information to be stored in a UR It runs over TCP protocol It describes the structure of web pages

Computer Architecture Organization

(1) In a computer, whose average memory access time is 20ns has the page fault service time 10Ms. For every 106 memory accesses one page fault is generated. The effective access time for the memory is
10ns 43ns 30ns 25ns

(2) Let T1 be the time taken for a single instruction on a pipelined CPU and T2 be the time take for a single instruction on a non-pipelined but identical CPU. Comparing T1 and T2 we can say that
T1=T2 + the time taken for one instruction fetch cycle T1 T1≤T2 T1≥T2

(3) The number of bits needed for cache indexing is
10 15 5 20

(4) The number of tag bits needed is
17 20 22 25

(5) A and B are the data inputs and Y is the control input of a multiplexer. When Y = 0 data input A is selected and when Y = 1 data input B is selected. The connections required to realize the 2-variable Boolean function f = X+Z, without using any additional hardware are
X to A, 0 to B, Z to Y Z to A, 1 to B, 0 to Y Z to A, 1 to B, X to Y X to A, 1 to B, Z to Y