Describe Stacks and name a couple of places where stacks are useful.

.NET C C++ CSS DBA General HTML Java JavaScript JSP JUnit MySQL Networking Oracle Perl Perl PHP PL/SQL RSS Software QA SQL Server Struts Unix Windows XHTML XML

Home Hot About Collections Index RSS Atom Ask

Tester Developer DBA Windows JAR DLL Files Certificates RegEx Links Q&A Biotech Phones Travel FAQ Forum

Home > C++

✍: Guest

A Stack is a linear structure in which insertions and deletions are always made at one end, called the top. This updating policy is called last in, first out (LIFO). It is useful when we need to check some syntex errors, such as missing parentheses.

2012-04-17, 3401👍, 0💬

Assuming that: char* p = "abc" int a = 123; .....
3. Assuming that: char* p = "abc"; int a = 123; Fully parenthesize the following expressions and evaluate them: *p++; *--p; *--p++; a--; ++a; ++a--; 2012-04-19, 4005👍, 0💬

Design and implement a String class that satisfies the following:
Design and implement a String class that satisfies the following: * Supports embedded nulls * Provide the following methods (at least) o Constructor o Destructor o Copy constructor o Assignment operator o Addition operator (concatenation) o Return character at location o Return substring at location... 2012-04-18, 3557👍, 0💬

.Write a short code using C++ to print out all odd number from 1 to 100 using a for loop
Write a short code using C++ to print out all odd number from 1 to 100 using a for loop for( unsigned int i = 1; i < = 100; i++ ) if( i & 0x00000001 ) cout << i<<","; 2012-04-18, 3517👍, 0💬

Describe one simple rehashing policy.
Describe one simple rehashing policy. The simplest rehashing policy is linear probing. Suppose a key K hashes to location i. Suppose other key occupies H[i]. The following function is used to generate alternative locations: rehash(j) = (j + 1) mod h where j is the location most recently probed. Init... 2012-04-16, 3456👍, 0💬

Write the psuedo code for the Depth first Search.
Write the psuedo code for the Depth first Search. dfs(G, v) //OUTLINE Mark v as "discovered" For each vertex w such that edge vw is in G: If w is undiscovered: dfs(G, w); that is, explore vw, visit w, explore from there as much as possible, and backtrack from w to v. Otherwise: "Check" vw without vi... 2012-04-16, 3420👍, 0💬

Describe Stacks and name a couple of places where stacks are useful.
Describe Stacks and name a couple of places where stacks are useful. A Stack is a linear structure in which insertions and deletions are always made at one end, called the top. This updating policy is called last in, first out (LIFO). It is useful when we need to check some syntex errors, such as mi... 2012-04-17, 3402👍, 0💬

Name 7 layers of the OSI Reference Model?
Name 7 layers of the OSI Reference Model? -Application layer -Presentation layer -Session layer -Transport layer -Network layer -Data Link layer -Physical layer 2012-04-13, 3278👍, 0💬

Write a class to store, evaluate and print integer arithmetic expressions. the public interface .....
Write a class to store, evaluate and print integer arithmetic expressions. the public interface should look like this: class myexpr { public: myexpr(char*); int eval(); void print(); }; 2012-04-19, 3227👍, 0💬

Suppose a 3-bit sequence number is used in the selective-reject ARQ, what is the maximum number of frames that could be transmit
Suppose a 3-bit sequence number is used in the selective-reject ARQ, what is the maximum number of frames that could be transmitted at a time? If a 3-bit sequence number is used, then it could distinguish 8 different frames. Since the number of frames that could be transmitted at a time is no greate... 2012-04-17, 3211👍, 0💬

.NET C C++ CSS DBA General HTML Java JavaScript JSP JUnit MySQL Networking Oracle Perl Perl PHP PL/SQL RSS Software QA SQL Server Struts Unix Windows XHTML XML

Home Hot About Collections Index RSS Atom Ask

Tester Developer DBA Windows JAR DLL Files Certificates RegEx Links Q&A Biotech Phones Travel FAQ Forum

All rights in the contents of this web site are reserved by the individual author. fyicenter.com does not guarantee the truthfulness, accuracy, or reliability of any contents.