# Question Bank on Computer Science and Engineering

Interested users can download the **Question Bank on Computer Science and Engineering** from the links enclosed below. Download the Last 5 Years Question Bank on Computer Science and Engineering Solved along with the Answers of each question.

This Question Bank on Computer Science and Engineering may vary from the Actual paper. Use the Question Bank on Computer Science and Engineering as a reference for the exam preparation. Check the Question Bank on Computer Science and Engineering from this page.

At the bottom of this page, you will find ‘Click here links’ for downloading the Question Bank on Computer Science and Engineering. Click on the required link & download your related Question Bank on Computer Science and Engineering to make as a reference for your scheduled preparation.

Computer Science and Engineering Question Bank

1. The number of different spanning trees in complete graph of four vertices is__________

(a) 14

(b) 15

(c) 16

(d) 17

2. The Floyd-Warshall all-pairs shortest path algorithm for finding the shortest distances between nodes in a graph is an example of:

(a) A Dynamic Programming

(b) A Greedy Algorithm

(c) A divide and conquer technique

(d) Branch and bound technique

3. A __________ point of a fuzzy set A is a point x X at which μA(x) = 0.5

(a) Core

(b) Support

(c) Cross-over

(d) a-Cut

4. Which of the following is/are the operations performed by kruskal’s algorithm in a graph G

i) sort the edges of G in increasing order by length

ii) keep a subgraph S of G initially empty

iii) builds a tree one vertex at a time

(a) i, and ii only

(b) ii and iii only

(c) i and iii only

(d) all i, ii and iii

5. Dijkstra algorithm is also called the __________ shortest path problem.

(a) multiple source

(b) single source

(c) single destination

(d) multiple destination

6. Given that a0 = 1, an = n + (_1)nan – 1 for n 2. What is the value of a4?

(a) 1

(b) 4

(c) 5

(d) 8

7. A cycle on n vertices of a graph is isomorphic to its complement. The value of n is

(a) 2

(b) 4

(c) 6

(d) 5

8. The height h(A) of a fuzzy set A is defined as h(A) =sup A(x) where x belongs to A. Then the fuzzy set A is called normal when

(a) h(A)=0

(b) h(A)<0

(c) h(A)=1

(d) h(A)<1

9. Which of the given are correct?

(a) Moore machine has 6-tuples

(b) Mealy machine has 6-tuples

(c) Both Mealy and Moore has 6-tuples

(d) None of these

10. The minimum number of states required to recognize an octal number divisible by 3 are/is

(a) 1

(b) 3

(c) 5

(d) 7

11. A Language for which no DFA exist is a__________

(a) Regular Language

(b) Non-Regular Language

(c) May be Regular

(d) Cannot be said

12. A DFA cannot be represented in the following format

(a) Transition graph

(b) Transition Table

(c) C code

(d) None of these

13. Which of the following is an application of Finite Automaton?

(a) Compiler Design

(b) Grammar Parsers

(c) Text Search

(d) All of these

14. It is less complex to prove the closure properties over regular languages using

(a) NFA

(b) DFA

(c) PDA

(d) Can’t be said

15. Which data structures find their applications in BFS and DFS Traversal mechanisms on a Tree respectively?

(a) Graph & Stack

(b) Queue & Stack

(c) Queue & Graph

(d) None of these

16. Which is the correct algorithmic sequence for the conversion of an expression from Infix to Prefix?

i. Change of every ‘(‘ (opening bracket) by ‘)’ (closing bracket) and vice-versa.

ii. Reversal of an infix expression.

iii. Conversion of the modified expression into postfix form.

iv. Reversal of postfix expression.

(a) i, ii, iii, iv

(b) iii, i,iv, ii

(c) ii ,i, iii, iv

(d) iv, ii, i, iii

17. Which of the following is the Worst-case running time of Quick Sort?

(a) O (n log n)

(b) O (n2)

(c) O (log n)

(d) O (n2 / 4)

18. What would happen if the balance factor of a node in an AVL tree is ‘1’?

(a) Heights of left and right subtrees become equal

(b) Height of left subtree is one more than the height of right subtree

(c) Height of left subtree is one less than the height of right tree

(d) None of these

19. In a max-heap the element with the greatest key is always located in which node?

(a) Leaf

(b) Root

(c) first node of left sub tree

(d) first node of right sub tree

20. Preorder and inorder of a binary tree is given

Preorder —— A B D H E C F I G J K

Inorder —— D H B E A I F C J G K

What will be the postorder?

(a) H D E B I F J K G C A

(b) H D E B F I J K G C A

(c) H D E B I F J K CG A

(d) None of these

21. Leaves of which of the following trees are at the same level?

(a) Binary tree

(b) B-tree

(c) AVL-tree

(d) Normal Tree

22. What sorting algorithm have their best and worst case times equal?

(a) heap sort and selection sort

(b) insersition sort & merge sort

(c) merge sort and heap sort

(d) None of these

23. In order to get the information stored in a Binary Search Tree in the descending order, one should traverse it in which of the following order?

(a) left, root, right

(b) root, left, right

(c) right, root, left

(d) right, left, root

24. For an array containing 8 elements as : 42 29 75 11 65 58 60 18 what will be the result of sorting in ascending order using bubble sort after 2 passes have completed?

(a) 11 29 42 18 58 60 65 75

(b) 29 42 11 65 58 60 18 75

(c) 11 29 42 58 18 60 65 75

(d) 29 11 42 58 60 18 65 75

## More Question Set on Computer Science and Engineering

Model Question | Old Question |

Sample Papers | Mock Test |

Practice Set | Question Bank |

Important Questions | Test Papers |

Typical Questions | Selected Questions |

25. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

(a) ne

(b) 2n

(c) 2e

(d) en

26. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

(a) O(n)

(b) O(e)

(c) O(e+n)

(d) O(e2)

27. What are the disadvantages of arrays?

(a) We must know before hand how many elements will be there in the array

(b) There are chances of wastage of memory space if elements inserted in an array are lesser than than the allocated size

(c) Insertion and deletion becomes tedious

(d) All of these

28. What is a sparse array?

(a) Data structure for representing arrays of records

(b) Data structure that compactly stores bits

(c) An array in which most of the elements have the same value

(d) None of these

29. In the following scenarios, when will you use selection sort?

(a) The input is already sorted

(b) A large file has to be sorted

(c) Large values need to be sorted with small keys

(d) Small values need to be sorted with large keys

30. What is the disadvantage of selection sort?

(a) It requires auxiliary memory

(b) It is not scalable

(c) It can be used for small keys

(d) None of these

31. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,

(a) 5 and 4

(b) 1 and 4

(c) 0 and 4

(d) 4 and 1

32. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

(a) 4

(b) 2

(c) 1

(d) 0

33. QuickSort can be categorized into which of the following?

(a) Brute Force technique

(b) Divide and conquer

(c) Greedy algorithm

(d) Dynamic programming

34. The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent partitioning?

(a) 1 and 6

(b) 6 and 1

(c) 2 and 6

(d) None of these

35. What is the need for a circular queue?

(a) effective usage of memory

(b) easier computations

(c) all of these

(d) none of these

36. What is the space complexity of a linear queue having n elements?

(a) O(n)

(b) O(nlogn)

(c) O(logn)

(d) O(1)

37. What is the best case complexity in building a heap?

(a) O(nlogn)

(b) O(n2)

(c) O(n*longn *logn)

(d) O(n)

38. What is the location of parent node for any arbitary node I in a queue?

(a) (i/2) position

(b) (i+1)/ position

(c) floor(i/2) position

(d) ceil(i/2) position

39. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

(a) LinkList

(b) Stack

(c) Queue

(d) Tree

40. Which of the following memories uses one transistor and one capacitor as basic memory unit?

(a) SRAM

(b) DRAM

(c) Flash Memory

(d) Both SRAM and DRAM

41. In which region a transistor acts as an open switch?

(a) cut off region

(b) inverted region

(c) active region

(d) saturated region

42. In an SR latch built from NOR gates, which condition is not allowed

(a) S = 0, R = 0

(b) S = 0, R = 1

(c) S = 1, R = 0

(d) S = 1, R = 1

43. In the toggle mode, a JK flip-flop has

(a) J = 0, K = 0

(b) J = 1, K = 1

(c) J = 0, K = 1

(d) J = 1, K = 0

44. How many 3-line-to-8-line decoders are required for a 1-of-32 decoder?

(a) 1

(b) 2

(c) 4

(d) 8

45. Which of the following statements accurately represents the two BEST methods of logic circuit simplification?

(a) Karnaugh mapping and circuit waveform analysis

(b) Boolean algebra and Karnaugh mapping

(c) Actual circuit trial and error evaluation and waveform analysis

(d) Boolean algebra and actual circuit trial and error evaluation

46. The binary numbers A = 1100 and B = 1001 are applied to the inputs of a comparator. What are the output levels?

(a) A > B = 1, A < B = 0, A < B = 1

(b) A > B = 0, A < B = 1, A = B = 0

(c) A > B = 1, A < B = 0, A = B = 0

(d) A > B = 0, A < B = 1, A = B = 1

47. To operate correctly, starting a ring counter requires:

(a) clearing one flip-flop and presetting all the others.

(b) clearing all the flip-flops.

(c) presetting one flip-flop and clearing all the others.

(d) presetting all the flip-flops.

48. A full-adder has a Cin = 0. What are the sum (S) and the carry (Cout) when A = 1 and B = 1?

(a) S = 0, Cout = 0

(b) S = 0, Cout = 1

(c) S = 1, Cout = 0

(d) S = 1, Cout = 1

49. What should be done to unused inputs on TTL gates?

(a) They should be left disconnected so as not to produce a load on any of the other circuits and to minimize power loading on the voltage source.

(b) All unused gates should be connected together and tied to V through a 1k W resistor.

(c) All unused inputs should be connected to an unused output; this will ensure compatible loading on both the unused inputs and unused outputs.

(d) Unused AND and NAND inputs should be tied to VCC through a 1 k W resistor; unused OR and NOR inputs should be grounded.

50. Which of the following summarizes the important features of ECL?

(a) Low noise margin, low output voltage swing, negative voltage operation, fast, and high power consumption

(b) Good noise immunity, negative logic, high frequency capability, low power dissipation, and short propagation time

(c) Slow propagation time, high frequency response, low power consumption, and high output voltage swings

(d) Poor noise immunity, positive supply voltage operation, good low frequency operation, and low power