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
Simulation of queues: Simulation is the process of forming an abstract model of a real world situation in order to understand the effect of modifications and the effect of introdu

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

A list item stores pointers and an element to predecessor and successor. We call a pointer to a list item a handle . This looks simple enough, but pointers are so powerful tha

Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru

a) Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same. Do this by usin

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d

padovan string

This method is the reverse of FIFO and assumes that each issue of stock is made from latest items received in the enterprises .Thus if the last lot to be received is not sufficient

Differentiate between Nonpersistent and 1-persistent Nonpersistent: If the medium is idle, transmit; if the medium is busy, wait an amount of time drawn from a probability dist

Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but