Exam Details
| Subject | advanced data structures | |
| Paper | ||
| Exam / Course | computer science and engineering | |
| Department | ||
| Organization | Vardhaman College Of Engineering | |
| Position | ||
| Exam Date | December, 2017 | |
| City, State | telangana, hyderabad |
Question Paper
Hall Ticket No:
Question Paper Code B3201
(AUTONOMOUS)
M. Tech I Semester Regular/Supplementary Examinations, December 2017
(Regulations: VCE-R15)
ADVANCED DATA STRUCTRUES AND ALGORITHMS
(Computer Science and Engineering)
Date: 27 December, 2017 FN
Time: 3 hours
Max Marks: 70
Answer any FIVE Questions
Each Question carries equal marks
1.
Explain the algorithm for insertion and deletion on double linked list.
9M
Explain Postfix expression evolution with example.
5M
2.
Explain Rehashing with example.
6M
Construct hash table with table size of 13 for the following values:
42, 25, 14, 70, 38, 21, 11, 34.
Implement using linear probing and double hashing functions.
8M
3.
Explain the Threaded binary tree.
6M
Explain the properties of binary search tree. Construct binary search tree for the following elements:
67, 12, 45, 98, 80, 73, 120, 85, 30, 42
8M
4.
Define Red-Black Trees. Explain insertion and deletion operation of Red-Black Trees with example.
7M
Start with AVL search tree that is a 15-nodes full binary tree. The keys are 1-15. Remove the keys in the order 15, 14, 13 12. Draw your tree immediately following each deletion and also after each rotation that is performed. Label all nodes with their balance factor and identify the rotation type (if any) that is done.
7M
5.
How are recursive program analyzed?
7M
Distinguish between best, worst and average case complexities of an algorithm.
7M
6.
Explain the general principle of Greedy method and also list the application of Greedy method.
6M
Explain quick sorting technique. Sort the following elements using quick sort:
65, 70, 75, 80, 85, 60, 55, 50, 45
8M
7.
Explain the All-Pair Shortest Path Problem (APSP) with example.
7M
What is Principle of Optimality? Explain how travelling sales person problem uses the Dynamic Programming technique with example.
7M
8.
Give the 0/1 Knapsack Least Cost Branch and Bound algorithm. Explain how to find optimal solution.
7M
Explain the Graph-coloring problem. Draw the state space tree for m=3 colors, n=4 vertices graph. Discuss the time and space complexity.
7M
Question Paper Code B3201
(AUTONOMOUS)
M. Tech I Semester Regular/Supplementary Examinations, December 2017
(Regulations: VCE-R15)
ADVANCED DATA STRUCTRUES AND ALGORITHMS
(Computer Science and Engineering)
Date: 27 December, 2017 FN
Time: 3 hours
Max Marks: 70
Answer any FIVE Questions
Each Question carries equal marks
1.
Explain the algorithm for insertion and deletion on double linked list.
9M
Explain Postfix expression evolution with example.
5M
2.
Explain Rehashing with example.
6M
Construct hash table with table size of 13 for the following values:
42, 25, 14, 70, 38, 21, 11, 34.
Implement using linear probing and double hashing functions.
8M
3.
Explain the Threaded binary tree.
6M
Explain the properties of binary search tree. Construct binary search tree for the following elements:
67, 12, 45, 98, 80, 73, 120, 85, 30, 42
8M
4.
Define Red-Black Trees. Explain insertion and deletion operation of Red-Black Trees with example.
7M
Start with AVL search tree that is a 15-nodes full binary tree. The keys are 1-15. Remove the keys in the order 15, 14, 13 12. Draw your tree immediately following each deletion and also after each rotation that is performed. Label all nodes with their balance factor and identify the rotation type (if any) that is done.
7M
5.
How are recursive program analyzed?
7M
Distinguish between best, worst and average case complexities of an algorithm.
7M
6.
Explain the general principle of Greedy method and also list the application of Greedy method.
6M
Explain quick sorting technique. Sort the following elements using quick sort:
65, 70, 75, 80, 85, 60, 55, 50, 45
8M
7.
Explain the All-Pair Shortest Path Problem (APSP) with example.
7M
What is Principle of Optimality? Explain how travelling sales person problem uses the Dynamic Programming technique with example.
7M
8.
Give the 0/1 Knapsack Least Cost Branch and Bound algorithm. Explain how to find optimal solution.
7M
Explain the Graph-coloring problem. Draw the state space tree for m=3 colors, n=4 vertices graph. Discuss the time and space complexity.
7M
Other Question Papers
Subjects
- advanced algorithms
- advanced algorithms laboratory
- advanced data communications
- advanced data structures
- advanced data structures laboratory audit course – i
- advanced mechanics of solids
- advanced mechanisms
- advanced operating systems
- advanced operating systems laboratory
- artificial intelligence and neural networks
- business analytics
- cloud computing
- cloud computing laboratory
- cmos vlsi design
- computer graphics
- computer organization and architecture
- computer vision and pattern recognition
- constitution of india
- cpld and fpga architectures and applications
- cryptography and computer security
- data warehousing and data mining
- datawarehousing and data mining
- design patterns
- digital image processing
- digital systems design
- disaster management
- distributed computing
- distributed databases
- distributed operating systems
- dsp processors and architectures
- embedded linux
- embedded real time operating systems
- embedded systems
- energy conversion systems
- english for research papers writing
- entrepreneurship development
- finite element methods
- fracture, fatigue and creep deformation
- human computer interaction
- image processing
- industrial safety
- information retrieval systems
- information security
- machine learning
- major project phase-i
- major project phase-ii
- microcontrollers for embedded system design
- mini project with seminar audit course – ii
- mobile computing
- mobile satellite communications
- national service scheme
- number theory and cryptography
- object oriented analysis and design
- operations research
- pedagogy studies
- personality development through life enlightenment skills
- power electronic control of dc drives
- power electronic converters-i
- power semi conductor devices
- principles of machine modeling analysis
- research methodology and intellectual property rights
- sanskrit for technical knowledge
- semantic web and social networks
- software engineering principles
- solar, energy and applications
- stress management by yoga
- system modeling and simulation
- value education
- waste to energy
- web security
- wireless and mobile computing