Scribd
Upload
12 views

Quiz # 01: Name . Roll. No. .

The document contains a 10 question quiz on data structures and algorithms topics including: 1) Hashing functions and collision resolution schemes 2) Time complexities of merge sort and binary search 3) Preorder and inorder tree traversals for determining tree structures 4) Terminology used in binary trees 5) Dijkstra's algorithm for finding shortest paths in graphs 6) Proof that searching a sorted list requires log N comparisons 7) Implementing a heap with insertion and deletion 8) Balancing an AVL tree 9) Algorithms for push and pop operations in a linked list stack

Uploaded by

M Umar Chattha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views

Quiz # 01: Name . Roll. No. .

The document contains a 10 question quiz on data structures and algorithms topics including: 1) Hashing functions and collision resolution schemes 2) Time complexities of merge sort and binary search 3) Preorder and inorder tree traversals for determining tree structures 4) Terminology used in binary trees 5) Dijkstra's algorithm for finding shortest paths in graphs 6) Proof that searching a sorted list requires log N comparisons 7) Implementing a heap with insertion and deletion 8) Balancing an AVL tree 9) Algorithms for push and pop operations in a linked list stack

Uploaded by

M Umar Chattha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Name…………………………. Roll. No.…………………………..

Quiz # 01
Q: 01) Hash 11,22,33,44,55,66,77 to a hash table of size 17, considering collision
resolving schemes as follows.

1) Linear probing or open Address 2) Quadratic Hashing

3) Double Hashing 4) chain addressing 5) Bucket Chaining

Q: 02) The complexity of merge sort algorithm is (d)


a) O(n) b) O(log n) c) O(n2) d) O(n log n)

Q: 03) The complexity of Binary search algorithm is (b)


a) O (n) b) O (log n) c) O (n2) d) O (n log n)

Q: 04) When in-order traversing a tree resulted E A C K F H D B G; the preorder traversal


would return (b)

a) FAEKCDBHG b) FAEKCDHGB c) EAFKHDCBG


d) FEAKDCHBG
Q: 05) In Binary trees nodes with no successor are called (b)

a) End nodes b) Terminal nodes c) Final nodes d) Last nodes

Q: 06) Use Dijsktra’s Algorithm to calculate

shortest path for following un-directed

weighted graph. Also draw the Adjacent

Matrix for following graph.

Q: 07) Prove that any algorithm that finds an element X in a sorted list of N elements
requires (log N) comparisons.

Q: 08) Write a C Program to Implement a Heap & provide Insertion & Deletion operation.

Q: 09) Balance the tree (use appropriate models of AVL Tree)

Q:10) Write an algorithm for Push and pop operation of stack using linked list

You might also like