Exam Details
| Subject | data structures (ds) | |
| Paper | ||
| Exam / Course | mca | |
| Department | ||
| Organization | Gujarat Technological University | |
| Position | ||
| Exam Date | June, 2017 | |
| City, State | gujarat, ahmedabad |
Question Paper
1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA SEMESTER- II EXAMINATION SUMMER 2017
Subject Code: 2620001 Date: 31-05-2017
Subject Name: Data Structures
Time: 10:30 am 01: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
Define the following terms
1. Primitive data structure
2. m-ary Trees
3. Forest
4. Spanning tree
5. Sparse matrix
6. Null graph
7. Avl tree
07
What is string? Explain any four the string handling functions. Write the applications of string
07
Q.2
What is stack? Write the algorithm for pop. Explain the applications of stack
07
Write the algorithm to convert infix to postfix and convert the following expression into postfix.
A B C D E F G
07
OR
Explain the storage structure of a two dimensional array
07
Q.3
What is a priority queue? Write the algorithm to insert and delete element from a priority queue.
07
What is a binary tree? How it is stored in memory? Explain the traversal technique in a binary tree.
07
OR
Q.3
What is a linked list? Write the algorithm to insert an element in a doubly linked list.
07
Differentiate BFS and DFS. Explain how it works with a suitable example
07
Q.4
Write the algorithm for quick sort and sort the following numbers according to it.
25, 85, 60, 10,58, 47, 35, 16, 72,50
07
What is heap? Demonstrate heap sort with a suitable example.
07
OR
Q.4
What is graph? Explain all the representation of graphs with suitable example.
07
2
Explain all the deletion processes in a binary tree with example.
07
Q.5
What is hashing? Explain the hashing functions with example.
07
What is a binary search tree? Create binary search tree for the following data. Write all the traversal order for the created tree
32,75, 48, 82, 68, 99, 87, 15
07
OR
Q.5
Write and explain Dijkstra's algorithm for shortest path
07
What is complexity of an algorithm? Compare the algorithms of selection and merge sort using algorithm analysis technique.
07
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA SEMESTER- II EXAMINATION SUMMER 2017
Subject Code: 2620001 Date: 31-05-2017
Subject Name: Data Structures
Time: 10:30 am 01: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
Define the following terms
1. Primitive data structure
2. m-ary Trees
3. Forest
4. Spanning tree
5. Sparse matrix
6. Null graph
7. Avl tree
07
What is string? Explain any four the string handling functions. Write the applications of string
07
Q.2
What is stack? Write the algorithm for pop. Explain the applications of stack
07
Write the algorithm to convert infix to postfix and convert the following expression into postfix.
A B C D E F G
07
OR
Explain the storage structure of a two dimensional array
07
Q.3
What is a priority queue? Write the algorithm to insert and delete element from a priority queue.
07
What is a binary tree? How it is stored in memory? Explain the traversal technique in a binary tree.
07
OR
Q.3
What is a linked list? Write the algorithm to insert an element in a doubly linked list.
07
Differentiate BFS and DFS. Explain how it works with a suitable example
07
Q.4
Write the algorithm for quick sort and sort the following numbers according to it.
25, 85, 60, 10,58, 47, 35, 16, 72,50
07
What is heap? Demonstrate heap sort with a suitable example.
07
OR
Q.4
What is graph? Explain all the representation of graphs with suitable example.
07
2
Explain all the deletion processes in a binary tree with example.
07
Q.5
What is hashing? Explain the hashing functions with example.
07
What is a binary search tree? Create binary search tree for the following data. Write all the traversal order for the created tree
32,75, 48, 82, 68, 99, 87, 15
07
OR
Q.5
Write and explain Dijkstra's algorithm for shortest path
07
What is complexity of an algorithm? Compare the algorithms of selection and merge sort using algorithm analysis technique.
07
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)