BIT BANK 2020

SIDDARTHA INSTITUTE OF ENGINEERING & TECHNOLOGY:: PUTTUR

(AUTONOMOUS)
Siddharth Nagar, Narayanavanam Road – 517583
QUESTION BANK (OBJECTIVE)

Subject with Code: (20CS0501) C Programming and Data Structures

Course & Branch: B.Tech – Common to all
Year & Sem : I-B.Tech & I-Sem Regulation : R20

U
NIT-1
INTRODUCTION TO C LANGUAGE, STATEMENTS

1 A_____is source-program text that the compiler does not break down into component elements. [B ]
A)Comments B)Tokens C)Keywords D)Identifiers
2 A ___is a sequence of characters beginning with a forward slash/asterisk combination (/*) [D ]
A) Keywords B)Identifiers C)Tokens D)Comments
3 ___________are words that have special meaning to the C compiler. [A ]
A) Keywords B)Identifiers C)Tokens D)Comments
4 How many keywords available in C) [A ]
A) 32 B)30 C) 33 D)31
5 ______are the names you supply for variables, types, functions, and labels in your program. [D ]
A)Comments B)Tokens C)Keywords D)Identifiers
6 ____ names must differ in spelling and case from any keywords. [B ]
A) Keywords B)Identifiers C)Tokens D)Comments
7 You cannot use ____ as identifiers. [C ]
A)Comments B)Tokens C)Keywords D)Identifiers
8 A ____is a number, character, or character string that can be used as a value in a program. [A ]
A) Constants B) Special characters C)Puctuations D) All
A____ is a sequence of characters from the source character set enclosed in double quotation
9 [B ]
marks (" ").
A) Comments B) String literals C) Keywords D) None
10 Which are used to store the value during the execution of a program? [A ]
A)Variables B) Memory C) Datatype D)RAM
11 ____is a combination of alphabets and digits. [B ]
A) Memory B) Variables C) Datatype D)RAM
12 Variable name should not make use _____. [C ]
A)Comments B)Tokens C)Keywords D)Identifiers
13 Variable name should not start with a ____. [C ]
A)Datatype B) Variable C)numbers D) all
14 How many byte can occupies character datatypes. [C ]
a. 2 bytes B)4 bytes C) 1 byte D) 8 bytes
15 How many byte can occupies integer datatypes. [A ]
A)2 bytes or 4 bytes B)4 bytes C) 1 byte D) 8 bytes

(20CS0501) C Programming and Data Structures Page 1

 BIT BANK 2020
16 It is specified at the start of the program in the form of [B ]
A) Function B) comments C) Identifiers D) None
17 ___files help us to access other‟s improved code into our code. [A ]
A) Header B)command C)a&b D)None
18 A copy of these multiple files is inserted into our program before the process of compilation. [A ]
A) preprocessor B)command C) variable D) datatype
19 Which symbol is used declare preprocessor directives. [C ]
A) % B)& C)# D) *
20 The _____ preprocessor is used to create a constant throughout the program. [B ]
A)#include B)#define C)#elseif D) all
21 Which variable declares top of the program. [B ]
A)Local B)global C)Function D) Both A & B
22 ____ main tells the compiler that the program will not return any value. [C ]
A)scanf() B)printf() C)void() D)return()
23 The ____ function is an input function. [D ]
A)sum() B)printf() C)void() D)scanf()
24 The ____ function is an output function. [B ]
A)sum() B)printf() C)void() D)scanf()
25 Which operators are used to compare two values. [C ]
A)Arthimetic B)Reational C) Comparison D)All
26 Which operators are used to determine the logic between variables or values [D ]
A)Arthimetic B)Reational C) Comparison D) Logical
27 Implicit Conversion also called as___ [A ]
A)Automatic B)Programmer C)a&b D)None
28 Explicit conversion also called as___ [B ]
A)Automatic B)Programmer C)a&b D)None
29 It is used to decide whether a certain statement or block of statements will be executed or not [A ]
A)if B)if-else C)nested if D)elseif ladder
30 ___statements mean an if statement inside another if statement. [C ]
A)if B)if-else C)nested if D)elseif ladder
31 ____ statements are used to repeat set of statements. [C ]
A)condition B)switch C)Loop control D) jump
32 This loop control statement is used to terminate the loop. [D ]
A)switch B)continue C)goto D)break
33 The ____ statement forces the loop to continue or execute the next iteration. [B ]
A)switch B)continue C)goto D)break
34 _____statement can be used to jump from one point to another within a function [C ]
A)switch B)continue C)goto D)break
35 are the combinations of two operands and an operators. [A ]
A)Expression B)Prefix C)Postfix D)Infix
36 Addition of two numbers is performed using operator [A ]
A)Arithmetic B)Reational C)Bitwise D)Logical
37 The conditional operators are sometimes called operators. [C ]

(20CS0501) C Programming and Data Structures Page 2

 BIT BANK 2020
A)Binary B)Unary C)Ternary D)None
38 is used to convert one data type to another data type. [A ]
A) Type Conversion B) Type Casting C) Widening D) Narrowing
39 statements involves a decision making condition. [A ]
A) Decision B) Control C) Both A & B D) Loop control
40 The default statement is executed when ______ [A ]
A) all the case statements
B) One case is true C) One case is false D) None
are false

UNIT-2
ARRAYS, FUNCTIONS AND STRINGS

___________is defined as the collection of similar type of data items stored at contiguous [B ]
1
memory locations
A)Functions B)Arrays C)Pointers D)Strings
2 An array with two or more dimensions is called . [D ]
A)Array B) One-dimensional C) Two-Dimensional D) Multi-Dimensional
Array Array Array
________in C is an integer type constant or variable name whose value ranges from 0 to SIZE 1 [B ]
3
where SIZE is the total number of elements in the array
A)Array index B)Array subscript C)Both A & B D) None
4 ________in C are inbuilt functions [B ]
A)User Defined Functions B) Library functions C) Both A & B D)None
_______is a region of the program where a defined variable can have its existence and beyond [B ]
5
that variable it cannot be accessed)
A)Life time B)Scope C)Block D)All
6 The keywords which are used to modify the properties of a variable are called ____________ [A ]
A)type Qualifiers B)Scope C)global Variables D)Local variables
Variable is defined as __________, the program may not change the value of the variable [B ]
7
explicitly.
A)Constant B)Volatile C)Changable D)Adoptable
8 _________values can’t be modified by the program once they are defined) [A ]
A)constant B)volatile C)changable D)adoptable
9 ___________are defined as an array of characters. [C ]
A)structure B)union C)string D)integer array
10 clrscr() is a predefined function in _______________ standard Header file [D ]
A) <stdlib)h> B) <math.h> C) <stdio.h> D) <conio.h>
11 Sqrt() function is defined in __________________ header file [B ]
A) <stdlib)h> B) <math.h> C) <stdio.h> D) <conio.h>
12 Statements enclosed in a set of braces are called [A ]
A) Block B)string C)pointer D)All
13 ____Scope of object define in the global area is up to end of the program. [A ]
A)Global B)Local C)Static D)Public
14 Variable is define within the block are visible only in the block is called scope. [B ]
A)Global B)Local C)Static D)Public
15 The default storage class in C is called .
[C ]

(20CS0501) C Programming and Data Structures Page 3

 BIT BANK 2020
A)register B)static C)auto D)extern
16 is a keyword in external storage class.
[D ]
A)register B)static C)auto D)extern
17 is a variable that can be made unchanged during program execution.
[C ]
A)volatile B)restrict C)constant D)all
18 ____function call itself, till the condition is true. [A ]
A) recursion B)main() C)local D)global
19 ______________returns true if a certain macro is not defined)
[C ]
A)#include B)#define C)#ifndef D)#error
20 The directive is used to display user defined error message during compilation [D ]
A)#include B)#define C)#ifndef D)#error
21 To define a variable as automatic storage class, the keyword is used [A ]
A)auto B)register C)static D)extern
22 To define a variable as register storage class, the keyword is used [B ]
A)auto B)register C)static D)extern
23 To define a variable as static storage class, the keyword is used [C ]
A)auto B)register C)static D)extern
24 An External variable is also called [A ]
A)global B)local C)static D)public
[D ]
25 ________ macro is used to define the sections of the code to make them more
Understandable and readable
A)#define B)#error C)#ifndef D)#region
[A ]
26 _________handles the line numbers on the errors and warnings. It can be used to change the
line number and source files while generating output during compile time.
A)#line B)#error C)#if D)#define
27 ___directives are macro templates [D ]
A)#include B)#define C)#error D)all
28 A macro defined with #define directives can be undefined with directive [D ]
A)#include B)#define C)#error D)#undef
29 # is a symbol used with [A ]
A)directives B)variables C)keyword D)functions
30 #if, #else, #endif are directives [D ]
A)Conditional B)include C)error D)undefined
Compilation
31 directive is used to cause the compiler to imagine -the line number of next [D ]
source line
A)#include B)#define C)#error D)#line
32 ___________is performed to continue compilation with messages in the console window. [A ]
A) #warning B) #define C) #error D) #line
33 macro is used for standard error output device [C ]
A)stdin B) stdout C) stderr D) stdprn
34 header file contains set of macros that check characters [C ]
A)stdio.h B)conio.h C)ctype.h D)math.h
35 is a collection or set of characters and terminated with null character [A ]
A)string B)number C)characters D)symbols

(20CS0501) C Programming and Data Structures Page 4

 BIT BANK 2020
36 ___function makes a copy of source, a string, in the character array [A ]
A)strcpy B)strncpy C)strcat D)strlen
37 ____function compares s1 and s2 automatically. [B ]
A)strcpy B)strncpy C)strcat D)strlen
38 ___returns the number characters in string. [D ]
A) strcpy B) strncpy C)strcat D)strlen
39 ____appends source to end of the destination. [C ]
A)strcpy B)strncpy C)strcat D)strlen
[A ]
40 char x[80] = "gorilla"; char y[80]= "giraffe"; strcat(x,y); printf("%s %s\n",
x,y); what is output?
A)gorillagiraffe giraffe B)giraffegorilla gorilla C) gorilla gorilla D)giraffe

UNIT-3
POINTERS, STRUCTURES AND UNION

1 is used to store the address of variable [B ]

A) variable B)pointers C) array D) function
2 To access the address of a variable to a pointer we use the symbol in the following [A ]
A) & B) * C) # D) @
3 Which of the following symbol is used to identify the pointer [B ]
A) & B) * C) # D) @

4 Pointer is a [C ]
A) Function B) Array C)Variable D)Structure
5 Used to form complex data structures such as linked lists, graphs, trees. [D ]
A)Data types B)Functions C)Arrays D)Pointers
6 is an address of variable [A ]
A)Void pointers B)Null pointers C)Wild pointers D)All
7 Can be created by assigning a zero value during pointer declaration. [B ]
A)Void pointers B)Null pointers C)Wild pointers D)All

8 are the pointers that have not been initialized with something yet. [C ]
A)Void pointers B)Null pointers C)Wild pointers D)All

9 If the elements of an array are address, such an array is called an [D ]

A)Structure B)Union C)Function D)Array pointer
_________________is used to returns the number of bytes used to [B ]
10
store the pointer variable
A)Array B)size of () C)realloc() D)All
11 A pointer is a variable used to store [B ]
A)Value B)Memory address C)Index D)None

12 When we want to point at multiple variables or memories of the same data type [B ]
in c program, which is responsible
A)Function B)Array pointers C)Array D)All
13 Allocates single block of requested memory.
[A ]

(20CS0501) C Programming and Data Structures Page 5

 BIT BANK 2020
A)Malloc () B)Calloc () C)realloc () D)free ()
14 Allocates multiple block of requested memory.
[B ]
A)Malloc () B)Calloc () C)realloc () D)free ()

15 Reallocates the memory occupied by malloc () or calloc () functions.

[C ]
A)Malloc () B)Calloc () C)realloc () D)free ()

16 frees the dynamically allocated memory.

[D ]
A)Malloc () B)Calloc () C)realloc () D)free ()
17 Method, the value of actual parameters is copied into the formal parameters
[A ]
A)Call by value B)Call by reference C)Array pointer D)Memory
address
18 Actual parameters located in which area? [D ]
A)Memory location B)Function declaration C)Function definition D)Function call
19 is the address of the variable is passed into the function call as the actual parameter.
[A ]
A)Call by value B)call by reference C)Array pointer D)Memory
address
20 Formal parameters located in which are [C ]
A)Memory location B)Function declaration C)Function definition D)Function call
21 is a sequence of characters. [ ]
A)String B)keyword C)Variable D)Character

22 In c programming character makes the end of a string [ ]

A)Null B)Void C)Simple D)All
[ ]
23 Asterisk (*) symbol also known as
[ ]
A)Direction pointer B)Indirection pointer C)Null Pointer D)Void pointer
24 Which of this has higher precedence for pointers in a c program. [ ]
A)Brackets B)Identifiers C)Data types D)Asterisk
25 What is the associativity for () and [] in a c program? [ ]
A)Right to left B)Left to Right C)Depends on the D) Both A & B
precedence
26 What is (void *)0? [ ]
A)Null pointer B)Void Pointer C)Error D)None
27 In which header file is the NULL macro defined? [ ]
A)Stdio.h B)Stddef,h C)stdio.h& stddef.h D)math.h
28 If a variable is a pointer to structure, then which of the following operator is used to access data [ ]
members of the structure through the pointer variable?
A)(.) B)& C)* D)🡪
29 The operator used to get value at address stored in pointer variable is [ ]
A)* B)& C)&& D)||
30 name is the collection of different datatype variables, grouped together under a single [ ]
A)Union B)Structure C)Array D)Pointer

31 To represent the structure, which keyword is responsible? [ ]

A)break B)Continue C)struct D)goto

(20CS0501) C Programming and Data Structures Page 6

 BIT BANK 2020

The struct is a [ ]
32 [
]
A)Variable B)Functions C)Array D)Keyword

33 To access the structure member, which operator is responsible [ ]

A)* B)(.) C)& D)&&

Dot operator(.) also called as operator [ ]

34
[ ]
A)Member access B)Logical C)Arithmetic D)Bitwise
35 Typedef is a _______ [ ]

A)Variable B)Keyword C)Function D)Array

Keyword is used to provide some meaningful names to the already existing variable
36 in c language. [ ]
A)break B)auto C)typedef D)enum
enum is a [ ]
37
[ ]
A)Variable B)Function C)keyword D)array
is the user defined datatype that consists of integer values and it provides meaningful [ ]
38
names to these values
A)enum B)typedef C)continue D)goto
39 _____ is the User-defined data type which is a collection of different variables of different [ ]
datatypes in the same memory location
A)Union B)structure C)Array D)Pointer

40 Union is a ______ [ ]
A)Keyword B)variable C)Array D)Pointer

UNIT-4

DATA STRUCTURES AND LINKED LIST

1 ____________ is a way of organising data in a memory. [ ]

A)Data structure B)Linear data structure C) Non-linear data D)Tree data
structure structure
2 Static is a ______ data structure [ ]
A)Non-linear B) Linear C)Tree D)Graphs
3 ____________is a linear data structure. [ ]
A) Graph B)Tree C)Array D)None
4 ____________ is a non-linear data structures. [ ]
A)Array B)Tree C)Stack D)Queue
5 ____________ elements are arranged in a linear order. [ ]
A)Data structure B)Linear data structure C) Non-linear data D)Tree data
structure structure
6 ____________ data structures does not form a sequence. [ ]
A)Data structure B)Linear data structure C) Non-linear data D)None
structure

(20CS0501) C Programming and Data Structures Page 7

 BIT BANK 2020
7 A stack is an _________ datatype. [ ]
A)Abstract B)Int C)Double D)Char
8 LIFO stands for ________ [ ]
A)Last in last out B) Last in first out C)First in first out D)First in last out
9 Insertion operation is called_____ [ ]
A)pop() B)push() C)enqueue() D)dequeue()
10 Removal operation is called _______ [ ]
A)pop() B)push() C)enqueue() D)dequeue()
11 If stack is not full,________ by top of stack. [ ]
A)Increment B)decrement C)pre-increment D)pre-decrement
12 The last element entered is the first one to be popped out _______ technique [ ]
A)FIFO B)queue C) Both A & B D)LIFO
13 Example for operations on stack ______
[ ]
A)a pile of plates B)Ticket counter queue C)Tiffin carrier D) Both A & B
14 _______ is an application of stack.
[ ]
A)Backtracking B)Delimiter Checking C) Both A & B D)None
15 An arithmetic expression consists of ________ and _______
[ ]
A)operands B)operators C) Both A & B D)operation
16 _______ Notations for Arithmetic Expression. [ ]
A)Infix Notation B)Prefix Notation C)Postfix Notation D)All
17 _____________ notation , in which each operator is placed between the operands. [ ]
A)Infix Notation B)Prefix Notation C)Postfix Notation D)All
18 Example for the Infix notation______ [ ]
A)AB+ B)A+B C)-AB D)*AB
19 The ______notation places the operator before the operands [ ]
A)Infix Notation B)Prefix Notation C)Postfix Notation D)All
20 Example for the Prefix notation______ [ ]
A)AB+ B)A+B C)-AB D)A*B
21 The _______ notation places the operator after the operands [ ]
A)Infix Notation B)Prefix Notation C)Postfix Notation D)All
22 Example for the Postfix notation______ [ ]
A)AB+ B)A+B C)-AB D)All
23 FIFO stands for __________ [ ]
A)Last in last out B)Last in first out C)First in first out D)First in last out
24 Example for operations on Queue ______ [ ]
A)a pile of plates B)Ticket counter queue C)Tiffin carrier D) Both A & C
25 ________operations performed in queue.
A)Enqueue B)Dequeue C) Both A & B D)None
26 Enqueue performs at _____end [ ]
A)Front B)Rear C)Head D)None
27 In enqueue, it is not full,rear increased index by ____ [ ]
A)0 B)1 C)3 D)4
28 _____ is used to track the first element of the queue [ ]
A)Front B)Rear C)Head D)enqueue

(20CS0501) C Programming and Data Structures Page 8

 BIT BANK 2020
29 _____ is used to track the last element of the queue. [ ]
A)Front B)Rear C)Head D)dequeue
30 Dequeue performs at _____end [ ]
A)Front B)Rear C)Head D) Both A & C
31 If it is full.we cannot add the new element to enqueue, then it is ______ [ ]
A)empty B)overflow C) Both A & B D)dequeue
32 If that is empty, we cannot remove the element has no elements in ____ [ ]
A)full B)overflow C) Both A & B D)dequeue
33 Simple Queue strictly follows ____________ [ ]
A)Last in last out B)Last in first out C)First in first out D)first in last out
34 In a _______ queue, the last element points to the first element making a circular link. [ ]
A)Simple Queue B)Circular Queue C)Priority Queue D)Double Ended
Queue
35 A _________ queue is served according to its priority [ ]
A)Simple Queue B)Circular Queue C)Priority Queue D)Double Ended
Queue
36 In a _____ queue, it does not follow the FIFO rule. [ ]
A)Simple Queue B)Circular Queue C)Priority Queue D)Double Ended
37 __________is a very commonly used linear data structure. [ ]
A)Trees B)graph C)linked list D)None
38 ______ linked list performs insertion, deletion and traversal. [ ]
A)Singly B)Circular C)Priority list D)Double linked
list
39 _______the last node of the list holds the address of the first node. [ ]
A)Singly B)Circular linked list C)Priority list D)Double linked
list
40 In which _____ linked list, each node contains a data part and two addresses [ ]
A)Singly B)Circular C)Priority list D)Double linked
list

UNIT-5

SEARCHING & SORTING

_______ is an operation or a technique that helps finds the place of a given element or value in [ ]
1
the list.
A)Sorting B)Searching C) Both A & B D)None
2 Searching techniques are ______ [ ]
A) Linear search B) Binary search C) Both A & B D)Data structure
In _________, we search an element or value in a given array by traversing the array from the [ ]
3
starting, till the desired element or value is found
A) Integrated Search B)Binary search C)Linear search D)Data structure
4 Linear search is applied on ______ [ ]
A) Sorted list B)Unsorted list C)Unordered list D)Both B & C
5 _________ is used with sorted array or list. [ ]
A) Table B)Binary search C)Linear search D)Data structure

(20CS0501) C Programming and Data Structures Page 9

 BIT BANK 2020
6 In Binary search, we search the element in the ________ of the list. [ ]
A)First B)Second C)Middle D)Last
7 If we get a match, we return the _____of the middle element. [ ]
A)-1 B)1 C)Index D)0
If we do not get a match, we check whether the element to be ______is less or greater than in [ ]
8
value than the middle element.
A)Sort B)search C)insert D)select
If the element to be searched is greater than the middle number, then we pick the elements on the [ ]
9
_____side of the middle element.
A)Left B)Right C)adjacent D) Both A & B
If the element to be searched is lesser than the middle number, then we pick the elements on the [ ]
10
_____side of the middle element.
A)Left B)Right C)adjacent D) Both A & B
11 Half of the array by using the mid formula____
[ ]
A)mid = low - (high - low) B)mid = low + (high - C)mid = low + (high + D)mid = low -
/2 low) / 2 low) / 2 (high + low) / 2
12 Search the middle element in the list 10 ,14 ,19 ,26 ,27, 31, 33 ,35 ,42, 44
[ ]
A)26 B)31 C)42 D)35
13 A ______ algorithm is an algorithm that puts elements of a list in a certain order.
[ ]
A)Sorting B)searching C) Both A & B D)None
14 The most used orders are ______order and lexicographical order.
[ ]
A)Alphabetical B)ASCII C)Numerical D) Both A & C
15 Exchange sort is also called as____
[ ]
A)Quick sort B)Bubble sort C)merge sort D)Insertion sort
16 Do the exchange sort for given list 54,26,93,17,77,31,44,55,20
[ ]
A) 77,26,93,17,54,31, B) 77,26,93,17,54,31, C) 54,55,93,17,77,31, D)93,77,55,54,44,
44,55,20 55,31,20 44,26,20 31,26,20,17
Which of the following sorting algorithm should be performed, which assignment operations
17 [ ]
is minimized.
A)Insertion sort B)Selection sort C)Quick sort D)None
18 Which of the following is not a stable sorting algorithm?
[ ]
A)Insertion sort B)Selection sort C)Bubble sort D)Merge sort
19 Which of the following is a stable sorting algorithm
[ ]
A)Merge sort B)Quick sort C)Heap sort D)Selection sort
20 The _____are divided again and again into halves until the list cannot be divided further. [ ]
A) Sub-list B)ordered-list C)unordered list D) Both A & C
21 In sort two successive elements are compared and swapping is done [ ]
A)Insertion sort B)Selection sort C)Quick sort D)Buuble sort
22 _________sort is nearly the same as exchange sort [ ]
A)Insertion sort B)Selection sort C)Quick sort D)Heap sort
23 _________compares adjacent items and exchanges those that are out of order. [ ]
A)Quick sort B)Exchange sort C)merge sort D)Insertion sort
24 ________ takes place in exchange sort for descending order. [ ]
A)Swapping B)Merging C) Both A & B D)All
25 In which sorting, two lists are merged to form new list?

(20CS0501) C Programming and Data Structures Page 10

 BIT BANK 2020
A)Bubble sort B)Selection sort C)Merge sort D)Radix sort
26 Which of the following is not an in-place sorting algorithm. [ ]
A)Selection sort B)Heap sort C)Quick sort D)Merge sort

_____________works by taking elements from the list one by one and inserting them in their [ ]
27
current position into a new sorted list.
A)Quick sort B)Bubble sort C)merge sort D)Insertion sort
28 Insertion sort consists of _______ passes [ ]
A)N-1 B)N+1 C)n-1 D)n+1
The _________ improves on the bubble sort by making only one exchange for every pass [ ]
29
through the list.
A)Quick sort B)merge sort C)selection sort D)Insertion sort
Which of the following sorting algorithm should be performed, which assignment operations [ ]
30
is minimized
A)Insertion sort B)Selection sort C)Quick sort D)None
31 Merge sort uses _______ approach. [ ]
A)Backtracking B)Divide and conquer C) Both A & B D)None
32 ______ function to perform the merging. [ ]
A)Swap() B)merge() C)add() D)fun()
33 ______ is a divide and conquer algorithm [ ]
A)merge sort B)selection sort C)Exchange sort D)Quick sort
34 ______ element is selected as first or last element in the list [ ]
A)pivot B)ordered C)unordered D) Both A & C
35 ____ is a pivot element. [ ]
A)L B)R C)k D)P
36 ____ is the left pointer in quick sort. [ ]
A)L B)R C)k D)P
37 ____ is the Right pointer in quick sort [ ]
A)L B)R C)k D)P
38 In quick sort , 6, 3, 7, 2, 4, 5. Pivot is greater than right side then _______________ [ ]
A)Move towards right B)swap P with R C)move towards left D)None
39 In quick sort, 6, 3, 7, 2, 4, 5. Pivot is greater than left side then______ [ ]
A)Move L towards right B)Swap P with R C)Move towards left D)Swap
40 In quick sort, final sorted list for 6, 3, 7, 2, 4, 5 [ ]
A)3,6,4,7,5,2 B)4,4,6,7,2 ,5 C)2,3,4,5,6,7 D) Both A & B

(20CS0501) C Programming and Data Structures Page 11

 BIT BANK 2020

CDS - Bit Bank –

Key
UNIT-I KEY
1 b 11 b 21 b 31 c
2 d 12 c 22 c 32 d
3 a 13 c 23 d 33 b
4 a 14 c 24 b 34 c
5 d 15 a 25 c 35 a
6 b 16 b 26 d 36 a
7 c 17 a 27 a 37 c
8 a 18 a 28 b 38 a
9 b 19 c 29 a 39 a
10 a 20 b 30 c 40 a
UNIT-2 KEY
1 b 11 b 21 a 31 d
2 d 12 a 22 b 32 a
3 b 13 a 23 c 33 c
4 b 14 b 24 a 34 c
5 b 15 c 25 d 35 a
6 a 16 d 26 a 36 a
7 b 17 c 27 d 37 b
8 a 18 a 28 d 38 d
9 c 19 c 29 a 39 c
10 d 20 d 30 d 40 a
UNIT-3 KEY
1 b 11 b 21 a 31 c
2 a 12 b 22 a 32 d
3 b 13 a 23 b 33 b
4 c 14 b 24 a 34 a
5 d 15 c 25 d 35 b
6 a 16 d 26 a 36 c
7 b 17 a 27 c 37 c
8 c 18 d 28 d 38 a

(20CS0501) C Programming and Data Structures Page 12

 BIT BANK 2020
9 d 19 a 29 a 39 a
10 b 20 c 30 b 40 a
UNIT-4 KEY
1 a 11 a 21 c 31 b
2 b 12 d 22 a 32 d
3 c 13 d 23 c 33 c
4 b 14 c 24 b 34 b
5 b 15 c 25 c 35 c
6 c 16 d 26 b 36 d
7 a 17 a 27 b 37 c
8 b 18 b 28 a 38 a
9 b 19 b 29 b 39 b
10 a 20 c 30 a 40 d
UNIT-5 KEY
1 b 11 b 21 d 31 b
2 a 12 b 22 b 32 b
3 c 13 a 23 b 33 d
4 d 14 c 24 a 34 a
5 b 15 b 25 c 35 d
6 c 16 d 26 d 36 a
7 c 17 b 27 d 37 b
8 b 18 b 28 a 38 b
9 b 19 a 29 c 39 a
10 a 20 a 30 b 40 c

(20CS0501) C Programming and Data Structures Page 13