Prior to the UML, there was no clear leading(66)language. Users had to choose from among many similar modeling languages with minor differences in overall(67)power. Most of the modeling languages shared a set of commonly accepted concepts that are expressed slightly differently in various languages. This lack of(68)discouraged new users from entering the OO market and from doing OO modeling, without greatly expanding the power of modeling. Users longed for the industry to adopt one, or a very few, broadly supported modeling languages suitable for(69)usage.Some Vendors were discouraged from entering the OO modeling area because of the need to support many similar, but slightly different, modeling languages. In particular, the supply of add on tools has been depressed because small vendors cannot afford to support many different formats from many different(70)modeling tools. It is important to the entire OO industry to encourage broadly based tools and vendors, as well as niche products that cater to the needs of specialized groups.A．programmingB．modelingC．formalD．intelligent

Prior to the UML, there was no clear leading(66)language. Users had to choose from among many similar modeling languages with minor differences in overall(67)power. Most of the modeling languages shared a set of commonly accepted concepts that are expressed slightly differently in various languages. This lack of(68)discouraged new users from entering the OO market and from doing OO modeling, without greatly expanding the power of modeling. Users longed for the industry to adopt one, or a very few, broadly supported modeling languages suitable for(69)usage.

Some Vendors were discouraged from entering the OO modeling area because of the need to support many similar, but slightly different, modeling languages. In particular, the supply of add on tools has been depressed because small vendors cannot afford to support many different formats from many different(70)modeling tools. It is important to the entire OO industry to encourage broadly based tools and vendors, as well as niche products that cater to the needs of specialized groups.

A．programming

B．modeling

C．formal

D．intelligent

相关考题：

在一个双链表中,删除p结点(非尾结点)的操作是()。 A.p->prior->next=p->next;p->next->prior=p->prior;B.p->prior=p->prior->prior;p->prior->prior=p;C.p->next->prior=p;p->next=p->next->next;D.p->next=p->prior->prior;p->prior=p->prior->prior;
查看答案
Most computer systems are(66)to two different groups of attacks: Insider attacks and outsider attacks. A system that is known to be(67)to an outsider attack by preventing(68)from outside can still be vulnerable to the insider attacks accomplished by abusive usage of(69)users. Detecting such abusive usage as well as attacks by outsides not only provides information on damage assessment, but also helps to prevent future attacks. These attacks are usually(70)by tools referred to as Intrusion Detection Systems.A．vulnerableB．weekC．sensitivelyD．helpless
查看答案
With the villager __________ the way, we had no trouble __ the cottage.A.to lead; findingB.to lead; to fredC.leading; to findD.leading; finding
查看答案
在一个双链表中， 删除*p节点的操作是 _______。A．p -＞ prior –＞next= p-＞ next；p -＞next-＞ prior = p -＞ prior；B．p -＞prior= p -＞ prior -＞ prior；p -＞ prior -＞prior = p；C．p-＞ next -＞ prior = p；p-＞ next=p-＞ next-＞ next；D．p -＞ next= p-＞prior -＞ prior；p-＞ prior = p-＞prior-＞prior；
查看答案
在一个双链表中， 删除*p结点的操作是 _______。A．p -＞ prior –＞next= p-＞ next；p -＞next-＞ prior = p -＞ prior；B．p -＞prior= p -＞ prior -＞ prior；p -＞ prior -＞prior = p；C．p-＞ next -＞ prior = p；p-＞ next=p-＞ next-＞ next；D．p -＞ next= p-＞prior -＞ prior；p-＞ prior = p-＞prior-＞prior；
查看答案
在双向链表存储结构中，删除p所指的结点时须修改指针（）。A．p-＞prior-＞next = p-＞next; p-＞next-＞prior = p-＞prior;B．p-＞prior = p-＞prior-＞prior; p-＞prior-＞next = p;C．p-＞next-＞prior = p; p-＞next = p-＞prior-＞next;D．p-＞next = p-＞prior-＞prior; p-＞prior = p-＞next-＞next;
查看答案
27、在一个双链表中,删除结点p（非尾结点)的操作语句是A．p-＞ prior-＞next=p-＞next; p-＞ next-＞ prior=p-＞ priorB．p-＞prior=p-＞ prior-＞ prior; p-＞ prior-＞ prior=p;C．p-＞ next-＞ prior=p;p-＞next=p-＞next-＞next;D．p-＞next=p-＞ prior一＞ prior; p-＞prior=p-＞prior-＞ prior
查看答案
在双向链表存储结构中，删除p所指的结点时需修改指针（)A．p→next→prior=p→prior；p→prior→next=p→next；B．p→next=p→next→next；p→next→prior=p；C．p→prior→next=p；p→prior=p→prior→prior；D．p→prior=p→next→next；p→next=p→prior→prior；
查看答案
30、在一个双链表中，删除p结点的操作是（）（结点空间释放语句省略）。A．p-＞prior-＞next=p-＞next; p-＞next-＞prior=p-＞prior;B．p-＞prior=p-＞prior-＞prior; p-＞prior-＞prior=p;C．p-＞next-＞prior=p; p-＞next=p-＞next-＞next;D．p-＞next= p-＞prior-＞prior; p-＞prior=p-＞prior-＞prior;
查看答案
30、在一个双链表中， 删除*p节点的操作是 _______。A．p -＞ prior –＞next= p-＞ next；p -＞next-＞ prior = p -＞ prior；B．p -＞prior= p -＞ prior -＞ prior；p -＞ prior -＞prior = p；C．p-＞ next -＞ prior = p；p-＞ next=p-＞ next-＞ next；D．p -＞ next= p-＞prior -＞ prior；p-＞ prior = p-＞prior-＞prior；
查看答案
热门标签