0 of 20 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
Information
Quiz Description :
Name: Data Structure question answers test – 1
Subject: Data Structure
Topic: Basics Mix
Questions: 20 Objective type
Time Allowed: 15 Minutes
Important for: Computer Science, Information Technology, Electronics and Communication Engineering Students for semester exam, GATE, competitions and job interviews.
You have already completed the Test before. Hence you can not start it again.
Test is loading...
You must sign in or sign up to start the Test.
You have to finish following quiz, to start this Test:
Congratulations!!!" Data Structure question answers test  1 "
0 of 20 questions answered correctly
Your time:
Time has elapsed
Your Final Score is : 0
You have attempted : 0
Number of Correct Questions : 0 and scored 0
Number of Incorrect Questions : 0 and Negative marks 0
Average score  
Your score 

Not categorized
You have attempted: 0
Number of Correct Questions: 0 and scored 0
Number of Incorrect Questions: 0 and Negative marks 0
It’s time to share this quiz with your friends on Facebook, Twitter, Google Plus, Whatsapp or LinkedIn…
Click on View Questions Button to check Correct and incorrect answers.
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 Answered
 Review
 Question 1 of 20
1. Question
1 pointsWhich of the following is not belong to the symbolic category of DFD
CorrectIncorrectUnattempted  Question 2 of 20
2. Question
1 pointsThe initial configuration of a queue is a, b, c, d, (‘a’ is in the front end). To get the configuration d, c, b, a, one needs a minimum of
CorrectIncorrectUnattempted  Question 3 of 20
3. Question
1 pointsStructured design produces computer programs that are
CorrectIncorrectUnattempted  Question 4 of 20
4. Question
1 pointsHow many numbers of possible ordered trees with 3 nodes P, Q, R is
CorrectIncorrectUnattempted  Question 5 of 20
5. Question
1 pointsWhich of the following includes in turnkey package?
CorrectIncorrectUnattempted  Question 6 of 20
6. Question
1 pointsHow many number of swapping needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is
CorrectIncorrectUnattempted  Question 7 of 20
7. Question
1 pointsAn example of hierarchical data structure is
CorrectIncorrectUnattempted  Question 8 of 20
8. Question
1 pointsConsider two sorted list of size ‘m’ and ‘n’ respectively. How many number of comparisons needed in the worst case by the merge sort algorithm will be
CorrectIncorrectUnattempted  Question 9 of 20
9. Question
1 pointsWhich of the following is not a part of Data flow diagram?
CorrectIncorrectUnattempted  Question 10 of 20
10. Question
1 pointsIf the sequence of operations –push(1), push(2), Pop, Push(1), push(2), Pop, Pop, Pop, Push(2), Pop, are performed on a stack, the sequence of popped out values are
CorrectIncorrectUnattempted  Question 11 of 20
11. Question
1 pointsIn which manner a developer doing coding and testing phase
CorrectIncorrectUnattempted  Question 12 of 20
12. Question
1 pointsA binary tree in which every nonleaf node has nonempty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves
CorrectIncorrectUnattempted  Question 13 of 20
13. Question
1 pointsA word processor designed for programmers is called
CorrectIncorrectUnattempted  Question 14 of 20
14. Question
1 pointsWhat is the depth of a complete binary tree with ‘n’ nodes is (log is to the base two)
CorrectIncorrectUnattempted  Question 15 of 20
15. Question
1 pointsWhich of the following order is similar to the preorder function?
CorrectIncorrectUnattempted  Question 16 of 20
16. Question
1 pointsWhich of the following primary tool that used in structured design?
CorrectIncorrectUnattempted  Question 17 of 20
17. Question
1 pointsWhich traversal technique lists the nodes of a binary search tree in ascending order?
CorrectIncorrectUnattempted  Question 18 of 20
18. Question
1 pointsWhat is the average successful search time taken by binary search on a sorted array of 10 items?
CorrectIncorrectUnattempted  Question 19 of 20
19. Question
1 pointsA hash function f defined as f(key) = key mod 7, with linear probing, is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0 to 6. What will be the location of key 11?
CorrectIncorrectUnattempted  Question 20 of 20
20. Question
1 pointsWhat is the average successful search time for sequential search on ‘n’ items is
CorrectIncorrectUnattempted