Module I-Arrays, Strings,
Dr.Ganga Holi, Prof, & Head, ISE Dept.
Global Academy of Technology
Dept. of Information Science & Engineering
, Module I-Arrays, Strings,
Dr. Ganga Holi, ISE Dept., Global academy of Technology
1
, Contents
1. What is Data Structure? ............................................................................................................................ 1
2. Explain the classification of data structures. ............................................................................................. 1
3. What are the data structures operations?................................................................................................... 1
4. Explain declaration, initialization of One dimensional and Two dimensional arrays............................... 2
5. Discuss the operations that can be performed on arrays. .......................................................................... 2
6. Describe the method to calculate the actual memory address of the array location. ................................ 3
7. What are Polynomials and Sparse matrices? Explain with example. ....................................................... 4
How to represent polynomial and Evaluate polynomials? .................................................................... 5
How to represent polynomial and add two polynomials? ..................................................................... 5
Write an algorithm to transpose sparse matrix. ..................................................................................... 8
8. What are strings? Explain the operations on strings. ................................................................................ 9
Q9. What do you mean by pattern matching? Where do we use this concept? .......................................... 11
Q10.Define user defined data types : Structures and Unions...................................................................... 13
Q11. What are pointers? How do we use pointers to different data types? ................................................ 15
Q12. Why do we need dynamic memory allocation techniques? Explain the functions available for
allocating memory dynamically. ................................................................................................................. 15
14. Define string. Explain string handling functions: strcat, strcpy, strcmp, strncmp, strncat, strchr,
strrchr, strtok, strstr, strspn, strcspn, strbrk ................................................................................................. 16
String handling functions ........................................................................................................................ 19
15. Write an algorithm for pattern/string matching. ................................................................................... 19
16. Write a program to search an element using linear and binary search. ................................................. 20
Linear Search algorithm/function ........................................................................................................... 20
Binary search .......................................................................................................................................... 20
17.Design, Develop and Implement a menu driven Program in C for the following Array operations .... 21
18. Write a program to sort the numbers using selection and bubble sort algorithms. ............................... 23
Questions on Module I ................................................................................................................................ 25
Dr.Ganga Holi, Prof, & Head, ISE Dept.
Global Academy of Technology
Dept. of Information Science & Engineering
, Module I-Arrays, Strings,
Dr. Ganga Holi, ISE Dept., Global academy of Technology
1
, Contents
1. What is Data Structure? ............................................................................................................................ 1
2. Explain the classification of data structures. ............................................................................................. 1
3. What are the data structures operations?................................................................................................... 1
4. Explain declaration, initialization of One dimensional and Two dimensional arrays............................... 2
5. Discuss the operations that can be performed on arrays. .......................................................................... 2
6. Describe the method to calculate the actual memory address of the array location. ................................ 3
7. What are Polynomials and Sparse matrices? Explain with example. ....................................................... 4
How to represent polynomial and Evaluate polynomials? .................................................................... 5
How to represent polynomial and add two polynomials? ..................................................................... 5
Write an algorithm to transpose sparse matrix. ..................................................................................... 8
8. What are strings? Explain the operations on strings. ................................................................................ 9
Q9. What do you mean by pattern matching? Where do we use this concept? .......................................... 11
Q10.Define user defined data types : Structures and Unions...................................................................... 13
Q11. What are pointers? How do we use pointers to different data types? ................................................ 15
Q12. Why do we need dynamic memory allocation techniques? Explain the functions available for
allocating memory dynamically. ................................................................................................................. 15
14. Define string. Explain string handling functions: strcat, strcpy, strcmp, strncmp, strncat, strchr,
strrchr, strtok, strstr, strspn, strcspn, strbrk ................................................................................................. 16
String handling functions ........................................................................................................................ 19
15. Write an algorithm for pattern/string matching. ................................................................................... 19
16. Write a program to search an element using linear and binary search. ................................................. 20
Linear Search algorithm/function ........................................................................................................... 20
Binary search .......................................................................................................................................... 20
17.Design, Develop and Implement a menu driven Program in C for the following Array operations .... 21
18. Write a program to sort the numbers using selection and bubble sort algorithms. ............................... 23
Questions on Module I ................................................................................................................................ 25
