(Pages:3) G-2654

Reg.No.

Name

SECOND SsEMESTER B.Sc./B.C.A.

DEGREE EXAMINATION,
EXAMINATION, MAY
MAY 2019
CAREER RELATED FDP UNDER CBCSS
Group 2(b) -

COMPUTER SCIENCE/COMPUTER
APPLICATIONS
CS 1241/CP 1243

DATA STRUCTURES

(2014-2017 Admissions)
Time:3 Hours Max. Marks 80

SECTION A (Very Short Answer Type)

(One word to maximum of one sentences, Answer ALL questions)

1. What are arrays?

2 What is meant by dynamic data structures?

3 Define pointer.

4 What do you mean by push operation?

5 Define Tree.
6. What is binary search tree?

7. Write one use of hashing

8. Define graph.

9.What is tree traversal?

mark
(10 x 1 10
trees?
0. What are expression
P.T
 SECTION-B (Short Answer)
(Not to exceed one paragraph, Answer any EIGHT questinn
Each question carries 2 marks) ions.

11. Define structure.

12. What do you mean

by linked list?
13 Define FIFO.
14 What is polish notation?
15. Define in-order tree traversal.

16 What is meant by
doubly linked list?
17. Convert the following infix expression into postfix
A'(B+D/E-F*(G+H/K) expre
18. What is a
weighted graph?
19 Write any two
applications of trees.
20. What is meant by linear
search?
21. What is a
regular graph?
22. Define dequeue.
(8 x 2 16m
SECTION-C [Short Essay]
(Not exceeding 120 words,
answer any SIX
Each question carries questions.
4 marks)

23. Briefly explain the applications of data

structure..
24. What is a stack? How it can be
represented using arrays?
95 What is circular linked list? How it differ from
doubly linked list?
2 G-
 routine to insert an element in
W
an
ordinary queue
example programm
yrite a n e x a m p
an
to illustrate the passing of structure to a function

sqttish between breadth first search and depth first search.

2 8D

the
evaluating
What is meant by time
meant complexity? Explain its importance in
of an algorithm
oerformance

a hash function?. Discuss its importance in search operation

Ihat is

algorithm to search an element in an array using binary search.

Write an
(6 x 4- 24 marks)

SECTION-D [Long Essay] marks

carry Fifteen
any TWO questions, Each question
[Answer

for
Write algorithm
associated with stack?
operations
the two basic
32. What are
these operations with the
expression
to postfix
convert infix expression
to
Discuss algorithm
33 Support of stack.
sorting
methods by comparing
important
Discuss two
4. What is meant by sorting?
disadvantage
of each
and
relative advantage terminologies.
graph theory
various 30 marks)
graph explain (2x 15
diagram of
Along with neat

G-2654

3
 ages:3)
e gN o .

E-4595

semester B.Sc./BCA
Seconc Semester B.Sc./E
Career RelatedDegree Examination,
FDP under ation, August
August 2018
2018
Group 2 ()-COMPUTER CBCSS
SCIENCEI COMPUTERRAPPLICATIONS
CS 1241/CP 1243
Data Structures
APPLICATIONS
(2014 Admission Onwards)
T e : 3H o u r s

Max. Marks: 80

PART A (Very Short

Answer Questions)
euer all questions. Each question carries 1 mark.

Define linear data structure.

2 Define the term array

3. Write syntax to define a structure in C.

4. What do you mean by stack ?

5. What is the use of queue

. What is a linked list ?

7. Write complexity of insertion sort algorithm.

. Name any two non linear data structures.

tree.
. Draw post order traversal of the given binary

B
E
(10x1-10 Marks)

Define the term Polish notation. P.T.O.

 -2
E-4595
PART-B (Brief answer questions

Each question carries 2 marks

Answer any eight questions.

11. Differentiate static and dynamic data structures.

12. Define height of a binary tree.

13. What are the advantages of linked list over array ?

14. Mention few applications of stack.

15. What do you mean by collision?

16. What is an expression tree ?

17. Write algorithm to perform exchange sort.

18. Define Binary Search Tree.
19. Define the term
weighted graph.
20. What is a circular linked list?
21. Distinguish between dynamic and static
memory allocation.
22. What is a Graph ?
(8x2-1
PART C (Short
Essay Type Questions)
Answer any six
questions. Each question carries 4
23.
marks.
Discuss the methods of two
dimensional array
24. Write short note on representation in memoy
doubly linked list.
25. Explain push operation to stack
using array.
26. Convert the following
expression to polish form
A+B-C'D/(E-F)
27. What is the use of
binary search tree ?
28. Explain various applications of
binary trees.
 3 E 4595

selection
sort with suitable example.
Explain
on
o n DFS
DFS.
note

Write a
aare lin.
linear and binary search techniques. (6x4-24 Marks)
1. Compare

PART D (Long essays)

r ver any two

questions. Each question carries 15 marks.
on linearlinked
linear linked list.
various operations
various
Explain
2
Explain

of linear queue using arrays.

Explain its operations.
implementation
FEXDlain
3.
suitable examples.
tree traversal with
Explain binary (2x15-30 Marks)

note on
various hashing techniques.
5. Write short
Reg. No, .
enERRE*RthkptakEbg*
(Pages: 3
G
Name

Second Semestor B.Sc.

Degroe Examination,
Careor Rolatod May 2019
FDP under
CBcSS
Computer Sclence
CS
1241-DATA STRUCTURES INC
(2018 Admlsslon)
Time3 Hours
Max.

SECTION-A
Answer all questions. Each question carries 1 mark.
1 What is deque?
2 Explain Quick sort algorithm.
3. What is simulation?
4 Explain Single Linked list.

5 What is dynamic memory location?

6 on Stack?
What is PUSH POP operation
arithmetic expression.
7.
Explain are different notations of
tree.
Explain deletion operation in
9.
Explain threadedIbinary tree.
0. What is a bio connectivity?
(10 x 1 1
 SECTION - B

exceeding a paragraph of 50 worde

ds
Answer any eight questions, not

the function used to adjust the size of dynamic memoryh

11 What is
block
12 Write a algorithm for inserting an element into queue.

13 Explain Linear hashing.

14 Explain Factorial calculation using stack.

15 How to implement get and free node operation.

16
16 Explain open Hasing.
17 Describe mid square method.

18 Explain Huffman tree.

19 Explain representation of linked list in memory.
20 Explain Konigsberg bridge.
21. Explain Digraph.

22 Write about set

representation of graph.

SECTION-C (8 x 2 16N
Answer any six
questions, in a
paragraph of 100 words.
23. Explain time complexity and
space complexity.
24. Explain Circular queue with an
example.
25. xplain lection sort with example.

2
 non linear data structure?
What
What are the kev
26
linear data structure?
differences compareu to

27.
Exolain operation
E x p l a
on a linked list.

What is a dangling pointer? Explain.

28.

How can you

insert new node into Binary tree? Explain.
29
What are the applications of a queue?2
30

various file organisations.

4 Describe
(6 x 4 24 Marks)
SECTION-D
not exceeding 4 page.
Answer any two questions,

with examples.
various queue structure
32 Explain
list? Give examples.
What are the application of linked
33
insertion and deletion with examples?
the operations
for tree
34. What are
used for this?
are the algorithms
tree. Which
minimum spanning
Explain about 30 Marks)
(2 x 15

G 2690

3
 ages: 3)
Reg. No. G- 2654
Name .
SECOND SEMESTER
B.Sc./B.C.A. DEGREE
CAREER RELATED EXAMINATION, MAY 2019
FDP UNDER
-

CBCss
Group 2(b) OMPUTER SCIENCE/COMPUTER APPLICATIONS
CS 1241/CP 1243
DATA STRUCTURES
(2014 2017 Admissions)
Time:3 Hours
Max. Marks 80
SECTION A (Very Short Answer Type)
(One word to maximum of one sentences, Answer ALL questions)
1 What are arrays?
2 What is meant by dynamic data structures?
3Define pointer.
4
What do you mean by push operation?
6 Define Tree.
What is binary search tree?
Write one use of hashing.
Define graph.
What is tree
traversal? 10 marks)
(10 x 1
hat are expression trees?
P.T.O.
 one
(Not to exceed paragrapn, Answer any Ei
Each question carries 2 marks HT auestions.
11. Define structure.
12. What do you mean by linked list?
13. Define FIFO.
14 What is polish notation?
15. Define in-order tree traversal.
16. What is meant by doubly linked list?
17. Convert the infix
following expression into postfix expres
A"(B+D)VE-F (G+H/K)
18. What is a
weighted graph?
19 Write any two applications of trees.
20 What is meant by linear
search?
21. What is a
regular graph?
22. Define dequeue.
(8 x2-16
SECTION-C [Short Essayl
(Not exceeding 120 words, answer any SIX
Each
questions.
question carries 4 marks)
23.
Briefly explain the
24.
applications of data
structure.
What is a stack?
How it can be
25. What is esented using arr
represented using
circular linked list? How
arrays?
How it differ from linked list?
bly
doubly ink G
2
 routine to insert an
Write a element in
26. an ordinary
queue
5 an example programm to illustrate
the
27 passing of structure to a function
28. Distinguish
nish between breadth first search
and depth first search.
Ahat is
What is meani
meant by time
2929 performance of an algorithm
complexity? Explain its in
importance evaluating the
What is a hash function?. Discuss its
importance in search operation
aWrite an algorithm to search an element in an array
using binary search.
(6x 4 24 marks)
SECTION-D [Long Essay]
[Answer any TWO questions, Each question carry Fifteen marks]
32 What are the two basic operations associated with stack? Write algorithm for
these operations
33. Discuss algorithm to convert infix
expression to postfix expression with the
support of stack.
4 What is meant by sorting? Discuss two important sorting methods by comparing
relative advantage and disadvantage of eacn
.
Along with neat diagram of graph explain various graph theory terminologies.
(2x 15 30 marks)
3 G- 2654