HYDERABAD KARNATAKA EDUCATION SOCIETY’S

SHREE VEERENDRA PATIL DEGREE COLLEGE OF SCIENCE, ARTS, COMMERCE & BBM
DEPARTMENT OF COMPUTER SCIENCE
TIME: 1 HR II SEM DS TEST MAX MARKS: 25

SECTION A
(ANSWER ANY 9 QUESTIONS) (9X1=9)

1. Define Data structure.

2. Define Linear Data structure and give example.
3. Define Non Linear Data Structure and give example.
4. Why big O notation is used.
5. Give the difference between array and structure.
6. What is the maximum value an integer can represent?
7. What is column major ordering?
8. Define complexity of an algorithm.
9. Write the memory representation of a string.
10. Write different operations possible on array.

SECTION B
(ANSWER ANY 3 QUESTIONS) (3X3=9)

1. Explain different operations on primitive data structures.

2. Write about different dynamic memory allocation functions.
3. Write a function in C to extract a substring from a given string.
4. Compare array and linked list.

SECTION C
(ANSWER ANY 1 QUESTIONS) (7X1=7)

1. Write a C program to create & display linked list.

2. Write an algorithm to insert & delete an item from singly linked list.