Pseudocode algorithm to print the numbers from 1 to 10, Data Structure & Algorithms

1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop.

2. The function contains() takes a food as an argument and tells you whether the pizza contains that food. Tomas is allergic to peanuts, tuna, and onions, but strangely, eating peanuts and onions together is fine for him. Write a condition that determines whether the pizza is safe for him to eat.

 

Posted Date: 3/20/2013 2:07:50 AM | Location : United States







Related Discussions:- Pseudocode algorithm to print the numbers from 1 to 10, Assignment Help, Ask Question on Pseudocode algorithm to print the numbers from 1 to 10, Get Answer, Expert's Help, Pseudocode algorithm to print the numbers from 1 to 10 Discussions

Write discussion on Pseudocode algorithm to print the numbers from 1 to 10
Your posts are moderated
Related Questions
Thus far, we have seen the demonstration of a single queue, but several practical applications in computer science needs several queues. Multi queue is data structure in which mult

Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

how to write a function of area of a circle using python

Question a) Describe how the endogenous model is an improvement to the neo-classical model in explaining the long-run effect of investment on economic growth of a country.

Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.

The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr

GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EXAMPLE.

Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

Thread By changing the NULL lines in a binary tree to special links known as threads, it is possible to perform traversal, insertion and deletion without using either a stack