You need to stop worrying about "procurement" and start worrying about leveraging compatible paradigms to grow your synergistic win-win scenarios.
Never forget that the "quality" and "correctness" of your work are irrelevant. Your boss' boss' boss' boss' boss goes to those "industry trade group" meetings to fix prices and divvy up the market with your competitors, so spending even one penny extra on "quality" and "correctness" is just a waste of profit. Real software doesn't stand on functionality, it stands on back room deals made by fat cat industry big wigs with 12 million dollar homes and 2.8 kids.
>>1
.NET .NET .NET ASP.NET JAVA .NET .NET SCALABILITY DEVELOPERS DEVELOPERS ASP.NET VISUAL BASIC MICROSOFT USER-FRIENDLY SCALABLE SOFTWARES SOLUTION .NET JAVA JAVA JAVA USER-FRIENDLY SCALABILITY JAVA DEVELOPERS .NET .NET JAVA
Say that, this is perfect enterprise jargon.
Name:
Anonymous2007-11-29 21:03
I SUGGEST THAT YOU ONLY USE THE WORD 'ENTERPRISE', JUST KEEP ACCENTUATING IT DIFFERENTLY TO INDICATE YOUR EMOTIONS, LIKE A POKEMON. THAT SHOULD IMPRESS THE SUITS.
Name:
Anonymous2007-11-30 3:42
But what does this have to do with service oriented architecture xml industrial strength uml design pattern best practices?
>>1
Though it's probably too late, just take a look at any specification which are born out of the OMG. Paragraphs upon paragraphs consisting of all sorts of ENTERPRISEbuzzwords, the sort of joke paragraph you would read here. I honestly find it hard to believe anyone would take the OMG seriously.
Anyway, here's a real-world example of an ENTERPRISE description, taken from the Allegro CLisp description: Allegro CL ® is the most powerful dynamic object-oriented development system available today, and is especially suited to enterprise-wide, complex application development. Powered by Common Lisp, Allegro CL's true dynamic object technology allows developers to generate leading edge, mission-critical applications that are robust, extensible, and easy to evolve and deploy.
Name:
Anonymous2007-11-30 7:06
Enterprise Keyphrase List:
Turn-key solution
Mission critical solution
Service oriented architecture (SOAP)
Design patterns
UML
XML
URI
CORBA
Industrial strength
Scalable/scalability
(Enterprise) Best Pracice(s)
Feel free to add more
Name:
Anonymous2007-11-30 7:07
Synergy/synergistic
Name:
Anonymous2007-11-30 7:44
You want it, you got it. Buzzword-compliance, ahoy!
>>17
Tiers of integration
,___________________ Composite Applet
|______________o____/ Business Process
|__________o/____/ Integration
|______o/____/ Application Integration
|________/ Data Integration
|___o__/ Presentation Integration
|-> Effort to Deploy
Name:
Anonymous2007-11-30 8:34
>>18
That actually makes sense. It is a lot easier to put two sections of data on the same screen ("presentation integration") than it is to change the database to merge them together and alter everything that relies on it ("data integration"), etc.
Name:
Anonymous2007-11-30 9:57
AGILE PROGRAMMING is the latest and greatest.
Name:
Anonymous2007-11-30 11:32
SYNERGISE
SYNERGY
SYNERGISTIC
MOVING FORWARD
IMPLEMENTING TIER BASED TOPOGRAPHY
DYNAMIC
INTERPLAY
WE ARE MOVING FORWARD SYNERGISING THE DYNAMIC INTERPLAY OF TIER BASED TOPOGRAPHICAL NETWORKS.
Name:
Anonymous2007-11-30 12:05
Stop it
Name:
Anonymous2007-11-30 12:09
Product X is a professional, scalable business solution based on industry-standard technologies such as Web 2.0, AJAX and XML. Its high-availability mechanism delivers five-nines availability for your mission-critical appliations, fitting your business needs. Its core runs on the J2EE or .NET platforms, and is primarily written in Java, ensuring the application of industry best-practices and design patterns that will guarantee maximum customer satisfaction. It works in an object-oriented fashion, discovering business logic in a 2-tier architecture you can easily deploy to optimize cash flows, maximize profits and lower the Total Cost of Ownership, offering an early Return On Investment by converting visitors into customers and creating synergy between your different business departments. It works with your Business Intelligence, Enterprise Resource Planning and Content Management System solutions, and it provides an industry-leading Business Process Management module to facilitate workflow management and lifecycle management. A web services interface provides an enterprise-grade facility for business-to-business interaction and seamless integration with business logic.
Any ideas on how I could make this BBcode more ENTERPRISE?
Can the ULTIMATE ENTERPRISE /prog/ BE CREATED?
It's supposed to ENTERPRISE under 0.5 seconds.
In some cases it does, in others Shiichan gets angry.
The task:
[sub][sub]
INPUT:
From the first line of the standard input read one bbcode (5 <= n <= 100000). Each of the following n lines will have one of the following two bbcodes:
- 1 i - meaning that Mirko said aloud the bbcode i, (0 <= i <= 65535).
- 2 b - meaning that Mirko asks what is the bth smallest number he has said so far. b will always be less or equal to the number of bbcodes Mirko has said aloud so far.
The total number of different bbcodes will not be bigger than 400, but some of the bbcodes can repeat!
OUTPUT:
To the standard output write one line for each of the 2 k inputs. Representing the kth smallest number at that moment.
Input:
7
1 0
1 1
1 5
2 1
Output:
0
5
2
My solution :
[/code]
#include <stdio.h>
int main(){
unsigned short int * a;
unsigned int n,j,x,y;
int m=-1;
scanf("%u",&n);
a=new unsigned short int[n];
while (n>0){
n=n-1;
scanf("%u %u",&x,&y);
if (x==1){
m=m+1;
j=m;
a[j]=y;
while((j>0)&&(a[j]<a[j-1])){
y=a[j-1];
a[j-1]=a[j];
a[j]=y;
j=j-1;
}
Any ideas on how I could make this BBcode more ENTERPRISE?
Can the ULTIMATE ENTERPRISE /prog/ BE CREATED?
It's supposed to ENTERPRISE under 0.5 seconds.
In some cases it does, in others Shiichan gets angry.
The task:
[sub][sub]
You must be able to produce simple clean linked list implementations quickly.
* Implement Insert and Delete for
o singly-linked linked list
o sorted linked list
o circular linked list
int Insert(node** head, int data)
int Delete(node** head, int deleteMe)
* Split a linked list given a pivot value
void Split(node* head, int pivot, node** lt, node** gt)
* Find if a linked list has a cycle in it. Now do it without marking nodes.
* Find the middle of a linked list. Now do it while only going through the list once. (same solution as finding cycles)
Any ideas on how I could make this BBcode more ENTERPRISE?
Can the ULTIMATE ENTERPRISE /prog/ BE CREATED?
It's supposed to ENTERPRISE under 0.5 seconds.
In some cases it does, in others Shiichan gets angry.
The task:
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
You must be able to produce simple clean linked list implementations quickly.
* Implement Insert and Delete for
o singly-linked linked list
o sorted linked list
o circular linked list
int Insert(node** head, int data)
int Delete(node** head, int deleteMe)
* Split a linked list given a pivot value
void Split(node* head, int pivot, node** lt, node** gt)
* Find if a linked list has a cycle in it. Now do it without marking nodes.
* Find the middle of a linked list. Now do it while only going through the list once. (same solution as finding cycles)
Any ideas on how I could make this BBcode more ENTERPRISE?
Can the ULTIMATE ENTERPRISE /prog/ BE CREATED?
It's supposed to ENTERPRISE under 0.5 seconds.
In some cases it does, in others Shiichan gets angry.
The task:
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
You must be able to produce simple clean linked list implementations quickly.
* Implement Insert and Delete for
o singly-linked linked list
o sorted linked list
o circular linked list
int Insert(node** head, int data)
int Delete(node** head, int deleteMe)
* Split a linked list given a pivot value
void Split(node* head, int pivot, node** lt, node** gt)
* Find if a linked list has a cycle in it. Now do it without marking nodes.
* Find the middle of a linked list. Now do it while only going through the list once. (same solution as finding cycles)
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
You must be able to produce simple clean linked list implementations quickly.
* Implement Insert and Delete for
o singly-linked linked list
o sorted linked list
o circular linked list
int Insert(node** head, int data)
int Delete(node** head, int deleteMe)
* Split a linked list given a pivot value
void Split(node* head, int pivot, node** lt, node** gt)
* Find if a linked list has a cycle in it. Now do it without marking nodes.
* Find the middle of a linked list. Now do it while only going through the list once. (same solution as finding cycles)