## COMPUTER ENGINEERING

1) Which statement is true for logic families of digital IC’s?

A) CMOS is preferably require low power consumption in system

B) ECL requires high speed operation in system

C) MOS is suitable for circuits that need high component density

D) All of these

Ans: 4

2) Which of the following sequence is incorrect for the JK flip flop, where Qn and Qn+1 are present state and next state respectively

A) J=0 k=1 Qn=1 Qn+1=0

B) J=1 k=0 Qn=1 Qn+1=1

C) J=1 k=1 Qn=0 Qn+1=1

D) J=0 k=0 Qn=1 Qn+1=0

Ans: 4

3) Number of NAND gates required for realization of f(A,B) = A+B’C is ?

A) 3

B) 4

C) 5

D) 6

Ans: 2

4) Simplify the Boolean expression F(x,y,z) = ∑(2,3,4,5)?

A) F = x’y+xy’

B) F = x’y’+1

C) F = xy’+x’

D) None of the above

Ans: 1

5) A full adder circuit can be changed to full subtractor by adding a

A) NOR gate

B) NAND gate

C) Inverter

D) AND gate

Ans: 3

6) How many address line and I/O lines are required? If capacity of RAM is 1024 words of 8-bits.

A) 10 bit address line and 8 bit I/O lines

B) 8 bit address line and 10 bit I/O lines

C) 10 bit address line and 10 bit I/O lines

D) None of the above

Ans: 1

7) What will be output of the program given below

sum = 0;

for( i = -10; i<0; i++)

sum = sum + abs(i);

printf(“%d”,sum);

A) 500

B) -505

C) 55

D) -55

Ans: 3

8) Which is the false property of an algorithm, where П = O, Ω, or Ɵ.

A) If f(n) = П (g(n)) and g(n) = П (h(n)), then f(n) = П (h(n))

B) f(n) - g(n) = П (max{f(n), g(n)})

C) f(n) = O(g(n)) iff g(n) = Ω (f(n))

D) f(n) = Ɵ(g(n)) iff g(n) = Ɵ (f(n)

Ans: 2

9) Which statement is FALSE related to undirected graphs

A) An undirected graph is a tree if it is connected and does not contain a cycle

B) An undirected graph is connected if, for every pair of nodes u and v, there is a path from u to v.

C) In an undirected graph a path is simple if all nodes are not distinct.

D) In an undirected graph a cycle is a path v1, v2, , vk-1, vk in which v1 = vk, k > 2, and the first k-1

nodes are all distinct

Ans: 3

10) Link list is preferably not suitable for implementation of?

A) Insertion sort

B) Binary search

C) Radix sort

D) Polynomial manipulation

Ans: 2

11) The number of comparisons required to search a sorted vector of 1023 elements using the binary search algorithm is:

A) 5

B) 10

C) 15

D) 20

Ans: 2

12) What is the maximum height of any AVL tree with 7 nodes? Assume that height of a tree with a single node is 0.

A) 1

B) 2

C) 3

D) 4

Ans: 3

13) A binary search tree contains the values 3,6,10,22,25,30,60,75. The tree is traversed in preorder and the values are displayed out. Which sequence is the valid output?

A) 25,6,3,10,22,60,30,75

B) 25,6,10,3,22,75,30,60

C) 25,6,75,60,30,3,10,22

D) 75,30,60,22,10,3,6,25

Ans: 1

14) Time complexity of T(n) = T(n/3)+T(2n/3)+O(n) is ?

A) O(1)

B) O(n log n)

C) O(log n)

D) O(n2)

Ans: 2

15) What is the worst case complexity of sorting ‘n’ numbers using quick sort method?

A) θ (n)

B) θ (n log n)

C) θ (n2)

D) θ ( log n)

Ans: 3

16) Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

A) 25, 12, 16, 13, 10, 8, 14

B) 25, 14, 13, 16, 10, 8, 12

C) 25, 14, 16, 13, 10, 8, 12

D) 25, 14, 12, 13, 10, 8, 16

Ans: 3

17) To implement Dijkstra’s shortest path algorithm on unweighted graph so that it runs in linear time, the data structure to be used is ?

A) Queue

B) Stack

C) Heap

D) B-tree

Ans: 1

18) Which is not a required deadlock condition of an operating system

A) Mutual exclusion

B) Hold and wait

C) Cycle

D) Preemptive

Ans: 4

19) A CPU generally handles an interrupt by executing an interrupt service routine

A) As soon as an interrupt is raised

B) By checking the interrupt register at the end of fetch cycle

C) By checking the interrupt register at fixed time intervals

D) By checking the interrupt register after finishing the execution of the current instruction

Ans: 4

20) A process executes the code

fork( );

fork( );

fork( );

The total number of child process created is

A) 3

B) 4

C) 7

D) 8

Ans: 3

21) A memory of 1000K has what amount of user space if size of OS is 200K, and loader consumes 50K?

A) 800 K

B) 950 K

C) 750 K

D) 1150 K

Ans: 1

22) Mutual exclusive problem occurs between

A) Two disjoint processes that are unaware of each other

B) Processes that share resources

C) Processes directly aware of each other

D) All of these

Ans: 2

23) Which of the following statements is False in operating system?

A) The shortest job first(SJF) scheduling algorithm minimizes the average turn around time

B) Thrashing leads to under utilize the performance of CPU

C) Internal fragmentation can be eliminated by segmentation and paging

D) Semaphore value depends on number of resources to be shared

Ans: 3

24) Which of the following statement is true?

A) Shortest remaining time first scheduling may cause starvation

B) Preemptive scheduling may cause starvation

C) Round robin is better than FCFS in terms of response time

D) All of these

Ans: 4

25) For the 4 block per set associative memory system having 4K blocks, cache memory size is 128 blocks and each block contains 16 words the following parameters are correct

A) 4 bits Word field , 5 bits set field, 7 bits tag field

B) 5 bits Word field , 4 bits set field, 7 bits tag field

C) 5 bits Word field , 7 bits set field, 5 bits tag field

D) 5 bits Word field , 7 bits set field, 4 bits tag field

Ans: 1

26) If 32-bit addressing is used for pages whose maximum size is 512KB, what is the maximum

number of pages that can be addressed

A) 4096

B) 2048

C) 8192

D) 16384

Ans: 3

27) The electron beam in a color picture tube is refreshed to make a video realistic in seconds is?

A) 15 frames

B) 25 frames

C) 35 frames

D) 45 frames

Ans: 2

28) Which of the following is transformation that distorts the shape of an object?

A) Scaling

B) Rotation

C) Shearing

D) None of the above

Ans: 3

29) Which combinations of methods are identical and most efficient to plot pixel positions along a straight line path?

A) DDA and Bresenham’s algorithm

B) Mid-point and Bresenham’s algorithm

C) DDA and Mid-point algorithm

D) All of the above

Ans: 2

30) Which algorithms are used to fill the interior of objects with covered boundaries?

A) The scan line algorithm

B) Boundary-fill algorithm

C) Flood-fill algorithm

D) All of the above

Ans: 4

31) The maximum number of points that can be displayed without overlap on CRT is referred to as?

A) Resolution

B) Persistence

C) Aspect ratio

D) Pixels

Ans: 1

32) Which of the following is not for line clipping?

A) Cohen-Sutherland algorithm

B) Nicholl-Lee-Nicholl algorithm

C) Liang Barsky Algorithm

D) Sutherland-Hodgeman Algorithm

Ans: 4

33) The Painter's Algorithm is based on the following property?

A) Polygon

B) Frame buffer

C) Depth buffer

D) Surface buffer

Ans: 3

34) Which algorithm uses only integer arithmetic ?

A) DDA

B) Beam Penetration

C) Bresenham's

D) None of these

Ans: 3

35) A RTP packet is encapsulated in _______.

A) a UDP user datagram

B) a TCP segment

C) an IP datagram

D) None of the above

Ans: 1

36) In a real-time video conference, data from the server is _______ to the client sites.

A) Unicast

B) Multicast

C) Broadcast

D) None of the above

Ans: 2

37) Which is used to compress video

A) MPEG

B) JPEG

C) MPEG and JPEG

D) None of the above

Ans: 1

38) Vanishing Points are used in

A) Composite transformations

B) Clipping

C) Conversing points in perspective projections

D) None of these

Ans: 3

39) MIMD is used employed to achieveA)

computation

B) parallelism

C) pipelining

D) distribution

Ans: 2

40) The addition of 4-bit , two’s complement, binary numbers 1101 and 0100 results in

A) 0001 and an overflow

B) 1001 and no overflow

C) 0001 and no overflow

D) 1001 and an overflow

Ans: 3

41) For any relation of the functional dependency FD is A → B , DB → C then

A) B → A

B) DA → C

C) DB → A

D) C → A

Ans: 2

42) In order to maintain the consistency during transactions database provides

A) Commit

B) Atomic

C) Flashback

D) Rollback

Ans: 4

43) Following Functional Dependencies hold on R(A, B, C) as A→BC, B→CA, C→AB which is a combination of candidate keys

A) {A},{B},{C}

B) {A},{B}

C) {B},{C}

D) {C},{A}

Ans: 1

44) What is the output of the following query SELECT TRUNC(5234.5678,-2) FROM DUAL;?

A) 5200

B) 5230

C) 5230.00

D) 5234.5600

Ans: 1

45) The correct SQL statement for creating an index is?

A) INDEX ID;

B) INDEX ON ID;

C) CREATE INDEX ON ID;

D) CREATE INDEX ID;

Ans: 3

46) Which of the following concurrency control schemes is not based on the serializability property?

A) Time-stamp based locking

B) Graph-based locking

C) Two – phase locking

D) None of these

Ans: 4

47) The state of a virtual table in SQL that is constructed from other table?

A) A Schema

B) A view

C) A Log buffer

D) A Window

Ans: 2

48) Which of the following is used to store movie and image files in the database?

A) Clob

B) Blob

C) Binary

D) Image

Ans: 2

49) Bucket is a unit of disk contiguous block contains multiple records. Which of the following technique is used to control bucket overflow:

A) Closed hashing

B) Open hashing

C) multiple hashing

D) All of these

Ans: 4

50) OLAP stands for

A) Online analytical processing

B) Online analysis processing

C) Online transaction processing

D) Online aggregate processing

Ans: 1

A) CMOS is preferably require low power consumption in system

B) ECL requires high speed operation in system

C) MOS is suitable for circuits that need high component density

D) All of these

Ans: 4

2) Which of the following sequence is incorrect for the JK flip flop, where Qn and Qn+1 are present state and next state respectively

A) J=0 k=1 Qn=1 Qn+1=0

B) J=1 k=0 Qn=1 Qn+1=1

C) J=1 k=1 Qn=0 Qn+1=1

D) J=0 k=0 Qn=1 Qn+1=0

Ans: 4

3) Number of NAND gates required for realization of f(A,B) = A+B’C is ?

A) 3

B) 4

C) 5

D) 6

Ans: 2

4) Simplify the Boolean expression F(x,y,z) = ∑(2,3,4,5)?

A) F = x’y+xy’

B) F = x’y’+1

C) F = xy’+x’

D) None of the above

Ans: 1

5) A full adder circuit can be changed to full subtractor by adding a

A) NOR gate

B) NAND gate

C) Inverter

D) AND gate

Ans: 3

6) How many address line and I/O lines are required? If capacity of RAM is 1024 words of 8-bits.

A) 10 bit address line and 8 bit I/O lines

B) 8 bit address line and 10 bit I/O lines

C) 10 bit address line and 10 bit I/O lines

D) None of the above

Ans: 1

7) What will be output of the program given below

sum = 0;

for( i = -10; i<0; i++)

sum = sum + abs(i);

printf(“%d”,sum);

A) 500

B) -505

C) 55

D) -55

Ans: 3

8) Which is the false property of an algorithm, where П = O, Ω, or Ɵ.

A) If f(n) = П (g(n)) and g(n) = П (h(n)), then f(n) = П (h(n))

B) f(n) - g(n) = П (max{f(n), g(n)})

C) f(n) = O(g(n)) iff g(n) = Ω (f(n))

D) f(n) = Ɵ(g(n)) iff g(n) = Ɵ (f(n)

Ans: 2

9) Which statement is FALSE related to undirected graphs

A) An undirected graph is a tree if it is connected and does not contain a cycle

B) An undirected graph is connected if, for every pair of nodes u and v, there is a path from u to v.

C) In an undirected graph a path is simple if all nodes are not distinct.

D) In an undirected graph a cycle is a path v1, v2, , vk-1, vk in which v1 = vk, k > 2, and the first k-1

nodes are all distinct

Ans: 3

10) Link list is preferably not suitable for implementation of?

A) Insertion sort

B) Binary search

C) Radix sort

D) Polynomial manipulation

Ans: 2

11) The number of comparisons required to search a sorted vector of 1023 elements using the binary search algorithm is:

A) 5

B) 10

C) 15

D) 20

Ans: 2

12) What is the maximum height of any AVL tree with 7 nodes? Assume that height of a tree with a single node is 0.

A) 1

B) 2

C) 3

D) 4

Ans: 3

13) A binary search tree contains the values 3,6,10,22,25,30,60,75. The tree is traversed in preorder and the values are displayed out. Which sequence is the valid output?

A) 25,6,3,10,22,60,30,75

B) 25,6,10,3,22,75,30,60

C) 25,6,75,60,30,3,10,22

D) 75,30,60,22,10,3,6,25

Ans: 1

14) Time complexity of T(n) = T(n/3)+T(2n/3)+O(n) is ?

A) O(1)

B) O(n log n)

C) O(log n)

D) O(n2)

Ans: 2

15) What is the worst case complexity of sorting ‘n’ numbers using quick sort method?

A) θ (n)

B) θ (n log n)

C) θ (n2)

D) θ ( log n)

Ans: 3

16) Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

A) 25, 12, 16, 13, 10, 8, 14

B) 25, 14, 13, 16, 10, 8, 12

C) 25, 14, 16, 13, 10, 8, 12

D) 25, 14, 12, 13, 10, 8, 16

Ans: 3

17) To implement Dijkstra’s shortest path algorithm on unweighted graph so that it runs in linear time, the data structure to be used is ?

A) Queue

B) Stack

C) Heap

D) B-tree

Ans: 1

18) Which is not a required deadlock condition of an operating system

A) Mutual exclusion

B) Hold and wait

C) Cycle

D) Preemptive

Ans: 4

19) A CPU generally handles an interrupt by executing an interrupt service routine

A) As soon as an interrupt is raised

B) By checking the interrupt register at the end of fetch cycle

C) By checking the interrupt register at fixed time intervals

D) By checking the interrupt register after finishing the execution of the current instruction

Ans: 4

20) A process executes the code

fork( );

fork( );

fork( );

The total number of child process created is

A) 3

B) 4

C) 7

D) 8

Ans: 3

21) A memory of 1000K has what amount of user space if size of OS is 200K, and loader consumes 50K?

A) 800 K

B) 950 K

C) 750 K

D) 1150 K

Ans: 1

22) Mutual exclusive problem occurs between

A) Two disjoint processes that are unaware of each other

B) Processes that share resources

C) Processes directly aware of each other

D) All of these

Ans: 2

23) Which of the following statements is False in operating system?

A) The shortest job first(SJF) scheduling algorithm minimizes the average turn around time

B) Thrashing leads to under utilize the performance of CPU

C) Internal fragmentation can be eliminated by segmentation and paging

D) Semaphore value depends on number of resources to be shared

Ans: 3

24) Which of the following statement is true?

A) Shortest remaining time first scheduling may cause starvation

B) Preemptive scheduling may cause starvation

C) Round robin is better than FCFS in terms of response time

D) All of these

Ans: 4

25) For the 4 block per set associative memory system having 4K blocks, cache memory size is 128 blocks and each block contains 16 words the following parameters are correct

A) 4 bits Word field , 5 bits set field, 7 bits tag field

B) 5 bits Word field , 4 bits set field, 7 bits tag field

C) 5 bits Word field , 7 bits set field, 5 bits tag field

D) 5 bits Word field , 7 bits set field, 4 bits tag field

Ans: 1

26) If 32-bit addressing is used for pages whose maximum size is 512KB, what is the maximum

number of pages that can be addressed

A) 4096

B) 2048

C) 8192

D) 16384

Ans: 3

27) The electron beam in a color picture tube is refreshed to make a video realistic in seconds is?

A) 15 frames

B) 25 frames

C) 35 frames

D) 45 frames

Ans: 2

28) Which of the following is transformation that distorts the shape of an object?

A) Scaling

B) Rotation

C) Shearing

D) None of the above

Ans: 3

29) Which combinations of methods are identical and most efficient to plot pixel positions along a straight line path?

A) DDA and Bresenham’s algorithm

B) Mid-point and Bresenham’s algorithm

C) DDA and Mid-point algorithm

D) All of the above

Ans: 2

30) Which algorithms are used to fill the interior of objects with covered boundaries?

A) The scan line algorithm

B) Boundary-fill algorithm

C) Flood-fill algorithm

D) All of the above

Ans: 4

31) The maximum number of points that can be displayed without overlap on CRT is referred to as?

A) Resolution

B) Persistence

C) Aspect ratio

D) Pixels

Ans: 1

32) Which of the following is not for line clipping?

A) Cohen-Sutherland algorithm

B) Nicholl-Lee-Nicholl algorithm

C) Liang Barsky Algorithm

D) Sutherland-Hodgeman Algorithm

Ans: 4

33) The Painter's Algorithm is based on the following property?

A) Polygon

B) Frame buffer

C) Depth buffer

D) Surface buffer

Ans: 3

34) Which algorithm uses only integer arithmetic ?

A) DDA

B) Beam Penetration

C) Bresenham's

D) None of these

Ans: 3

35) A RTP packet is encapsulated in _______.

A) a UDP user datagram

B) a TCP segment

C) an IP datagram

D) None of the above

Ans: 1

36) In a real-time video conference, data from the server is _______ to the client sites.

A) Unicast

B) Multicast

C) Broadcast

D) None of the above

Ans: 2

37) Which is used to compress video

A) MPEG

B) JPEG

C) MPEG and JPEG

D) None of the above

Ans: 1

38) Vanishing Points are used in

A) Composite transformations

B) Clipping

C) Conversing points in perspective projections

D) None of these

Ans: 3

39) MIMD is used employed to achieveA)

computation

B) parallelism

C) pipelining

D) distribution

Ans: 2

40) The addition of 4-bit , two’s complement, binary numbers 1101 and 0100 results in

A) 0001 and an overflow

B) 1001 and no overflow

C) 0001 and no overflow

D) 1001 and an overflow

Ans: 3

41) For any relation of the functional dependency FD is A → B , DB → C then

A) B → A

B) DA → C

C) DB → A

D) C → A

Ans: 2

42) In order to maintain the consistency during transactions database provides

A) Commit

B) Atomic

C) Flashback

D) Rollback

Ans: 4

43) Following Functional Dependencies hold on R(A, B, C) as A→BC, B→CA, C→AB which is a combination of candidate keys

A) {A},{B},{C}

B) {A},{B}

C) {B},{C}

D) {C},{A}

Ans: 1

44) What is the output of the following query SELECT TRUNC(5234.5678,-2) FROM DUAL;?

A) 5200

B) 5230

C) 5230.00

D) 5234.5600

Ans: 1

45) The correct SQL statement for creating an index is?

A) INDEX ID;

B) INDEX ON ID;

C) CREATE INDEX ON ID;

D) CREATE INDEX ID;

Ans: 3

46) Which of the following concurrency control schemes is not based on the serializability property?

A) Time-stamp based locking

B) Graph-based locking

C) Two – phase locking

D) None of these

Ans: 4

47) The state of a virtual table in SQL that is constructed from other table?

A) A Schema

B) A view

C) A Log buffer

D) A Window

Ans: 2

48) Which of the following is used to store movie and image files in the database?

A) Clob

B) Blob

C) Binary

D) Image

Ans: 2

49) Bucket is a unit of disk contiguous block contains multiple records. Which of the following technique is used to control bucket overflow:

A) Closed hashing

B) Open hashing

C) multiple hashing

D) All of these

Ans: 4

50) OLAP stands for

A) Online analytical processing

B) Online analysis processing

C) Online transaction processing

D) Online aggregate processing

Ans: 1

__Computer Application__- Computer Application- Page 1
__Computer Science____Computer Science- Page 1____Computer Science- Page 2____Computer Science- Page 3____Computer Science- Page 4____Computer Science- Page 5____Computer Science- Page 6__-
__Computer Science- Page 7__ __Computer Science- Page 8__-
__Computer Science- Page 9__ __Computer Science- Page 10____Computer Science- Page 11____Computer Science- Page 12____Computer Science- Page 13____Computer Science- Page 14____Computer Science- Page 15__