PDS-1.pdf

8/20/2019 PDS-1.pdf

1/14

CSEITQUESTIONS.BLOGGSPOT.IN CSEITQUESTIONS.BLOGGSPOT.IN CSEITQUESTIONS.BLOGGSPOT

1

UNIT 1

Part-A

Q.No Question Competence Level

1 List out the Conditional and Control statements in C. Remember BTL-1

2 What is a preprocessor? Give any two examples.Remember BTL-1

3 What is a pointer to pointer?Remember BTL-1

4 What are the primitive data types in C?Remember BTL-1

5 What are function pointers in C? Explain with example.Remember BTL-1

6 Define an array and give an example.Remember BTL-1

7 Give an Example on Call by Reference.Understand BTL-2

8 Give 2 Examples for C Preprocessors with Syntax.Understand BTL-2

9 Differentiate Iteration and Recursion.Understand BTL-2

10 Distinguish between Library Function and User Defined Understand BTL-2Function.

Calculate the output of the following program

11int k; intnum = 30;

Apply BTL-3k = num >5 ? (num

8/20/2019 PDS-1.pdf

2/14


2

printf(“%d \t”,i);

}

16 With the help of Printf Function,Explain how C Handles Analyze BTL-4functions with variable number of arguments.

17 Compare the working of array and Functions.Evaluate BTL-5

18 Summarize the working of pointers.Evaluate BTL-5

19 Develop a simple c program using functions.Create BTL-6

20 Develop a simple c program using pointers.Create BTL-6

Part -B

S.No Question Competence BTL

1 Describe the conditional and loop statements available in C with Remember BTL-1an Example.(16)

2 Describe about pointers, and how the pointer variables are Remember BTL-1declared with an Example?(16)

3 Label the structure of C program and explain in detail.(16)Remember BTL-1

Distinguish between the following:(16)Understand BTL-2

4 i. Actual and formal arguments

ii. Global and local variables

8/20/2019 PDS-1.pdf

3/14


3

iii. Automatic and static variablesiv. Scope and visibility of variables

v. & operator and * operator

5 Describe the ways of passing parameters to functions with an

Understand BTL-2example.(16)

A.Analyze and Write a Function that returns a pointer to themaximum value of an array of double’s .if the array is empty

6 return NULL. Double *maximum(double *a,int size);(8) Analyze BTL-4B.Analyze and Write a C Program to find all the roots of a

quadratic equation.(8)

A.Analyze and Write a C Program using Function to check if

7 the given input number is palindrome or not.(8)

Analyze BTL-4B.Explain the C Preprocessor operators, each with an example

that is used to create macros.(8)

Illustrate and explain about the following with an example.8 i.function with number of arguments. (8) Apply BTL-3

ii.function with ponters. (8)a.Write and explain a c program to find the unique elements in

an array using a function “unique” .the function takes the

9 array as a parameter and prints the unique elements.(8) Evaluate BTL-5 b.Write and explain a C Program to print the Fibonacci

numbers. (8)

Create a C Program to multiply two matrices that are

10 represented as pointers.useafunction to the function

Create BTL-6‘multiply’ which takes the two matrices as parameters and prints the result of the multiplication.

UNIT 2

Part-A

S.N Question Competence BTL

o

1 What is an array of structure and give an example Remember BTL-1

2 What is slack byte?Remember BTL-1

3 What is a file? List out the file handling functions. Remember BTL-1

4 What are the common uses of rewind() and ftell() functions? Remember BTL-1

8/20/2019 PDS-1.pdf

4/14


4

List the similarities and differences between structure and union Remember BTL-1

6 What is a pointer variable and what are the uses of pointer Remember BTL-1variable?

7 Distinguish between getc() and getw().Understand BTL-2

8 Distinguish getc() and getchar().Understand BTL-2

9 Give the applications in which unions rather than structures can Understand BTL-2 be used.

10 Distinguish between fread() and fwrite()Understand BTL-2

11 Show the working of a syntax as givenbelow: Apply BTL-3Fread(&my_record,sizeof(struct rec),1,ptr_myfile);

12 Illustrate the need of union in CApply BTL-3

13 Illustrate the need of structures in CApply BTL-3

Analyse the following, When a program is terminated, all theAnalyze BTL-4

14 files used by it are automatically closed. Whyis it then necessary

to close a file during execution of the program?

15 Point out the modes of operation used in file.Analyze BTL-4

16 Compare fseek() and ftell() function.Analyze BTL-4

Will the following declaration work.Explain with justificationfor your answer

17 Srtuct StudentEvaluate BTL-5

{ introllno = 12; Float marks [] = {55,60,56); Char gender;

};

18 Compare and evaluate the working of structures and unionEvaluate BTL-5

19 Develop a simple C program using Structures.Create BTL-6

20 Develop a Simple C Program using file modes.Create BTL-6

8/20/2019 PDS-1.pdf

5/14


5

Part -B

S.No Question Competence BTL

1 Explain and describe in detail about Structures and Unions.(16) Remember BTL-1

2 Explain and describe the string handling functions with Remember BTL-1examples.(16)

Describe the following file manipulation functions withexamples.(16)

a) rename()Remember BTL-1

3 b) freopen()c) remove()

d) tmpfile(void), and

e) fflush()Distinguish between the following functions.(16)a) getc() and getchar()

Understand BTL-24 b) scanf() and fscanf()

c) printf() and fprintf()

d) feof() and ferror()

5 Compare and contrast structures and unions with an example

Understand BTL-2 program.(16)

6 Illustrate and explain a C program to copy the contents of one

Analyze BTL-3file into another. (16)

7 Explain the different file manipulations with an suitable

Analyze BTL-4

program.(16)Analyze and Design a structure student record to contain name,

8 DOB, total marks obtained. Develop a program to read data for Apply BTL-410 students in a class and list them rank-wise.(16)

a. Write and explain a c program that uses functions to performthe following operations using structure(12)

1.reading a complex number

9 2.writing a complex number

Evaluate BTL-53.addition of two complex numbers

4. Multiplication of two complex numbers.

b.Summarize the advantages and disadvantages of structures

and unions in C Programming.(4)a. Develop and Perform the following to manipulate file

handling using C. (12)

1. Define an input file handle called input_file,which is a

Pointer to a type FILE.2.Using input_file,open the file results.dat for read mode

10 3. WriteCstatements which tests to see if input_file has

Create BTL-6

8/20/2019 PDS-1.pdf

6/14


6

message and exit the program.4. Write a C Code which will read a line of characters

(terminated by a \n) from input_file into a character arraycalledbuffer.NULL terminate the buffer upon reading a \n.

5.Close the file associated with input-file

b.Develop a C program to display the contents of a file ona Screen. (4)

UNIT 3

Part-A

S.N Question Competence BTL

o

1 Define ADT. Give any two examples. Remember BTL-1

What are the postfix and prefix forms of the expressionRemember BTL-1

2 A + B* (C – D) / (P – R)

List out the Areas in which Data Structures are AppliedRemember BTL-1

3 Extensively

4 Define Non Linear Data Structure. Remember BTL-1

5 What are the types of linked list? Remember BTL-1

6 List out the advantage of circular linked list. Remember BTL-1

7 Distinguish Between Linear and Non Linear Data Structures. Understand BTL-2

8 Clearly distinguish between linked lists and arrays. Mention Understand BTL-2

their relative advantages and disadvantages.

9 Differentiate arrays and linked listsUnderstand BTL-2

10 Give an Example for linked list application. Understand BTL-2

11 Binary search cannot be performed on a linked list. Examine. Apply BTL-3

12 Illustrate the use of linked list with an example. Apply BTL-3

8/20/2019 PDS-1.pdf

7/14


7

13 Show the ways in which list ADT can be implemented. Apply BTL-3

Compare calloc() and realloc() function and mention itsAnalyze BTL-414 application in linked list.

15 Analyze and Write a find routine in array implementation. Analyze BTL-4

Analyze and write the array representation of a polynomialAnalyze BTL-416

P(x)=4x +6x +7x+9

Should arrays or linked lists be used for the following types of

17 applications.Support your justification. Evaluate BTL-5

1. Many search operations in sorted list.

2. Many search operations in Unsorted list.

18 Compare singly linked list with circular linked listEvaluate BTL-5

19 Develop a simple C Program to Modify a Node in a Linked ListCreate BTL-6

20 Develop an algorithm for insertion operation in a singly linked Create BTL-6list.

Part -B

S. Question Competence BTL

No

Explain and describe the following(8+8)Remember BTL-1

1 i.Applications of lists.

ii.Polynomial manipulation.

2 What is a Linked List? Describe the Suitable routine Segments Remember BTL-1for Any Four Operations (16)

List an algorithm to perform insertion and deletion on a doublyRemember BTL-1

3 linked list.(16)

(i) Give the insertion and deletion procedures for cursor based

4 linked lists. (8) Understand BTL-2(ii)Give the algorithm for the deletion and reverse operations on

doubly linked list. (8)

Describe the creation of a doubly linked list and appending the

8/20/2019 PDS-1.pdf

8/14


8

5 list. Give relevant coding in C.(16) Understand BTL-2

Write a C Program to Demonstrate a addition, subtraction and6 multiplication operations on polynomial using a linked list.(16) Analyze BTL-3

Analyze and Write C Code for Circular Linked list with7 create,insert,delete,display operations using structure pointer.(16) Analyze BTL-3

8 Explain the application of linked list in detail.(16) Apply BTL-4

Consider an array A [1: n].Given a position, write an algorithm to

insert an element in the Array. If the position is empty, the

element is inserted easily.If the position is Already occupied the9 element should be inserted with the minimum number of Evaluate BTL-5

shifts.(Note :The elements can shift to the left or to the right to

make the minimum number of moves.).(16)

(i) Develop the insertion and deletion procedures for cursor

10 basedlinkedlists. (8)

Create BTL-6(ii) Develop the algorithm for the deletion and reverse

operations ondoubly linked list. (8)

UNIT 4

Part-A


No

1 Define Stack and Queue. Remember BTL-1

2 Define double ended queue. Remember BTL-1

3 List the applications of a queue. Remember BTL-1

4 What are the applications of priority queue? Remember BTL-1

5 List any four applications of stack? Remember BTL-1

6 What is Doubly Ended Queue? Remember BTL-1

8/20/2019 PDS-1.pdf

9/14


9

Given the prefix for an expression .write its postfixUnderstand BTL-27

-*-+abc/ef-g/hi

Circular queue is better than standard linear queue, Discuss andUnderstand BTL-28 Explain.

9 Describe how the following "infix" expression is evaluated with Understand BTL-2the help of Stack : 5 * ( 6 + 2 ) - 12 / 4

10 Distinguish between queues and linked list Understand BTL-2

1 Classify the different types of queues. Apply BTL-3

12

Illustrate the difference between a queues and linked lists with an Apply BTL-3

Example

13 Complete a routine to display the contents of queue. Apply BTL-3

14Analyze and Write a routine to check whether the stack is full or Analyze BTL-4empty

Point out the advantage of representing stack using a linked listAnalyze BTL-415 than array.

Point out the rules to be followed during the infix to postfixAnalyze BTL-416 conversions

For Railway Reservation the queue data structure is preferred – Evaluate BTL-517 Justify

18 Compare the working of Stack and Queue Data Structure. Evaluate BTL-5

19 Develop an algorithm for inserting a new element into the stack. Create BTL-6

Develop an algorithm for deleting an element in a double endedCreate BTL-620 queue.

8/20/2019 PDS-1.pdf

10/14


10

Part -B


No

1 Briefly Describe the operations of queue with examples.(16) Remember BTL-1

Describe about stack ADT in detail. Explain any one applicationRemember BTL-12 of stack.(16)

Describe about Queue ADT in Detail. Explain any oneRemember BTL-13 application of queue with suitable example.(16)

4 (i) Give an algorithm for Push and Pop operations on Stack using Understand BTL-2a Linked List. (8)

8/20/2019 PDS-1.pdf

11/14


11

(ii) Discuss about addition and deletion operations performedon acircular queue with necessary algorithms. (8)

i Describe the process of postfix expression evaluation with an

example. (8)

5 ii. Describe the process of conversion from infix expression to Understand BTL-2 postfix expression using stack. (8)

a. Writea C Program that checks if expression is correctly

parenthesized using stack and illustrate with an example .(12)6 b.Write the function to examine whether the stack is full() or Analyze BTL-3

Empty().(4)

Analyze and Write a C Program to Implement Queue Functions7 using Arrays and Macros.(16) Analyze BTL-4

Explain Prefix, Infix and postfix expressions with an 8 example.(16) Apply BTL-4

Write an algorithm to convert an infix expression to a postfix

expression. Trace the algorithm to convert the infix expression9 ‘(a+b)*c/d+e/f” to a postfix expression .Justify the need for infix Evaluate BTL-5

and postfix expression.(16)

Develop an algorithm to perform the four operations in a double10 ended queue that is implemented as an array.(16) Create BTL-6

8/20/2019 PDS-1.pdf

12/14


12

UNIT 5

Part-A


No

1 What is hashing? Remember BTL-1

2 Define Extendible Hashing Remember BTL-1

3 What is meant by internal and external Sorting? Give any two Remember BTL-1Examples for each type.

4 Name the applications of linear and binary search techniques. Remember BTL-1

5 Describe the complexity of bubble sort.Remember BTL-1

6 Identify the advantage of shell sort over insertion sort. Remember BTL-1

7 Give the time complexities of bubble sort and quick sort. Understand BTL-2

8 Predict the fastest sorting algorithm, justify. Understand BTL-2

9 Predict the fastest searching algorithm, Justify. Understand BTL-2

10 Distinguish between Linear and Binary search technique. Understand BTL-2

11 Classify the different sorting methods. Apply BTL-3

12 Illustrate the Time Complexity of insertion sort with an example Apply BTL-3

13 Which hashing technique is best and illustrate with an example? Apply BTL-3

14 Compare internal and external sorting. Analyze BTL-4

8/20/2019 PDS-1.pdf

13/14


13

15 Pointout the advantages of using quick sort. Analyze BTL-4

16 Compare the working of linear and binary search techniques. Analyze BTL-4

Select the best sorting method out of the following - Insertion Evaluate BTL-5

17 sort, quick sort and merge sort and give justification.

18 Summarize the open addressing hashing method with an example. Evaluate BTL-5

19 Develop an algorithm for a quick sort. Create BTL-6

20 Develop a simple C Program for a linear search. Create BTL-6

Part -B


No

1 Describe how the divide and conquer technique is implemented in Remember BTL-1 binary search.(16)

2 Describe the algorithm for Insertion sort and sort the following Remember BTL-1array: 77, 33, 44, 11, 88, 22, 66, 55. (16)

List the different types of hashing techniques? Explain them in

Remember BTL-13 detail with an Example. (8+8)

a. Interpret the result of inserting the keys 2, 3, 5, 7, 11, 13, 15, 6,

4 into an initially empty extendible hashing data structure with M

4 = 3. (8) Understand BTL-2

b.Discuss the running time of Divide-and-Conquer merge sort

algorithm. (8)

Sort the sequence 3, 1, 4, 1, 5, 9, 2, 6, 5 using insertion sort and5 Describe the routine.(16) Understand BTL-2

Write an algorithm to sort a set of ‘N’ numbers using quick sort

6 Demonstrate the algorithm for the Following set of numbers Analyze BTL-3

88,11,22,44,66,99,32,67,54,10(16)

Explain the Various collision resolution techniques in detail with7 an example.(16) Analyze BTL-4

8/20/2019 PDS-1.pdf

14/14


14

Compare the different Sorting methods and discuss about each8 method in a very detailed Manner. (16) Apply BTL-4

a. Sort the given integers and Explain the intermediate results

using shell sort.(8)

9 35,12,14,9,15,45,32,95,40,5 Evaluate BTL-5 b.Write and Explain a C code to sort an integer array.(8)

a. Create a C Code to perform a binary Search.(8)

10 b. Develop an algorithm for merge sort and quick sort with an Create BTL-6

example.(8)

PDS-1.pdf

Documents