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

PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION


Computer Science MCQ's FOR PCS LECTURSHIP, CSS PREPARATION, OTHER IT PROFFESSIONAL TEST AND
MANY MORE

Total Pageviews Wednesday, 25 January 2012

PCS/CSS/MCQ'S COMPUTER DATA STRUCTURE AND ALGORITHM MCQ'S



▼ 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

▼ Jan 25 (48) d. Binary search tree
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
Basics of C++ - Objective
b. Output-restricted deque
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
a. Strings
Questions (MCQs)
b. Lists
Basics of C++ - Objective c. Stacks
Questions (MCQs) Set -
1... d. None of above

Programming Languages
4. Which of the following data structure is linear type?
and Language Processors
Set ... a. Strings
b. Lists
Programming Languages
and Language Processors c. Queues
Set ... d. All of above
Database Management
System and Design MCQ 5. To represent hierarchical relationship between elements, which data structure is suitable?
Set 1 a. Deque
Database Management
b. Priority
System and Design MCQ c. Tree
Set 2 d. All of above
Database Management
System and Design MCQ 6. A binary tree whose every node has either zero or two children is called
Set 3 a. Complete binary tree
Database Management b. Binary search tree
System and Design MCQ c. Extended binary tree
Set 4
d. None of above
DATA STRUCTURE AND
ALGORITHM MCQ'S 7. The depth of a complete binary tree is given by
FOR PCS
a. Dn = n log2n
DATA STRUCTURE AND b. Dn = n log2n+1
ALGORITHM MCQ'S
FOR IT PROFFESS... c. Dn = log2n
d. Dn = log2n+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 a. the variable in E will appear as external nodes and operations in internal nodes
PROFFESSIONAL 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
PCS CANDIATES AND d. the variables and operations in E will appear only in external nodes
OTHERS
9. A binary tree can easily be converted into q 2-tree
NETWORKING MCQ;S
WITH SOLUTION a. by replacing each empty sub tree by a new internal node
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 d. by replacing each empty sub tree by a new external node
PROFFESSIONAL PCS
MCQ' S NETWOKING FOR 10. When converting binary tree into extended binary tree, all the original nodes in binary tree are
PCS/ NWFP a. internal nodes on extended tree
PCS 'MCQS PRGRAMMER b. external nodes on extended tree
IT c. vanished on extended tree
PCS MCQ COMPTER TEST
d. None of above
PREPARATION 2010-
2012 11. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
a. ABFCDE

https://mcqspcs.blogspot.com/2012/01/data-structure-and-algorithm-mcqs.html 1/4
4/25/2019 PCS/CSS/FPSC/ GENERAL ABILITY MCQ'S TEST WITH SOLUTION: DATA STRUCTURE AND ALGORITHM MCQ'S
MCQ'PAKISTAN PCS EXAM b. ADBFEC
2011 c. ABDECF
CSS/PCS EXAM d. ABDCEF
PREPARATION MCQ'S
MCQ'S
12. Which of the following sorting algorithm is of divide-and-conquer type?
PCS/CSS/LECTURSHIP a. Bubble sort
b. Insertion sort
MCQ;S FOE
PCS/FPSC/LECTURSHIP c. Quick sort
JOB d. All of above
PCS\CSS\LECTURSHIP
MCQ COMPUTER 13. An algorithm that calls itself directly or indirectly is known as
SCIENCE a. Sub algorithm
PCS MCQ'S LECTURSHIP b. Recursion
COMPUTERSCIENCE c. Polish notation
2010-2012 d. Traversal algorithm
MCQ;S PCS/CSS
PAKISTAN 14. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree
MCQ'S FOR ALL TEST 2011 for efficiency. These special pointers are called
a. Leaf
MCQ'S PCS LECTURSHIP
b. branch
LEARN MCQ'S PCS/CSS c. path
2011
d. thread
MCQ'S FOR
PCS/CSS/FPSC/KPK/PU 15. The in order traversal of tree will yield a sorted listing of elements of tree in
NJAB/SINDH/
a. Binary trees
MCQ,S PCS 2011-12 b. Binary search trees
MCQ;S PCS TEST c. Heaps
d. None of above
MCQ,S WITH SOLUTION
PCS LECTURSHIP
16. In a Heap tree
PREPARATION IT TEST
a. Values in a node is greater than every value in left sub tree and smaller than right sub tree
MCQS PCS/FPSC 2010-
2012 b. Values in a node is greater than every value in children of it
c. Both of above conditions applies
Objective Questions -
Multiple Choice Questions d. None of above conditions applies
- ...
17. In a graph if e=[u, v], Then u and v are called
MCQS WITH SOLUTION
PCS/CSS/IT EXPERT a. endpoints of e
FPSC 2011 b. adjacent nodes
LECTURSHIP PCS/OTHER c. neighbors
IT TEST MCQ,S d. all of above
PCS MCQ,S 2010/2011
18. A connected graph T without any cycles is called
PCS LECTURESHIP a. a tree graph
COMPUTER SCIENCE
MCQ S FREE 2012
b. free tree
c. a tree
PCS/CSS/DATAENTRY
d. All of above
MCQS PREPARATION
MCQS WITH SOLUTION 19. In a graph if e=(u, v) means
FOR PCS
NWFP/PUNJAB/SINDH
a. u is adjacent to v but v is not adjacent to u
b. e begins at u and ends at v
Computer Fundamentals -
c. u is processor and v is successor
Objective Questions
(MCQ) ... d. both b and c
NETWORK MCQS ENTRY
20. If every node u in G is adjacent to every other node v in G, A graph is said to be
TEST PCS/CSS
a. isolated
MCQ S COMPUTER
b. complete
SCIENCE ABILITY TEST
PREPARATION 20... c. finite
d. strongly connected
MCQ'S LECTURESHIP PCS
COMPUTER SCIENCE
PCS COMPUTER MCQS

Answers:

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

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


d. None of above

4. Which of the following data structure is linear type?


d. All of above

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


c. Tree

https://mcqspcs.blogspot.com/2012/01/data-structure-and-algorithm-mcqs.html 2/4
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
c. Extended binary tree

7. The depth of a complete binary tree is given by


d. Dn = log2n + 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

Publish Preview

Newer Post Home Older Post

Subscribe to: Post Comments (Atom)

Popular Posts Popular Posts

PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011 Basic Computer Troubleshooting Exam
PCS/FPSC/ ENGLISH LECTURER PAPER MCQS 2011 B asic Computer Troubleshooting Exam 1. If you turn on a PC and the boot-up
PUNJAB/KPK/NWFP/SINDH 1)Repetition of same vowel sound ? Assonance process halts, giving you the message: "Non-System disk...
2)The poet who used ex...
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...

https://mcqspcs.blogspot.com/2012/01/data-structure-and-algorithm-mcqs.html 3/4
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
PCS LECTURESHIP COMPUTER SCIENCE MCQ S FREE 2012 system upon the successful completion of a program? A. ...
To locate a data item for storage is a. Field b. Feed c. Database d. Fetch 2.
programs designed to perform specific tasks is ... LECTURER COMPUTER SCIENCE MCQS PAPER 2011
Q.1. Select the best option/answer and fill in the appropriate box on the Answer
Basic Computer Troubleshooting Exam Sheet. (20) (i) AX register is also known as: (a) Acc...
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... Basics of C++ - Objective Questions (MCQs)
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 ...

Basics of C++ - Objective Questions (MCQs) Set - 5


Questions Question 1 Streams are a. Abstraction to perform input and
output operations in sequential media b. 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...

Basics of C++ - Objective Questions (MCQs)


Question 1: cin extraction stops execution as soon as it finds any blank space
character a. true b. false Q...

Basics of C++ - Objective Questions (MCQs)


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.

https://mcqspcs.blogspot.com/2012/01/data-structure-and-algorithm-mcqs.html 4/4