Exam Details
| Subject | advanced data structures | |
| Paper | ||
| Exam / Course | computer science and engineering | |
| Department | ||
| Organization | Vardhaman College Of Engineering | |
| Position | ||
| Exam Date | June, 2017 | |
| City, State | telangana, hyderabad |
Question Paper
Hall Ticket No:
Question Paper Code B3201
(AUTONOMOUS)
M. Tech I Semester Supplementary Examinations, June 2017
(Regulations: VCE-R15)
ADVANCED DATA STRUCTURES AND ALGORITHMS
(Computer Science and Engineering)
Date: 05 June, 2017 AN
Time: 3 hours
Max Marks: 70
Answer any FIVE Questions
Each Question carries equal marks
1.
Explain circular doubly linked list with an example for each. Write a pseudo code to concatenate two circular doubly linked lists.
7M
What is meant by linked list representation? Compare linked stacks and linked queues.
7M
2.
Write short notes on hash tables and hash functions.
7M
Discuss briefly about the different Collision resolution techniques with suitable examples.
7M
3.
What is a binary tree? How do you represent it? Explain in detail about threaded binary trees.
7M
Explain OBST algorithm.
7M
4.
Define 2-3 Tree. Explain about the insertion and searching operations on 2-3 Trees.
5M
Explain the L-R and R-R rotations of an AVL tree.
9M
5.
Explain analysis of algorithm and explain:
i. Time complexity
ii. Space complexity
7M
Explain the best case, worst-case, average case complexities using asymptotic notation.
7M
6.
Discuss about the Strassen's matrix multiplication method.
7M
Write and explain the control abstraction for greedy method.
7M
7.
Explain the method to solve a 0/1 knapsack problem using dynamic programming technique.
7M
Give brief description about the reliability design.
7M
8.
Explain about graph coloring.
7M
Solve the knapsack problem where, using LCBB.
7M
Question Paper Code B3201
(AUTONOMOUS)
M. Tech I Semester Supplementary Examinations, June 2017
(Regulations: VCE-R15)
ADVANCED DATA STRUCTURES AND ALGORITHMS
(Computer Science and Engineering)
Date: 05 June, 2017 AN
Time: 3 hours
Max Marks: 70
Answer any FIVE Questions
Each Question carries equal marks
1.
Explain circular doubly linked list with an example for each. Write a pseudo code to concatenate two circular doubly linked lists.
7M
What is meant by linked list representation? Compare linked stacks and linked queues.
7M
2.
Write short notes on hash tables and hash functions.
7M
Discuss briefly about the different Collision resolution techniques with suitable examples.
7M
3.
What is a binary tree? How do you represent it? Explain in detail about threaded binary trees.
7M
Explain OBST algorithm.
7M
4.
Define 2-3 Tree. Explain about the insertion and searching operations on 2-3 Trees.
5M
Explain the L-R and R-R rotations of an AVL tree.
9M
5.
Explain analysis of algorithm and explain:
i. Time complexity
ii. Space complexity
7M
Explain the best case, worst-case, average case complexities using asymptotic notation.
7M
6.
Discuss about the Strassen's matrix multiplication method.
7M
Write and explain the control abstraction for greedy method.
7M
7.
Explain the method to solve a 0/1 knapsack problem using dynamic programming technique.
7M
Give brief description about the reliability design.
7M
8.
Explain about graph coloring.
7M
Solve the knapsack problem where, using LCBB.
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