Join Us ::

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

Computer Science :: All Aptitude Test ::

Home » GAT Subject » Computer Science » Aptitude Test - 9
1.“Match will be played only if it is not a humid day.” The negation of this statement is?
A. Match will be played but it is a humid day
B. Match will be played or it is a humid day
C. All of the mentioned statement are correct
D. Match will be played but it is a humid day
2.The statement (~P<->Q)∧~Q is true when?
A. P:True Q: False
B. P:True Q:True
C. P:False Q:True
D. P:True Q: False
3.Let P, Q, R be true, false, false, respectively, which of the following is true?
A. P∧(Q∧~R)
B. (P->Q)∧~R
C. Q<->(P∧R)
D. P∧(Q∧~R)
4.The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
A. 600
B. 350
C. 650
D. 600
5.Convert the following infix expressions into its equivalent postfix expressions (A + B ⋀D)/(E – F)+G?
A. (A B D ⋀ + E F – / G +)
B. (A B D +⋀ E F – / G +)
C. (A B D ⋀ + E F/- G +)
D. (A B D ⋀ + E F – / G +)
6.Convert the following Infix expression to Postfix form using a stack x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal?
A. xyz*+pq*r+s*+
B. xyz*+pq*r+s+*
C. xyz+*pq*r+s*+
D. xyz*+pq*r+s*+
7.Which of the following is not an inherent application of stack?
A. Reversing a string
B. Evaluation of postfix expression
C. Implementation of recursion
D. Reversing a string
8.The type of expression in which operator succeeds its operands is?
A. Infix Expression
B. Prefix Expression
C. Postfix Expression
D. Infix Expression
9.If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?
A. ABCD
B. DCBA
C. DCAB
D. ABCD
10.A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
A. Queue
B. Stack
C. Tree
D. Queue
11.The data structure required for Breadth First Traversal on a graph is?
A. Stack
B. Array
C. Queue
D. Stack
12.A queue follows?
A. FIFO (First In First Out) principle
B. LIFO (Last In First Out) principle
C. Ordered array
D. FIFO (First In First Out) principle
13.Circular Queue is also known as?
A. Ring Buffer
B. Square Buffer
C. Rectangle Buffer
D. Ring Buffer
14.A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
A. Queue
B. Circular queue
C. Dequeue
D. Queue
15.A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
A. Rear = MAX_SIZE – 1
B. Front = (rear + 1)mod MAX_SIZE
C. Front = rear + 1
D. Rear = MAX_SIZE – 1
16.Queues serve major role in?
A. Simulation of recursion
B. Simulation of arbitrary linked list
C. Simulation of limited resource allocation
D. Simulation of recursion
17.Which of the following is not the type of queue?
A. Ordinary queue
B. Single ended queue
C. Circular queue
D. Ordinary queue
18.What is the addition of the binary numbers 11011011010 and 010100101?
A. 0111001000
B. 1100110110
C. 11101111111
D. 0111001000
19.Perform binary addition: 101101 + 011011 = ?
A. 011010
B. 1010100
C. 101110
D. 011010
20.Perform binary subtraction: 101111 – 010101 = ?
A. 100100
B. 010101
C. 011010
D. 100100
21.Binary subtraction of 100101 – 011110 is?
A. 000111
B. 111000
C. 010101
D. 000111
22.Perform multiplication of the binary numbers: 01001 × 01011 = ?
A. 001100011
B. 110011100
C. 010100110
D. 001100011
23.100101 × 0110 = ?
A. 1011001111
B. 0100110011
C. 101111110
D. 1011001111
24.On multiplication of (10.10) and (01.01), we get?
A. 101.0010
B. 0010.101
C. 011.0010
D. 101.0010
25.Divide the binary numbers: 111101 ÷ 1001 and find the remainder?
A. 0010
B. 1010
C. 1100
D. 0010
26.Divide the binary number (011010000) by (0101) and find the quotient?
A. 100011
B. 101001
C. 110010
D. 100011
27. Binary subtraction of 101101 – 001011 = ?
A. 100010
B. 010110
C. 110101
D. 100010
28.Which process can be affected by other processes executing in the system?
A. Cooperating process
B. Child process
C. Parent process
D. Cooperating process
29.When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called?
A. Dynamic condition
B. Race condition
C. Essential condition
D. Dynamic condition
30.If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called?
A. Mutual exclusion
B. Critical exclusion
C. Synchronous exclusion
D. Mutual exclusion
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-2025 by Pak-MCQs.net All Rights Reserved.

Email: [email protected]