Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
SL
NO
PROGRAM
10
11
Given two arrays A and B. Array A contains all the elements of array B
along with an extra element. Write the program to find the extra element
12
Given an array of numbers, except one number all the numbers occurs
twice. Write a program to find which numbers occurs only once.
13
14
Write the code for the series eg: If a3b2c4 ..is taken then output should
be aaabbcccc
15
16
17
18
19
20
21
22
23
24
PAGE
SL
NO
PROGRAM
PAGE
25
Write the program in an efficient way to find the middle of the linked list
26
Write a program to find the nth to last element of a singly linked list.
27
28
29
30
31
32
33
34
35
36
37
Selection sort
38
Bubble sort
39
Insertion sort
40
Quick Sort
41
Merge Sort
42
Radix Sort
43
44
If you have a 2 GB file with one string per line, which sorting algorithm
would you use to sort the file and why?
45
What sort would you use if you had a large data set on disk and a small
amount of ram to work with?
46
47
How would you design a stack which, in addition to push and pop, also
has a function min which returns the minimum element?
48
49
50
51
52
53
Write a program to implement stack with two-dimensional array. Perform push () and pop () operation.
SL
NO
PROGRAM
54
55
56
57
58
59
60
61
62
63
Write a program to declare a priority queue using two-dimensional array, store elements and priority. Display the elements according to priority from higher to lower.
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
PAGE
SL
NO
PROGRAM
PAGE
82
83
84
1
0
0
85
Write a program to find depth of binary search tree without using recursion.
86
Write a program to find out the sum of the values of the left sub tree
when the corresponding root node is entered.
87
88
89
90
91
Write a C program to insert nodes into a binary tree and traverse them
in preorder.
92
93
94
Write a program to create tree structure, perform insert and delete operations.
95
Write a program to traverse the binary search tree with different traversal methods such as inorder, preorder and postorder.
96
97
98
99