●Prior to the UML，there was no clearleading (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 expres

题目

●Prior to the UML，there was no clearleading (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 modelinglanguages 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-ontools has been depressed because small vendors cannot afford to support many different formatsfrom many different (70) modeling tools.It is important to the entire OOindustry to encourage broadly based tools and vendors，as well as niche products that cater to the needs of specialized groups.

(66) A．programming

B．modeling

C．formal

D．intelligent

(67) A．control

B．expressive

C．conductive

D．interactive

(68) A．agreement

B．understanding

C．characteristic

D．diversitv

(69) A．distincitive

B．special-purpose

C．separate

D．general-purpose

(70) A．internal

B．external

C．front-end

D．back-end

相似考题

1.某双向链表中的结点如下图所示，删除t所指结点的操作为(54)。A．t-＞prior-＞next=t-＞next；t-＞next-＞prior=t-＞prior；B．t-＞prior-＞prior=t-＞prior；t-＞next-＞next=t-＞next；C．t-＞prior-＞next=t-＞prior；t-＞next-＞prior=t-＞next；D．t-＞prior-＞prior=t-＞next；t-＞next-＞prior=t-＞prior；

2.在一个双链表中， 删除*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；

3.在双向链表中，在p所指向的结点前插入一个q所指向的结点，相应的操作语句是（）。 注：双向链表的结点结构为（prior，data，next)。A．p-＞prior=q;q-＞next=p;p-＞prior-＞next=q;q-＞prior=q;B．p-＞prior=q;p-＞prior-＞next=q;q-＞next=p;q-＞prior=p-＞prior;C．q-＞next=p;q-＞prior=p-＞prior;p-＞prior-＞next=q;p-＞prior=q;D．q-＞prior=p-＞prior;q-＞next=q;p-＞prior=q;p-＞prior=q;

4.在一个双链表中,删除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;

更多“●Prior to the UML,there was no clearleading (66) language.Users had to choose from among m ”相关问题

  • 第1题：

    在一个双链表中， 删除*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--＞prior--＞next=p--＞next; p--＞next--＞prior=p--＞prior

  • 第2题：

    27、在一个双链表中,删除结点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


    A

  • 第3题：

    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;


    A

  • 第4题：

    在双向链表存储结构中，删除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;


    p-＞llink-＞rlink=p-＞rlink; p-＞rlink -＞llink=p-＞llink; free(p);

  • 第5题：

    在双向链表存储结构中，删除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；


    p->llink->rlink=p->rlink; p->rlink ->llink=p->llink; free(p);

  • 第6题：

    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；


    A

相关内容