Download AKTU B-Tech 1st Sem 2018-2019 Programming For Problem Solving Question Paper

Printed Pages: 02 FirstRanker.com

Paper Id: 110111 Sub Code: KCS 101

Roll No:

--- Content provided by FirstRanker.com ---

Time: 3 Hours Total Marks: 100

B.TECH.

(SEM I) THEORY EXAMINATION 2018-19

PROGRAMMING FOR PROBLEM SOLVING

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

--- Content provided by FirstRanker.com ---

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

SECTION B

2. Attempt any three of the following:

1. Explain linear search and binary search technique for searching an item in a given array. Also write the complexity for each searching technique. (10 Marks, CO4)

   --- Content provided by FirstRanker.com ---

2. A certain grade of steel is graded according to the following conditions: (10 Marks, CO3)

   1. Carbon content must be less than 0.7.
   2. Hardness must be greater than 50
   3. Tensile strength must be less than 5600

   --- Content provided by FirstRanker.com ---

   The grades are as follows:

   Grade is 10 if all the three conditions are met.

   Grade is 9 if condition (i) and (ii) are met

   Grade is 8 if condition (ii) and (iii) are met

   Grade is 7 if condition (i) and (iii) are met

   --- Content provided by FirstRanker.com ---

   Grade is 6 if only one condition is met.

   Grade is 5 if none of the conditions are met.

   Write a program, which will require the user to give values of hardness, carbon content and tensile strength of the steel under consideration and output the grade of the steel.

3. What do you mean by call by value and call by reference? Write an algorithm for swapping two numbers using call by reference technique. Also write a C program for the above stated algorithm. (10 Marks, CO5)

   --- Content provided by FirstRanker.com ---

4. Explain Selection sort technique for sorting problem. Also write an algorithm for selection sort. Sort the following numbers using selection sort technique. 26,54,93,17,77,31,44,55,20 (10 Marks, CO2)

5. Write a short note on following preprocessor directives with example: (10 Marks, CO5)

   1. Macro Expansion

   --- Content provided by FirstRanker.com ---

   2. File Inclusion

SECTION C

3. Attempt any one part of the following:

1. Describe the basic components of computer system with neat and clean block diagram. What do you mean by operating system? (10 Marks, CO1)

   --- Content provided by FirstRanker.com ---

2. Define data types in C. Discuss primitive data types in terms of memory occupied, format specifier and range. (10 Marks, CO1)

4. Attempt any one part of the following:

1. Explain various types of arithmetic operators in C language with help of example. When precedence of two operators in an arithmetic expression is same, how associativity helps in identifying which operator will be evaluated first. Illustrate it with the example... (10 Marks, CO1)

   --- Content provided by FirstRanker.com ---

2. What is case control structure in C.? What is the reason for using break statement at the end of each case in case control block? (10 Marks, CO1)

5. Attempt any one part of the following:

6. Attempt any one part of the following:

--- Content provided by FirstRanker.com ---

1. Write short notes on following. (10 Marks, CO5)

   1. Enumerated Data Type
   2. String

2. What do you mean by order of complexity? Explain various notions to represent order of complexity with diagram (10 Marks, CO2)

   --- Content provided by FirstRanker.com ---

7. Attempt any one part of the following:

1. What is dynamic memory allocation? Explain the calloc(), malloc(), realloc() and free() functions in detail. What is lifetime of a variable, which is created dynamically? (10 Marks, CO5)

2. Explain command line arguments in C with the help of example. (10 Marks, CO5)

   --- Content provided by FirstRanker.com ---

FirstRanker.com