Exam Details
| Subject | data structures (ds) | |
| Paper | ||
| Exam / Course | mca | |
| Department | ||
| Organization | Gujarat Technological University | |
| Position | ||
| Exam Date | December, 2018 | |
| City, State | gujarat, ahmedabad |
Question Paper
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER- III- EXAMINATION WINTER 2018
Subject Code: 4430602 Date: 01-12-18
Subject Name: Data Structures
Time: 10.30 am to 1.00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q-1 Do as directed:
1. List out applications of stack. 1
2. Differentiate complete binary tree and full binary tree. 2
3. Define Directed Graph. 1
4. In binary tree total no.of.leaf nodes are 1
5. KWIC stands for 1
6. In notation the operators precedes the two operands. 1
Do as directed:
1. Explain Spanning Tree with example. 2
2. Draw Expression Tree for given Expression: 2
3. In circular queue implemented using an array holding 5 elements, if FRONT=3 1
and REAR=4, then new element would get placed at position.
4. Define: Queue 1
5. Define: Acyclic Graph 1
Q-2 Define Data Structure. Explain different categories of Data Structure. 7
To convert a given infix expression into postfix expression by using stack. 7
OR
Explain Tower of Hanoi problem of moving 3 discs. 7
Q-3 Generate Binary Tree from given Inorder and Postorder. And also find Preorder 7
Traversal.
Inorder: 3 7 8 6 11 2 5 4 9
Postorder: 3 8 11 6 7 4 9 5 2
1. Give Difference between static and dynamic memory allocation. 3
2. Write an algorithm for following operation of Circular Queue. 4
Insert an Element
OR
Q-3 Write an algorithm to add two polynomials. 7
1. Explain Row Major and Column Major Representation of 2-Dimensional Array. 3
2. Draw B-Tree of order 3 for following data 4
Q-4 Demonstrate Quick Sort on the following set of Numbers. 7
70 36 44 12 89 20 58 64 76 52
Define Saprce Matrix. Explain Representation of Sparce Matrix with example. 7
OR
Q-4 Sort Following data using Heap Sort 7
18, 25,38,12,8,22,48,39,72,36
Define Searching. Write an algorithm for Binary Search. 7
Q-5 Explain Dijkstra's algorithm with example. 7
1. Give difference Between BFS and DFS. 4
2. Write a short note on Trie Structure. 3
OR
Q-5 Explain Kruskal's Alorithm with example. 7
What is Hashing? Explain Collision Resolution Techniques in detail. 7
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER- III- EXAMINATION WINTER 2018
Subject Code: 4430602 Date: 01-12-18
Subject Name: Data Structures
Time: 10.30 am to 1.00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q-1 Do as directed:
1. List out applications of stack. 1
2. Differentiate complete binary tree and full binary tree. 2
3. Define Directed Graph. 1
4. In binary tree total no.of.leaf nodes are 1
5. KWIC stands for 1
6. In notation the operators precedes the two operands. 1
Do as directed:
1. Explain Spanning Tree with example. 2
2. Draw Expression Tree for given Expression: 2
3. In circular queue implemented using an array holding 5 elements, if FRONT=3 1
and REAR=4, then new element would get placed at position.
4. Define: Queue 1
5. Define: Acyclic Graph 1
Q-2 Define Data Structure. Explain different categories of Data Structure. 7
To convert a given infix expression into postfix expression by using stack. 7
OR
Explain Tower of Hanoi problem of moving 3 discs. 7
Q-3 Generate Binary Tree from given Inorder and Postorder. And also find Preorder 7
Traversal.
Inorder: 3 7 8 6 11 2 5 4 9
Postorder: 3 8 11 6 7 4 9 5 2
1. Give Difference between static and dynamic memory allocation. 3
2. Write an algorithm for following operation of Circular Queue. 4
Insert an Element
OR
Q-3 Write an algorithm to add two polynomials. 7
1. Explain Row Major and Column Major Representation of 2-Dimensional Array. 3
2. Draw B-Tree of order 3 for following data 4
Q-4 Demonstrate Quick Sort on the following set of Numbers. 7
70 36 44 12 89 20 58 64 76 52
Define Saprce Matrix. Explain Representation of Sparce Matrix with example. 7
OR
Q-4 Sort Following data using Heap Sort 7
18, 25,38,12,8,22,48,39,72,36
Define Searching. Write an algorithm for Binary Search. 7
Q-5 Explain Dijkstra's algorithm with example. 7
1. Give difference Between BFS and DFS. 4
2. Write a short note on Trie Structure. 3
OR
Q-5 Explain Kruskal's Alorithm with example. 7
What is Hashing? Explain Collision Resolution Techniques in detail. 7
Other Question Papers
Subjects
- advance database management system
- advanced biopharmaceutics & pharmacokinetics
- advanced medicinal chemistry
- advanced networking (an)
- advanced organic chemistry -i
- advanced pharmaceutical analysis
- advanced pharmacognosy-1
- advanced python
- android programming
- artificial intelligence (ai)
- basic computer science-1(applications of data structures and applications of sql)
- basic computer science-2(applications of operating systems and applications of systems software)
- basic computer science-3(computer networking)
- basic computer science-4(software engineering)
- basic mathematics
- basic statistics
- big data analytics (bda)
- big data tools (bdt)
- chemistry of natural products
- cloud computing (cc)
- communications skills (cs)
- computer aided drug delivery system
- computer graphics (cg)
- computer-oriented numerical methods (conm)
- cyber security & forensics (csf)
- data analytics with r
- data mining
- data structures (ds)
- data visualization (dv)
- data warehousing
- data warehousing & data mining
- database administration
- database management system (dbms)
- design & analysis of algorithms(daa)
- digital technology trends ( dtt)
- discrete mathematics for computer science (dmcs)
- distributed computing (dc1)
- drug delivery system
- dynamic html
- enterprise resource planning (erp)
- food analysis
- function programming with java
- fundamentals of computer organization (fco)
- fundamentals of java programming
- fundamentals of networking
- fundamentals of programming (fop)
- geographical information system
- image processing
- industrial pharmacognostical technology
- information retrieving (ir)
- information security
- java web technologies (jwt)
- language processing (lp)
- machine learning (ml)
- management information systems (mis)
- mobile computing
- molecular pharmaceutics(nano tech and targeted dds)
- network security
- object-oriented programming concepts & programmingoocp)
- object-oriented unified modelling
- operating systems
- operation research
- operations research (or)
- pharmaceutical validation
- phytochemistry
- procedure programming in sql
- programming skills-i (ps-i-fop)
- programming skills-ii (ps-oocp)
- programming with c++
- programming with java
- programming with linux, apache,mysql, and php (lamp)
- programming with python
- search engine techniques (set)
- soft computing
- software development for embedded systems
- software engineering
- software lab (dbms: sql & pl/sql)
- software project in c (sp-c)
- software project in c++ (sp-cpp)
- software quality and assurance (sqa)
- statistical methods
- structured & object oriented analysis& design methodology
- system software
- virtualization and application of cloud
- web commerce (wc)
- web data management (wdm)
- web searching technology and search engine optimization
- web technology & application development
- wireless communication & mobile computing (wcmc)
- wireless sensor network (wsn)