1384 Results

Sorted By: **Best match**

A sub sequence of a given sequence
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none of all) left out. We are given two sequence X[m] and Y[n] of length m and n, respectively, with indexes ...
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

A sub sequence of a given sequence
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none of all) left out. We are given two sequence X[m] and Y[n] of length m and n, respectively, with indexes ...
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

An algorithm to find the length
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array is given below.Let denote the length of the longest monotonically increasing sequence starting...
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

An undirected graph
An undirected graph contains nodes named Two nodes are connected if an only if Each edge is assigned a weight i + j . A sample graph with n = 4 is shown below.
What will be the cost of the Mini...
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

An undirected graph
An undirected graph contains nodes named Two nodes are connected if an only if Each edge is assigned a weight i + j . A sample graph with n = 4 is shown below.
The length of the path from v5 to...
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

A list of n strings
A list of n strings, each of length n, is sorted into lexicographic order using the merge sort algorithm. The worst case running time of this computation is
(A)
(B)
(C)
(D)
Total Views: 0
Posted By: Open E-School
Posted On: 2016-08-05

Algorithm and program for Enqueue operation
TERMINOLOGY-:
QUEUE - It refers to the Queue.FRONT- It refers to the Front of the queue.REAR -It refers to the Rear of the queue.N -Maximum size of the queue.ITEM - Data element to be inserted in the ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Push operation
TERMINOLOGY-:
1. TOP - It refers to the top of stack(TOS).Initially,Top has value -1.This assumption is taken so that when an element is inserted , top will first get incremented by 1 and an eleme...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-07-19

Algorithm and program for Pop operation
TERMINOLOGY-:1. TOP - It refers to the top of stack(TOS).Initially,Top has value -1.This assumption is taken so that when an element is inserted , top will first get incremented by 1 and an element is...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Dequeue operation
TERMINOLOGY-:
QUEUE - It refers to the Queue.
FRONT - It refers to the Front of the queue.
REAR - It refers to the Rear of the queue.
N - Maximum size of the queue.
ITEM - Data element to be inserted...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Deletion operation in Linked List
TERMINOLOGY-:
ITEM - Data value to be deleted.
INFO - Data field of the node.
NEXT - Pointer field of the node.
HEAD - contains the address of the first node.
PTR - Pointer variable which contains th...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Insertion operation in Linked List
TERMINOLOGY
ITEM - Node to be inserted.
INFO - Data field of the node.
NEXT - Next Pointer field of the node.
RootNode - contains the address of the first node.
PTR - Pointer variable which contains ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-09-07

Algorithm and program for Traverse operation
TERMINOLOGY
RootNode - First Node of the linked list.
PROCESS - Any operation that is to be performed on the node.
CURRENT - Pointer to a node in the linked list.
ALGORITHM FOR TRAVERSE OPERATION
St...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-09-07

Algorithm and program for Insertion operation
TERMINOLOGY-:
CQUEUE - It refers to the Circular queue.
FRONT - It refers to the Front of the queue.
REAR - It refers to the Rear of the queue.
N - Maximum size of the queue.
ITEM - Data element to b...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Deletion operation
TERMINOLOGY-:
CQUEUE - It refers to the Circular queue.
FRONT - It refers to the Front of the queue.
REAR - It refers to the Rear of the queue.
N - Maximum size of the queue.
ITEM - Data element to b...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Insertion operation in Double Linked List
TERMINOLOGY-:
ITEM - Data value to be inserted.
INFO - Data field of the node.
NEXT - Pointer field which contains the address of next node.
PREV - Pointer field which contains the address of previ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and program for Deletion operation in Double Linked List
TERMINOLOGY-:
ITEM - Data value to be deleted.
INFO - Data field of the node.
NEXT - Pointer field which contains the address of next node.
PREV - Pointer field which contains the address of previous...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-12

Algorithm and performance of Selection Sort
ALGORITHM
Procedure-MIN(a,i,n,loc)Let ‘a’ be an array of ‘n’ elements Let ‘loc’ be the location of the smallest element among A[i],a[i+1],.....a[n] during ‘i’ pass.SET min := a[i] and loc := i ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Algorithm and performance of Bubble Sort
ALGORITHM
Let ‘a’ be a linear array of ‘n’ elements and ‘temp’ is a temporary variable used to interchange the position of elements.1. Input n elements of an array a.2. SET i = 03. Repeat While (i < n...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

According to the Gregorian calendar, it was Monday on the date 01/01/1900. If any year is input
According to the Gregorian calendar, it was Monday on the date 01/01/1900. If any year is input through the keyboard write a program to find out what is the day on 1st January of this year.
Solution -...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Algorithm and performance of Merge Sort
ALGORITHM
Procedure MERGESORT(a)
Let ‘a’ be an array of ‘var’ type with ‘n’ elements and ‘I1’ & ‘I2’ also be the arrays of ‘var’ type.1. If ( n == 1 ) return a [End of Step 1]2. var l1 as array = ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Any integer is input through the keyboard. Write a program to find out whether it is an odd
Any integer is input through the keyboard. Write a program to find out whether it is an odd number or even number.
Solution-:
#include#includemain(){ int num; // num=number clrscr(...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Any year is input through the keyboard. Write a program to determine whether the year
Any year is input through the keyboard. Write a program to determine whether the year is a leap year or not. (Hint: Use the % (modulus) operator)
Solution-:
#include#includemain(){ ...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Algorithm and performance of Insertion Sort
ALGORITHM
Let ‘a’ be an array of ‘n’ elements and ‘temp’ be the temporary variable to interchange the 2 values.1. SET k = 1.2. For k = 1 to (n-1)3. SET temp = a[k]4. SET j = k - 15. While tem...
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

A five-digit number is entered through the keyboard. Write a program to obtain the reversed
A five-digit number is entered through the keyboard. Write a program to obtain the reversed number and to determine whether the original and reversed numbers are equal or not.Solution -:
#include
Total Views: 0
Posted By: Open E-School
Posted On: 2017-04-13

Results 76 - 100 of **1384**