Jump to content

  • Log in with Facebook Log in with Twitter Log In with Google      Sign In   
  • Register Free



Here you can download
Guess Papers, Sample Papers,
Prelim Papers etc. of Indian Exams.








HAL Technical Question Papers with answers 2009

hal technical question papers 2009 hal placement paper hal placement papers hindustan aeronautics limited



No replies to this topic

#1 akshay

akshay

    Scholar!!

  • Moderators
  • 334 posts
  • CityMumbai

Posted 15 August 2012 - 12:12 PM

HAL Technical Question Papers with answers 2009 pdf Technical Question Papers of HAL Solved

1. the no of latches in F/F are ——-
a)1 b) 2 c) 3 d)4

2.how many flip-flops are required to construct Mod -12 counter
a)5 b)4 c)12 d)none

3. which logic gate has the output is compliment of its input ———-
a) OR b) AND c)NOT d) X-OR

4.no.of 2-input multiplexers needed to construct a 210 input multiplexer…….
a) 12 b)31 c)20 d)16

5.By adding inverters to the inputs and output of a AND gate we can obtain ……………
a ) OR b) AND c)NOT d) X-OR

6.how many NAND gates are needed to realize OR gate ————–
a)1 b) 2 c) 3 d)4

7.which is the first integrated logic family —————
a) RTL b)DTL c)TTL d) none of these

8.The advantage of CMOS over TTL are—————

9.the range of allowable voltages for CMOS are—————-

10.the voltages required to 0 and 1 in TTL family are —————–

11. Which logic gate has output high if and only if all inputs are low ———?
a) NOR b)NAND c) X-NOR d)AND

12.According to Boolean algebra 1+A+B+C =
a) A b) A+B+C c)1 d) none of these

13. If a=0x6db7 and b=0x2ae9 then what is the value of a”b————–
Questions related to C ……

14.which of the following is not a primitive type in C
a)Int b)Float c) Char d) noneof these

15.If you want to accept variable no of arguments then you have to include which of the following
header files
a) Vararg.h b) stdarg.h c) stdlib.h d) stdioh

16. Register variables are stored in —————-
a) CPU b) main memory c) secondary memory d) peripheral memory

17.what are pointers , when declared , initialized to ——–
a) Garbage b)NULL c)0 d) nothing

18.When you divide a program into functions—————–
a) it is easy to conceptualize and runs faster than usual
b) it is easy to conceptualize
c) it runs faster than actual one
d) none

19. In order to use a pointer it has to be —————-
a) declared b) declared and initialized c) no need of declaration d) initialized

20.what is the output of the following program snippet
Int a=6,b=4; Pirntf(“%d”, a==b); a) Prints 6 b)prints 0 c)Prints 1 d) prints 6 4

21.what is the output of following code segment Char wer[3][4] = { ‘per’,’max,’min’}; Char ( *ptr)
[4]=wer; Printf(“%d%d”,ptr,ptr++);
a)262 262 b)262 263 c)262 265 d0262 266

22.if we give 12345 through scanf what are the values stored at a,b,c Int a,b,c; Scanf(“%d%d%d”,
&a,&b,&c);
a)a=12, b=34,c=5 b)a=12345 and nothing at b,c c)c=12345 and nothing at a,b d)an error message

23.what is the value stored in S Char s[4]; Scanf(“%s”, ‘1234’);
a)1234 b) 1 c) garbze d) error

24.what is the output if we give abc through scanf Char x,y,z; Printf(“%d”,scanf(“%c%c%c”,
&x,&y,&z));
a) prints 3 b) prints 1 c) error message d) prints nothing

25. A variable declared as “ unsigned U” then u is interpreted as
a) unsigned char b) unsigned int c) unsigned float d) the declaration is not possible

26.char c;Printf(“%d”, c); prints —————-
a) negative integer b)always positive integer c) garbage d)none

27.What is the output of the following program
Int a=1;
Printf(“%d”,(a++));
a)1 b)2 c)error message d) none

28.which of the following is incorrect about ++ operator
a)It is a unary operator b) it can be used in expressions c) left as well as right associative d) can be
overloaded
Questions related to TOC and LP

29.Two languages S and T represented by the regular expressions s=(a+b*) T=(a+b)* then the
relation between them is

30.The language L={an bn cn /n=1,2,3,4………} is
a) not context free language but its complement is I CF
b) a context free language
c) a context free language and accepted by Push Down Automata
d) a context sensitive language

31.Finite State Automation —————–device
a) repeater b) acceptor c) divider d) adder

32.The language L={anbn /n=1,2,3,4…………} can be generated from
a) S? ab/aSb/€
b) S? aaSbb/ab
c)S? abb/aSb
d) ab/aSb

33.The regular expression (a/b) generates the set
a) {a} b) {b} c{a,b} d) none

34.The regular expression (a/b)* represents
a) all combinations of a or b and same as (a*b*)*
b) all combinations of a or b and not same as (a*b*)*
c) all combinations of a and b , same as (a*b*)*
d) all combinations of a and b not same as (a*b*)*

35.Context sensitive Languages are ———
a) super set of context free languages and accepted by Push Down Automata
b) super set of context free languages and accepted by non deterministic PDA
c) Accepted by Turing machines only d) none of the above statements are correct

36.Any context free Grammar can be converted into
a) Chomsky Normal Form b) GreiBack Normal form c) CNF and GBNF d) none

37. If a grammar is left-recursive and right-recursive to a non-terminal symbol then the grammar is
a) Ambiguous b) Unambiguous c) the information provided is not sufficient to determine d) none

38.FSA can be used to add two Integers ————-
a)TRUE b) may be TRUE c)FALSE d ) may be FALSE

39.context sensitive languages are ———–
a) accepted by push down automata b) accepted by non-deterministic pushdown automata
c) accepted by 2- way linear bounded automata d) a& c

40.The difference between the Moor and Mealay machines is
a) the former one depends on the present state and present inputs
b) the former one depends on the present state only
c) the later depends on the present state and present inputs
d) the later depends on the present input only

41. An FSA can be stated as ———–
A Turing machine with finite tape, unidirectional moment
A Turing machine with finite tape and bidirectional moment
A Turing machine with finite tape , unidirectional and no repetitions
A Turing machine with infinite tape , unidirectional and no repetitions

42.Recursive Languages are ————
a) super set of all languages
b) type -8 grammar languages
c) accepted by Turing machine
d) we cant say anything about acceptance

43.which of the following statement is wrong about regular expressions
a) there exists a FSM to accept regular expression
b) there exists a N-FSM to accept regular expression
c) there are no ? symbols in regular expression
d) none

44. Regular expression cannot be used in which of the following
a) construction of text editors
b) design of serial circuits
c) design of compilers
d) finding text patterns
Questions related to hardware and OS

45.the term “memory” is related to
a) input and output b) storage c) ALU d) none

46. which of the following is not a Operating system
a)AIX b)PROLOG c) WINDOWS d) UNIX

47.The CPU or MPU consists of
a) input and output b) memory c) ALU d) All of the above

48. In a multiprogramming system
a) there are more than one processor
b) program are executed faster than actual
c) used in case of large programs only
d) more programs executed than actual in given time

49.the front side bus (FSB) also called as
a) control bus b) the processor bus c) PCI bus and processor bus d) none

50.which language is used Artificial Intelligence SYSTEMS
a) Java b) c# c) prolog d) Lisp

51.what is the capacity of Hollerith card when it is in extended state
a) 32kb b) 120 kb c) 240 kb d) 20 kb

52.how many slots are there for UTM device
a)1 b) 2 c) 3 d) 4

53.which part of the computer has the capability to acces memory and manipulate the memory
contents a) input/output b) cpu d) ALU d) none

54. the register which is used to locate the address of the operands and restore the contents is
a) memory address register b) memory data register c) instruction register d) none

55.the opcode ————–
a) tells the address of operands b) instructs the processor c) stores the values d) specifies the operation

56.the language first executed by microprocessor is
a) BASIC b) FORTRAN c) PASCAL d) MODULA

57. which language most suitable for mathematical calculations
a) FORTRAN b) PASCAL c ) C++ d) NONE
Questions related to C++ and OOPs they asked around 20 qs on this (5+ related to friend function)

58.the protected members are ————-
a) accessible within the class only b) accessible within the class and derived class c)cannot be accessed
outside the class d)can be accessed anywhere

59.By default the access specifier is ————– a)private b)public c)protected d)none

60. A class is a —————–
a) a abstract data type b) way of encapsulating data and code c) structure d)………….

61.which function can access the private members of a class ————
a) any function b) member function of derived class c) friend function of that class d) friend function
of derived class

62.In order to access the private members of four classes that function has to be declared as friend of
———————–
a) any one class b) all four classes c)any three classes d) any two classes

63.when a class is derived from another derived class then that inheritance is called ———-
a) multiple b) multipath c) hybrid d) multilevel

64.which of the following are correct about A static member function
a) it has only one copy for all instances and it can access constant variables
b) it has separate copy for each instances
c) it cannot operate on constant variable
d)……………………………..

65.you are hiding the data when you are writing
a) a class b) cryptic code c) static function d) ADT

66. In order to declare a member function of one class as a friend of another class we need to use
a) the key word Friend b) the key word friend and scope resolution c) only scope resolution d) nothing
Question s from Discrete mathematics (only 2)

67. there are 100 nodes in a graph . if two nodes i ,j are said to be adjacent then |i-j|=12 or 8.
How many connected components in the above graph a)4 b) 8 c) 12 d) 25

68.in case of a binary tree all parent nodes are having degree 2 and in the child level the child are
associated to left . what is the name of the tree a) full binary tree b) complete binary tree c) threaded
binary tree d) none
DAA

69.what is the worst case complexity of bubble sort
a) O(n) b) O(logn) c) O(nlogn) d) O(n2)

70.which of the following sorting technique performs well when the element are in reverse order
a) bubble sort b) insertion sort b) mergesort d) heap sort

72.in which type of searching we can search the element in O(1) time averagely
a) linear search b) radix search c) hash based search d) binary search