Join Us ::

Menu Home Classes GK Engineering Past Papers Current Affairs Technical GAT Subject Programming Medical Papers

GAT Subject :: All Aptitude Test ::

Home » GAT Subject » Aptitude Test - 27
Hassan
1.In a priority queue, insertion and deletion takes place at ………………?
A. front, rear end
B. only at rear end
C. only at front end
D. front, rear end
2.The minimum number of multiplications and additions required to evaluate the polynomial P = 4x3+3x2-15x+45 is
A. 6 & 3
B. 4 & 2
C. 3 & 3
D. 6 & 3
3.The process of accessing data stored in a serial access memory is similar to manipulating data on a:
A. stack
B. binary tree
C. heap
D. stack
4.User perform following operations on stack of size 5 then -
A. 3
B. 4
C. 2
D. 3
5.Consider Stack is implemented using the array. What will be the initial value with which top is initialized:
A. 0
B. -1
C. Garbage
D. 0
6.Consider Stack is implemented using the array. In this implementation of stack maximum value of top which cannot cause overflow will _________.
A. 9
B. 10
C. 11
D. 9
7.In Computer generally _________ expressions are preferred:
A. Postfix
B. Infix
C. Prefix
D. Postfix
8.If the sequence of operations -
A. 2 2 1 2 2
B. 2 2 1 1 2
C. 2 1 2 2 1
D. 2 2 1 2 2
9.Adding element to stack means ___________.
A. Placing element at the rear end
B. Placing element at the front end
C. Placing element at the top
D. Placing element at the rear end
10.A common example of a queue is people waiting in line at a__________:
A. Bus stop
B. Movie hall
C. Shopping mall
D. Bus stop
11.In Breadth First Search of Graph, which of the following data structure is used?
A. Stack
B. Queue
C. Linked list
D. Stack
12.If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
A. ABCD
B. DCBA
C. DCAB
D. ABCD
13. In the array implementation of circular queue, which of the following operation take worst case linear time?
A. Insertion
B. Deletion
C. To empty a queue
D. Insertion
14.A circular queue is implemented using an array of size 10. The array index starts with 0, front is 6, and rear is 9. The insertion of next element takes place at the array index.
A. 0
B. 7
C. 9
D. 0
15. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
A. Only front pointer
B. Only rear pointer
C. Both front and rear pointer
D. Only front pointer
16.Let the following circular queue can accommodate maximum six elements with the following data.What will happen after ADD O operation takes place?
A. front = 2 rear = 5 queue = ______; L, M, N, O, ___
B. front = 3 rear = 5 queue = L, M, N, O, ___
C. front = 3 rear = 4 queue = ______; L, M, N, O, ___
D. front = 2 rear = 5 queue = ______; L, M, N, O, ___
17.Which of the following sorting algorithms does not have a worst case running time of O(n2)?
A. Insertion sort
B. Quick sort
C. Bubble sort
D. Insertion sort
18.The quick sort algorithm exploit _________ design technique:
A. Overflow
B. Backtracking
C. Dynamic Programming
D. Overflow
19.A linear list in which the last node points to the first node is ........:
A. singly linked list
B. doubly linked list
C. circular linked list
D. singly linked list
20.A ...... indicates the end of the list:
A. Guard
B. Sentinel
C. End pointer
D. Guard
21.RLINK is the pointer pointing to the......:
A. last node
B. head node
C. successor node
D. last node
22.In which of the following gates, the output is 1, if and only if at least one input is 1?
A. NOR
B. AND
C. OR
D. NOR
23. The time required for a gate or inverter to change its state is called:
A. Propagation time
B. Decay time
C. Rise time
D. Propagation time
24.The time required for a pulse to change from 10 to 90 percent of its maximum value is called:
A. Propagation time
B. Decay time
C. Rise time
D. Propagation time
25.The maximum frequency at which digital data can be applied to gate is called:
A. Operating speed
B. Propagation speed
C. Binary level transaction period
D. Operating speed
26.What is the minimum number of two-input NAND gates used to perform the function of two input OR gate ?
A. one
B. two
C. three
D. one
27.A one-to-four line demultiplexer is to be implemented using a memory. How many bits must each word have ?
A. 1 bit
B. 2 bits
C. 4 bits
D. 1 bit
28. Which table shows the logical state of a digital circuit output for every possible combination of logical states in the inputs ?
A. Function table
B. Truth table
C. Routing table
D. Function table
29.A demultiplexer is used to:
A. Route the data from single input to one of many outputs
B. Perform serial to parallel conversion
C. Both (a) & (b)
D. Route the data from single input to one of many outputs
30.How many full adders are required to construct an m-bit parallel adder ?
A. m/2
B. m-1
C. m
D. m/2
Related Subjects

Date to Date Current Affairs 2022

PakMCQs.net

Quick Links

GAT Subject



   Computer Science    English Mcqs    Agriculture    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC Papers    
Our Team | Career | Contact | JoinUs | Privacy Policy | DMC

© 2020-2024 by Pak-MCQs.net All Rights Reserved.

Email: [email protected]