Prior to the availability of enterprise EDM, locating a document over a LAN could be difficult, and over a WAN(66)nearly impossible. With the model for collaborative work spreading, and with more users sharing(67)documents through e-mail and the Internet, - 牛搜题

niusouti.com

题目

Prior to the availability of enterprise EDM, locating a document over a LAN could be difficult, and over a WAN(66)nearly impossible. With the model for collaborative work spreading, and with more users sharing(67)documents through e-mail and the Internet, enterprise EDM had become a necessity.

Many businesses are finding their greatest competitive advantage is the ability to harness the document(68)lifecycle. EDM systems manage this lifecycle from creation, revision, storage and(69)retrieval to routing and workflow. They also allow users to work on documents collaboratively.

Reusability of information is EDM's main benefit, as well as the key to creating the paradigms that drive business process(70)reengineering.

A．personal

B．available

C．structural

D．nearly

相似考题

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;

参考答案和解析

正确答案：D

更多“Prior to the availability of enterprise EDM, locating a document over a LAN could be diffi ”相关问题

第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

相关内容