You are on page 1of 4

4/25/2019

PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION: DATA STRUCTURE AND ALGORITHM MCQ'S

More Create Blog Sign In P PCCSS//CCSSSS//FFPPSSCC// GGEENNEERRAALL AABBIILLIITTYY MMCCQQ''SS TTEESSTT
More
Create Blog
Sign In
P
PCCSS//CCSSSS//FFPPSSCC// GGEENNEERRAALL AABBIILLIITTYY MMCCQQ''SS TTEESSTT WWIITTHH SSOOLLUUTTIIOONN
Computer Science MCQ's FOR PCS LECTURSHIP, CSS PREPARATION, OTHER IT PROFFESSIONAL TEST AND
MANY MORE
Total Pageviews
Wednesday, 25 January 2012
DATA STRUCTURE AND ALGORITHM MCQ'S
PCS/CSS/MCQ'S COMPUTER
2012 (54)
Which data structure allows deleting data elements from front and inserting at rear?
January (54)
a. Stacks
► ► Jan 31 (3)
b. Queues
► ► Jan 26 (3)
c. Deques
d. Binary search tree
▼ ▼ Jan 25 (48)
Basics of C++ - Objective
Questions (MCQs) Set -
2. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
5
a. Input-restricted deque
b. Output-restricted deque
Basics of C++ - Objective
Questions (MCQs)
c. Priority queues
d. None of above
Basics of C++ - Objective
Questions (MCQs)
3. Which of the following data structure is non-linear type?
Basics of C++ - Objective
Questions (MCQs)
a. Strings
b. Lists
Basics of C++ - Objective
Questions (MCQs) Set -
c. Stacks
d. None of above
1
Programming Languages
and Language Processors
Set
4. Which of the following data structure is linear type?
a. Strings
b. Lists
Programming Languages
and Language Processors
Set
c. Queues
d. All of above
Database Management
System and Design MCQ
Set 1
5. To represent hierarchical relationship between elements, which data structure is suitable?
a. Deque
b. Priority
Database Management
System and Design MCQ
Set 2
c. Tree
d. All of above
Database Management
System and Design MCQ
Set 3
6. A binary tree whose every node has either zero or two children is called
a. Complete binary tree
b. Binary search tree
Database Management
System and Design MCQ
Set 4
c. Extended binary tree
d. None of above
DATA STRUCTURE AND
ALGORITHM MCQ'S
FOR PCS
7. The depth of a complete binary tree is given by
a. D n = n log 2 n
DATA STRUCTURE AND
ALGORITHM MCQ'S
FOR IT PROFFESS
b. D n = n log 2 n+1
c. D n = log 2 n
d. D n = log 2 n+1
DATA STRUCTURE AND
ALGORITHM MCQ'S
8. When representing any algebraic expression E which uses only binary operations in a 2-tree,
NETWORKING MCQ'S FOR
PCS IT
PROFFESSIONAL
a. the variable in E will appear as external nodes and operations in internal nodes
b. the operations in E will appear as external nodes and variables in internal nodes
c. the variables and operations in E will appear only in internal nodes
NETWORKING MCQ'S FOR
d. the variables and operations in E will appear only in external nodes
PCS CANDIATES AND
OTHERS
9. A binary tree can easily be converted into q 2-tree
NETWORKING MCQ;S
a. by replacing each empty sub tree by a new internal node
WITH SOLUTION
PCS/CSS IT
b. by inserting an internal nodes for non-empty node
PROFFESS
c. by inserting an external nodes for non-empty node
MCQ;S FOR IT
PROFFESSIONAL PCS
d. by replacing each empty sub tree by a new external node
10.
When converting binary tree into extended binary tree, all the original nodes in binary tree are
MCQ' S NETWOKING FOR
PCS/ NWFP
a. internal nodes on extended tree
b. external nodes on extended tree
PCS 'MCQS PRGRAMMER
IT
c. vanished on extended tree
d. None of above
PCS MCQ COMPTER TEST
PREPARATION 2010-
2012
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
a.
ABFCDE

4/25/2019

PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION: DATA STRUCTURE AND ALGORITHM MCQ'S

 

b. ADBFEC

 

c. ABDECF

 

d. ABDCEF

PREPARATION MCQ'S
 

12. Which of the following sorting algorithm is of divide-and-conquer type?

 

a. Bubble sort

b. Insertion sort

c. Quick sort

JOB

JOB d. All of above

d. All of above

 
 

13. An algorithm that calls itself directly or indirectly is known as

 

a. Sub algorithm

b. Recursion

c. Polish notation

d. Traversal algorithm

 
 

14. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree

for efficiency. These special pointers are called

 

a. Leaf

b. branch

   

c. path

d. thread

MCQ'S FOR
 

15. The in order traversal of tree will yield a sorted listing of elements of tree in

a. Binary trees

 

b. Binary search trees

 

c. Heaps

 

d. None of above

 
   

16. In a Heap tree

 

a. Values in a node is greater than every value in left sub tree and smaller than right sub tree

b. Values in a node is greater than every value in children of it

c. Both of above conditions applies

Objective Questions - d. None of above conditions applies

d. None of above conditions applies

 

17. In a graph if e=[u, v], Then u and v are called

 

a. endpoints of e

b. adjacent nodes

c. neighbors

d. all of above

d. all of above

 

18. A connected graph T without any cycles is called

 

a. a tree graph

 

b. free tree

c. a tree

 

d. All of above

MCQS PREPARATION
 

19. In a graph if e=(u, v) means

 

a. u is adjacent to v but v is not adjacent to u

 

b. e begins at u and ends at v

c. u is processor and v is successor

d. both b and c

d. both b and c

 

20.

If every node u in G is adjacent to every other node v in G, A graph is said to be

 

a. isolated

b. complete

c. finite

MCQ'S LECTURESHIP PCS COMPUTER SCIENCE d. strongly connected

d. strongly connected

LECTURESHIP PCS COMPUTER SCIENCE d. strongly connected PCS COMPUTER MCQS Answers:   1. Which data
PCS COMPUTER MCQS Answers:

Answers:

d. strongly connected PCS COMPUTER MCQS Answers:   1. Which data structure allows deleting data
 

1.

Which data structure allows deleting data elements from front and inserting at rear?

 

b.

Queues

 

2.

Identify the data structure which allows deletions at both ends of the list but insertion at only one

end.

 
a. Input-restricted deque

a.

Input-restricted deque

 

3.

Which of the following data structure is non-linear type?

d. None of above

d.

None of above

 

4.

Which of the following data structure is linear type?

d. All of above

d.

All of above

 

5.

To represent hierarchical relationship between elements, which data structure is suitable?

c. Tree

c.

Tree

4/25/2019

PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION: DATA STRUCTURE AND ALGORITHM MCQ'S

6. A binary tree whose every node has either zero or two children is called
6.
A binary tree whose every node has either zero or two children is called
c.
Extended binary tree
7. The depth of a complete binary tree is given by
d.
D n =
log 2 n + 1
8. When representing any algebraic expression E which uses only binary operations in a 2-tree,
a.
the variable in E will appear as external nodes and operations in internal nodes
9.
A binary tree can easily be converted into q 2-tree
d.
by replacing each empty sub tree by a new external node
10.
When converting binary tree into extended binary tree, all the original nodes in binary tree are
a.
internal nodes on extended tree
11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
c.
ABDECF
12. Which of the following sorting algorithm is of divide-and-conquer type?
c.
Quick sort
13. An algorithm that calls itself directly or indirectly is known as
b.
Recursion
14. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in
the tree for efficiency. These special pointers are called
d.
thread
15. The in order traversal of tree will yield a sorted listing of elements of tree in
b.
Binary search trees
16. In a Heap tree
b.
Values in a node is greater than every value in children of it
17. In a graph if e=[u, v], Then u and v are called
d.
all of above
18. A connected graph T without any cycles is called
d.
All of above
19. In a graph if e=(u, v) means
d.
both b and c
20.
If every node u in G is adjacent to every other node v in G, A graph is said to be
b.
complete
at 23:15
No comments:
Post a Comment
Enter your comment
Comment as:
Google Accoun
PublishPublish
PreviewPreview
Newer Post
Home
Older Post
Subscribe to: Post Comments (Atom)
Popular Posts
Popular Posts
PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011
PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011
PUNJAB/KPK/NWFP/SINDH 1)Repetition of same vowel sound ? Assonance
2)The poet who used ex
Basic Computer Troubleshooting Exam
B
asic Computer Troubleshooting Exam 1. If you turn on a PC and the boot-up
process halts, giving you the message: "Non-System disk
Programming Languages and Language Processors Set MCQ
LECTURER COMPUTER SCIENCE MCQS PAPER 2011
Programming Languages and Language Processors Set 1. Questions Question
1:
Electronic spreadsheets are most useful in a situation w

4/25/2019

PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION: DATA STRUCTURE AND ALGORITHM MCQ'S

Q.1. Select the best option/answer and fill in the appropriate box on the Answer Sheet. (20) (i) AX register is also known as: (a) Acc

Basics of C++ - Objective Questions (MCQs) Set - 1 Questions Question 1. What is the correct value to return to the operating system upon the successful completion of a program?

LECTURER COMPUTER SCIENCE MCQS PAPER 2011 Q.1. Select the best option/answer and fill in the appropriate box on the Answer Sheet. (20) (i) AX register is also known as: (a) Acc

PCS LECTURESHIP COMPUTER SCIENCE MCQ S FREE 2012 To locate a data item for storage is a. Field b. Feed c. Database d. Fetch 2. programs designed to perform specific tasks is

Basic Computer Troubleshooting Exam B asic Computer Troubleshooting Exam 1. If you turn on a PC and the boot-up process halts, giving you the message: "Non-System disk

Question 1: Find out the error in following block of code. If (x = 100)

Cout <<

“x is 100”; a.

100 should be encl

 

DATA STRUCTURE AND ALGORITHM MCQ'S FOR PCS Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data

 

Questions Question 1 Streams are a. output operations in sequential media b.

Abstraction to perform input and Abs

PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011 PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011 PUNJAB/KPK/NWFP/SINDH 1)Repetition of same vowel sound ? Assonance 2)The poet who used ex

 

Question 1:

cin extraction stops execution as soon as it finds any blank space

character

a.

true b.

false

Q

 

Question 1: The void specifier is used if a function does not have return type.

a.

True b.

False Question 2: You mus

 

2012-2015 rizvi networks. Simple theme. Powered by Blogger.