About Blog ...

If you’re looking for what’s next, look no further. DevDep #Multi-Fields platform creation has grown into one of the largest blogs worldwide, and it’s all due to focusing on what’s new . News and analysis on Web technologies, start ups, social media,gaming, gadgets gaming...etc — Pretty much known as the "DevDep" and everything else techie are talking about & well mashes it up into the kind of blog casserole we just can’t get enough of...

Friday 8 May 2015

Placement #11 Technical Questions For Computer Science Graduates

Technical Questions For Computer Science Graduates 





Latest Top 70 Questions with Answers :-

1. What type of memory could be accessed in least time?  

(a)cache memory

(b)secondary memory

(c)main memory

(d)none

Ans:A

2. void main()

   {

      int const * p=5;

      printf("%d",++(*p));

   }

What is the output?

(a)     6

(b)     5

(c)     Compiler error

(d)     Run time error

Ans :c

3. main()

      {

      static int var = 5;

      printf("%d ",var--);

      if(var)

            main();

      }

What is the output?

(a) 1 2 3 4 5

(b) infinite loop

(c) 5 4 3 2 1

(d) compiler error

Ans :c

4. main()

{

printf("\nab");

printf("\bsi");

printf("\rha");

}

(a)     has

(b)     hasaiaab

(c)     hai

(d)     aas

Ans :c

5. #include

#define a 10

main()

{

#define a 50

printf("%d",a);

}

(a)      10

(b)     50

(c)     error

(d)     none

Ans:B

6. Minimum number of queues needed to implement the priority queue?

(a)      one

(b)      two

(c)      three

(d)      zero

Ans:B

7. What are the notations used in Evaluation of Arithmetic Expressions using
prefix and postfix forms?

(a)       Reverse Polish notations

(b)       Polish

(c)       both

(d)       none

Ans :C

8. In tree construction which is the suitable efficient data structure?

(a)      Array

(b)      Linked list

(c)      Stack

(d)      Queue 

Ans :B

9. Of the following tree structure, which is, efficient considering space
and time complexities?

(a)      Incomplete Binary Tree

(b)      Complete Binary Tree

(c)      Full Binary Tree

(d)      None

Ans:B

10. What operator performs pattern matching?

(a)      LIKE

(b)     NULL

(c)     WHERE

(d)     AS

Ans :A

11. What is the output of the following query?

      SELECT TRUNC(1234.5678,-2) FROM DUAL

(a)     1235

(b)     1200

(c)     1234.5

(d)     1234

Ans:B

12. What is the use of the DROP option in the ALTER TABLE command?

(a) It is used to drop constraints specified on the row

(b) It is used to drop constraints specified on the table.

(c) It is used to drop constraints specified on the column

(d) all

Ans :B

13. Which is the parameter that is added to every non-static member function
when it is called?

(a)‘this’ pointer

(b) ‘far’ pointer

(c)‘near’ pointer

(d) all

Ans:A

14. A collection of programs that enables user to create and maintain a
database is called

(a) DBMS

(b) DB

(c) DBA

(d) All

Ans:A

15. Model based on collection of objects is

(a) E-R Model

(b) Data Model

(c) Object Oriented Model

(d) None

Ans:C

16. When one of the data elements stored within a construct is utilized as the
primary key, then it is called

(a) Foreign key

(b) Natural key

(c) Primary key

(d) Alternate key

Ans:B

17. different phases of transaction?

(a) Analysis & Redo

(b) Redo & Undo

(c) Analysis & Redo & Undo

(d) None

Ans:C

18. void main()
    {
     int i=7;
     printf("%d",i++*i++);
    }

What is the output?

(a) 56

(b) 65

(c) 5 6

(d)  6 5

Ans:A

19. Output of the following program is

main()

{

int i=0;

for(i=0;i<20;i++)

{

switch(i)

case 0:i+=5;

case 1:i+=2;

case 5:i+=5;

default i+=4;

break;}

printf("%d,",i);

}

}


(a)  0,5,9,13,17

(b)  5,9,13,17

(c)  12,17,22

(d)  16,21

Ans:D

20. Find the output

main()

{

int x=5;

printf("%d %d %d\n",x,x<<2,x>>2);

}

(a)  1 5 20

(b)  20 5 1

(c)  5 20 1

(d)  1 5 10

Ans:C

21. What is the full form of CMM

(a) Capability Maturity Model

(b) Cost Maintainance Model

(c) Capability maintainance model

(d) Cost Maturity Model

Ans:A

22. Sorting is not possible by using which of the following methods?

(a) Insertion

(b) Selection

(c) Exchange

(d) Deletion

Ans:D

23. What are the methods available in storing sequential files ?

(a) Straight merging,

(b) Natural merging,

(c) Polyphase sort

(d) all

Ans:D

24. Conditional results after execution of an instruction in a micro processor
is stored in

(a) register

(b) accumulator

(c) flag register

(d) flag register part of PSW(Program Status Word)

Ans: (d)

25. Frequency at which VOICE is sampled is

(a) 4 Khz

(b) 8 Khz

(c) 16 Khz

(d) 64 Khz

Ans: (a)

26. The status of the Kernel is

(a) task

(b) process

(c) not defined.

(d) none of the above.

Ans: (b)

27. Buffering is 

(a) the process of temporarily storing the data to allow for small variation
in device speeds

(b) a method to reduce cross talks

(c) storage of data within transmitting medium until the receiver is ready
to receive.

(d) a method to reduce routing overhead.

Ans: (a)

28. Memory allocation of variables declared in a program is

(a) allocated in RAM.

(b) allocated in ROM.

(c) allocated on stack.

(d) assigned to registers.

Ans: (c)

29. Windows 95 supports

(a) Multiuser 

(b) n tasks 

(c) Both

(d) None

Ans. (a)

30. Semaphore is used for

(a) synchronization 

(b) dead-lock avoidence

(c) box 

(d) none

Ans. (a)

31. Which holds true for the following statement

     class c: public A, public B

(a) 2 member in class A, B should not have same name

(b) 2 member in class A, C should not have same name

(c) both 

(d) none

Ans. (a)

32. Piggy backing is a technique for

(a) Flow control 

(b) Sequence 

(c) Acknowledgement 

(d) retransmition

Ans. (c)

33. Which is not a memory management scheme?

(a) buddy system

(b) swapping

(c) monitors

(d) paging

Ans : c

34. There was a circuit given using three nand gates with two inputs and one output.
    Find the output.

(a) OR

(b) AND

(c) XOR

(d) NOT

Ans. (a)

35. The redirection operators > and >>

(a) do the same function

(b) differ : > overwrites, while >> appends

(c) differ : > is used for input while >> is used for output

(d) differ : > write to any file while >> write only to standard output

(e) None of these

Ans. (b)

36. Which three commands cause a transaction to end? (Chosse three)
1) ALTER
2) GRANT 
3) DELETE
4) INSERT
5) UPdATE
6) ROLLBACK

(a)1,2,6

(b)1,3,4

(c)2,3,6

(d)45,,6

Ans. A

37. What was the first name given to Java Programming Language. 

(a) Oak - Java

(b) Small Talk

(c) Oak

(d) None

Ans.a

38.What will happen when you attempt to compile and run the following code?

interface Skeleton{

public char getSize(int iSize);

}

public class Huskisson implements Skeleton{

int iSize=99;

public static void main(String argv[]){

      new Huskisson();

int iSize=1;

      System.out.println(getSize(iSize));

}

public int getSize(int iSize){

      return iSize;

}

}

(a)    Compilation and output of 1

(b)    Compile time error

(c)    Compilation and output of 99

(d)    Compilation but runtime error


39.What will happen if you compile the following code with assertions enabled?

public class Cote{

public static void main(String argv[]){

Cote c = new Cote();

c.go(argv[0]);

}

public void go(String s){

int i = Integer.parseInt(s);

if(i > 0){

System.out.println(i);

}else{

throw new AssertionError(i);

}

}

}

(a)    Compile time error, AssertionError has no int constructor

(b)    Compile time error AssertionError does not exist

(c)    Assertion Error at runtime if given a command line parameter of 0

(d)    If given a command line parameter of 1, 1 will be output at runtime


40.What data structes you will use if you want to go to first record from

the last and vice versa?

(a)  Doubly linked circular list

(b)  Single linked circular list

(c)  Tree

(d)  Graph


41. given a height balanced tree. If we add one more node , how

many nodes gets unbalanced ?

(a)1 (b)2 (c) 3 (d) 7


42. Given a arbitrary pointer to an element in a singly linked list?

what is the time complexity for its deletion

(a)O(n2) (b) O(n) (c)O(n-1) (d)O(2n-1)


43. S->S+S; s->s*s; s->a

 how many parse trees possible : a+a*a+a

(a)4 (b) 3 (c) 7 (d)5


44. The relational operator in C++ '!=' means

(a) equal to

(b) not equal to

(c) Both A & B

(d) None of the above


45.  To sorting array of 10 elements which sorting is best

(a)slection

(b)bubble

(c)tree sort

(d)insertion sort


46.The symbol '+=' is used to denote

(a)Assignment

(b) Addition Assignment

(c)Addition

(d) None of the above


47.which data struture is needed to convert infix notations to postfix
notations?

(a) linear list

(b) queue

(c) tree

(d) stack


48. The operator which returns the remainder of the division operation, is that

(a) ++

(b) —

(c) %

(d) /


49.A class is a ______ for an object

(a) Object

(b) Instance

(c) Template

(d) None of the above


50.Can two different near pointers contain two different addresses
but refer to the same location in memory?

a.Yes    b.No    c.Sometimes    d.depends on the C compiler
Ans:B

51.#define scanf "%s is a string"

main()

{

printf(scanf,scanf);

}

a.%s is a string %s is a string   

b.%s is a string is a string   

c.%s is a stringis a string   

d.None

Ans:B


52.main()

{

char *c=97;

printf("%d",c);

}

a.garbage value    b.a    c.97    d.None


53.Which of the following is true?

a.In multiprogrammed systems CPU is often sit idle   

b.The jobs in the jobpool are subset to the jobs that can be
kept in the memory   

c.The Jobs that can be kept simultaneously in memory is smaller
than that of jobs that can be in job pool   

d.The Operatingsystems
kept several jobs in jobpool from memory

Ans:C


54.If several jobs are ready to be brought into memory,
then system must choose among them this is

a.CPU scheduling   

b.Process scheduling   

c.Job scheduling   

d.none

Ans:C


55.TimeSharing Systems also called as

a.MultiProgramming systems   

b.MultiThreaded systems   

c.Multiprocessing systems   

d.MultiTasking Systems

Ans:D


56.In C language to implement the heterogeneous linked list,
what pointer type will you use?

a.void pointer   

b.int pointer   

c.generic pointer   

d.both void pointer and generic pointer

Ans:D


57.Minimum number of queues needed to implement the priority queue?

a.1    b.2    c.3    d.None

Ans:B


58.What is the data structures used to perform recursion?

a.Stack    b.Queue    c.Linked List    d.None

Ans:A


59.Convert the expression
((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix notations.

a.^ - * +ABC - DE + FG   

b.AB + C * DE - - FG + ^   

c.ABC+*DE?FG+^   

d.ABC+*-^+DE-FG+

Ans:A


60.How many times the following program would print 'Gurus...'?

main()

{

printf("\nGurus...");

main();

}

a.Infinite number of times   

b.32767 times   

c.65535 times   

d.Till the stack doesn`t overflow

Ans:D


61.What would be the output of the follwoing porgram?

main()

{

float a=0.7;

if(a<0.7)

printf("C");

else

printf("C++");

}

a.C    b.C++    c.Error    d.None

Ans:A



62.Is it true that too many recursive calls may result into stack
overflow?

a.No   

b.Sometimes   

c.depends on the C compiler and ur Processor   


d.Yes

Ans:D

63.Viruses belongs to which network issue

a.Performance    b.Reliability    c.Security    d.All of the above

Ans:C



64.Which topology requires multi point connection?

a.Mesh    b.Star    c.Bus    d.Ring

Ans:C



65.If the protocol specifies the data should be sent at 100
mbps what is this issue

a.Syntax    b.Semantics    c.Timing    d.None of the above

Ans:C


66.You can read input that consists of multiple lines of
test using____

a.The normal cout << combination   

b.The cin.get () function with one argument   

c.The cin.get() function with two arguments   

d.The

cin.get() function three arguments
Ans:A

67.Private datamembers can be accessed ___

a.only from the base class itself   

b.Both from its base class and its derived classes   

c.From the class which is a friend to both the
classes   

d.None

Ans:B


68.Assume a class C with objects obj1, obj2, and obj3. for
the statement obj3=obj1-obj2to work correctly the overload
operator must ____

a.take two arguments   

b.Return a value   

c.Create a named temporary object   

d.Use the object of which the operator is an operand

Ans:C


69.A carry look ahead adder is frequently used for addition because it

a.is faster    b.is more accurate    c.used fewer gates    d.costless

Ans:A


70. Which of the following will give the sum of full adder as outputs

a. three input majority circuit   

b. three bit parity checker   

c. three bit comparator  

d. three bit counter

Ans:A

71. The difference bit of a output of a half subtracter is same as

(A) sum bit output of a half adder   

(B) sum bit output of a full adder   

(C) carry bit output of a half adder   

(D) carry bit output of a full adder

Ans:B
















1 comment:

  1. Hi, Thanks for sharing. Very informative post, that I have ever read, the strategy given is really very helpful....Here I’m giving best ELITMUS ONLINE TRAINING details, once go through it.
    ELITMUS ONLINE CLASSES

    ReplyDelete