Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
24 views2 pages

Data Structures

This document is an examination paper for the BCA - 203: Data Structures course, conducted in May 2017. It consists of two sections: Section A includes ten short answer questions, while Section B contains six detailed questions, each with a focus on different data structure concepts and algorithms. The total marks for the exam are 70, with specific marks allocated for each section.

Uploaded by

danu6971
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
24 views2 pages

Data Structures

This document is an examination paper for the BCA - 203: Data Structures course, conducted in May 2017. It consists of two sections: Section A includes ten short answer questions, while Section B contains six detailed questions, each with a focus on different data structure concepts and algorithms. The total marks for the exam are 70, with specific marks allocated for each section.

Uploaded by

danu6971
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
EIEN US - 638 i! Semester B.C.A. Degree Examination, May 2017 (F + R) (CBCS) (2014-15 and Onwards) COMPUTER SCIENCE BCA - 203 : Data Structures Time : 3 Hours Instruction ; Answeralt Sections. SECTION-A Answer any ten questions. Each question carries twp marks. 1a Whatis linear data structure ? Give an example. 2 Define space and time complexities of an algorithm. 3» What is recursion ? 4g What is dynamic memory allocation ? 5p Define stack. 6, Compare linear search and binary search methods. Ye, What is circular queue ? 8, Write the differences between stack and queue. 9% Give the node structure of a doubly linked list. 10. Define the terms : i) Binary tree. ii) Complete binary tree. 115 Mention the different ways of tree traversal. 12g Mention the graph traversal methods. Max. Marks : 70 (10x2=20) us— Answerany five questions. 8 13. 14. 1 20. . a)Write C functions to pe by’ What is queue ? Mentidn its underflow and overflow conditions. © 638 a) Explain various types 9f data structures. ») Briefly explain any fourstring handling functions. a)"Explain selection sort digorithm. b) Write an algorithm to de! . a)" Define linked list. Mentjon the applications of the linked list. by Write an algorithm for searching a node in the singly linked list. a}' Mention various applications of the stack. IGINLA SECTION-B lach question carries ten marks. (6x10=50) ‘lete an element from the array. oaaan aa b)- Evaluate the following postfix expression 95 +36+*+97-1, . af Briefly explain infix, prefix and postfix expressions. orm insertion and deletion operations of a queue. aaa a b} Convert the following infix expression into its equivalent postfix expression (a+b) + (min) + (x-+y}. @) Define the terms (a) Gri b) Write depth-first-searcl a) Define Binary search tr b) Briefly explain various t ph (b) Degree of a vertex. algorithm. e. Give an example. OR OR A jee traversal methods with suitable examples.

You might also like