Scribd
Upload
52 views7 pages

Cp&ds Model Exam Question

This document contains 3 sample exam papers for a CSE exam in January 2021. Each paper has 2 parts - Part A contains short answer questions worth 2-3 marks each and Part B contains longer answer questions worth 10 marks each that can be answered in section A or B. The papers cover topics like variables, functions, data structures, file handling, pointers, classes, inheritance and sorting algorithms in C++.

Uploaded by

Sri Ranjani
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
52 views7 pages

Cp&ds Model Exam Question

This document contains 3 sample exam papers for a CSE exam in January 2021. Each paper has 2 parts - Part A contains short answer questions worth 2-3 marks each and Part B contains longer answer questions worth 10 marks each that can be answered in section A or B. The papers cover topics like variables, functions, data structures, file handling, pointers, classes, inheritance and sorting algorithms in C++.

Uploaded by

Sri Ranjani
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/ 7

331

-----------
CSE – JAN 2021
-----------
Time – Three hours
(Maximum marks- 100 marks)
PART – A
[Note : 1. 10 questions are to be answered each carries 3 marks.(10*3=30)
2. 5 questions will be in either or pattern each question carries 14 marks.
(5*14=70)

1. Give the rules for declaring variables.


2. Evaluate an arithmetic expressions (5*2)+3-(5/6)
3. List the different category of functions.
4. Declare and initialize a string variable.
5. Write the general form to open a file.
6. Give the general form of structure with in structure.
7. Define circular queue.
8. What are the operations on data structures.
9. Define singly linked list.
10. Give the algorithm for inorder traversal.

(Turn
over ............
/2/

PART - C
[Note: (1) Answer all questions from 17 to 21 either A or B.
(2) Each question carries 10 marks.]

11. (A) Explain program development cycle.


(OR)
(B) (i) Write a program to factorial of n number.
(ii) Explain formatted input function.
12. (A) Explain the different category of functions with example.
(OR)
(B) Explain switch…..case with example.

13. (A) (i) Explain declaration and initialization of a pointer with example.
(ii)Explain the use of command line arguments.
(OR)
(B) Explain the various I/O operations on files.
14. (A) With example explain the conversion of infix to postfix expression using
stack.
(OR)
(B) (i) Explain different approaches to design algorithm.
(ii) Discuss about the types of data structures.
15. (A) Explain Quick sort.
(OR)
(B) (i) Explain the memory representation of singly linked list.
(ii) Explain binary tree traversal and explain any one traversal with example.

------------
332
-----------
CSE – JAN 2021
-----------
Time – Three hours
(Maximum marks- 75 marks)
PART – A
[Note: 1. (1 to 8) 5 Questions are to be answered out of 8 questions.
2. Question no. 8 will be compulsory.
3. Each question carries 2 marks.]

1. Give the importance of flowchart.


2. Write down the features of c language.
3. Give the general form of function.
4. Discuss goto statement.
5. List any three errors in files.
6. How pointer variables are declared?
7. What is the use of init() method>
8. What is the base classes needed to create an applet?
9. Write about doubly linked list.
10. Explain sequential search.
(Turn
over ............

/2/

PART - C
[Note: (1) Answer all questions from 17 to 21 either A or B.
(2) Each question carries 10 marks.]

11. (A) (I) Explain formatted output function.


(ii) Explain the structure of c program.
(OR)
(B) (i) Briefly discuss about programming languages.
(ii) Explain the flowchart symbols.
12. (A) (i) Discuss scope and life time of variable.
(ii) Explain For loop with example.
(OR)
(B) Discuss about string handling functions.

13. (A) Explain the different functions used in dynamic memory allocation.
(OR)
(B) (i) Define a file.How a file is opened and closed?
(ii) Explain increment and scale factor in pointers.
14. (A) Explain how to evaluate a postfix expression.
(OR)
(B) Explain the operation on stack and implement the operation.
15. (A) (i) Give the advantages of and disadvantages of of linked list.
(ii) Explain any five basic terminologies of tree.
(OR)
(B) With example explain bubble sort.
------------

333
-----------
CSE – JAN 2021
-----------
Time – Three hours
(Maximum marks- 75 marks)
PART – A
[Note: 1. (1 to 8) 5 Questions are to be answered out of 8 questions.
2. Question no. 8 will be compulsory.
3. Each question carries 2 marks.]

1. Give the datatypes and size.


2. Discuss identifiers.
3. Write any three rules for writing switch statement.
4. Give the general form of for statement and draw the flow diagram.
5. List the various I/O functions in files
6. Give the difference between array and structure.
7. What are the operations on stack.
8. Give the condition for Stack full and empty.
9. Discuss about sorting.
10. Give the difference between linked and sequential list.
(Turn over ............

/2/

PART - C
[Note: (1) Answer all questions from 17 to 21 either A or B.
(2) Each question carries 10 marks.]

11.(A) (i) Explain typecasting and its types.


(ii) Explain compiling,linking and running a c program.
(OR)
(B) Explain about operators with example.
12.(A) Difference between entry and exit control loop with example.
(OR)
(B) Explain recursion with example.
13.(A) Explain about constructors with example?
(OR)
(B) Explain about multilevel inheritance with example?
14. (A) Explain the representation of queue using array.
(OR)
(C) (i)Discuss about application of stack.
(ii) Explain the implementation of stack using array.
15.(A) (i) Explain binary search with example.
(OR)
(B) Explain about sorting technique.

------------

You might also like