Scribd
Upload
16 views2 pages

Ds Through C Unit 1

Uploaded by

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

Ds Through C Unit 1

Uploaded by

Nalini Bangaram
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

STATE BOARD OF TECHNICAL EDUCATION, A.

P
SIR C R REDDY POLYTECHNIC, ELURU
UNIT–1 II YEAR Code:-CM-304 Sub: - DATA STRUCTURES THROUGH C
Time: 90 minutes Total – 40M
PART – A 16 M
1. Answer ALL questions
2. First question carries 4marks, and each question of remaining carries 3marks.

1. (a) Quick sort will works based on divide and conquer method (True/False) (CO1)
(b) Define time complexity. (C01)
(c) Define space complexity. (CO1)
(d) Define abstract data type. (CO1)
2. Write algorithm for binary search. (CO2)
3. Write algorithm for quick sort. (CO1)
4. Define linear and non linear data structure. (CO1)
5. Write structure for creating node for a) single linked list b) double linked list.(CO2)

STATE BOARD OF TECHNICAL EDUCATION, A.P


SIR C R REDDY POLYTECHNIC, ELURU
UNIT–1 II YEAR Code:-CM-304 Sub: - DATA STRUCTURES THROUGH C
Time: 90 minutes Total – 40M
PART – A 16 M
1. Answer ALL questions
2. First question carries 4marks, and each question of remaining carries 3marks.

1. (a) Quick sort will works based on divide and conquer method (True/False) (CO1)
(b) Define time complexity. (C01)
(c) Define space complexity. (CO1)
(d) Define abstract data type. (CO1)
2. Write algorithm for binary search. (CO2)
3. Write algorithm for quick sort. (CO1)
4. Define linear and non linear data structure. (CO1)
5. Write structure for creating node for a) single linked list b) double linked list.(CO2)
PART – B 3X8=24M
. Answer all questions 2. Each question carries 8 Marks
3. Answer should be comprehensive and the criterion for valuation is the content
but not the length of the answer

6. (a) Write algorithm for bubble sort, and perform bubble sort for following array
50, 20, 60,70,30,10,40,90,80. (CO1)
(Or)
(b) Write a c program to implement selection sort using array. (CO1)
7. (a) Define data structure and classify them. (CO1)
(Or)
(b) Compare different sorting algorithm with time and space complexities. (CO1)

8. (a) Write different operations on single linked list with neat diagrams. (CO2)
(Or)
(b) Write different operations on double linked list with neat diagrams. (CO2)

PART – B 3X8=24M
. Answer all questions 2. Each question carries 8 Marks
3. Answer should be comprehensive and the criterion for valuation is the content
but not the length of the answer

6. (a) Write algorithm for bubble sort, and perform bubble sort for following array
50, 20, 60,70,30,10,40,90,80. (CO1)
(Or)
(b) Write a c program to implement selection sort using array. (CO1)
7. (a) Define data structure and classify them. (CO1)
(Or)
(b) Compare different sorting algorithm with time and space complexities.(CO1)

8. (a) Write different operations on single linked list with neat diagrams. (CO2)
(Or)
(b) Write different operations on double linked list with neat diagrams. (CO2)

You might also like