2017中級(jí)經(jīng)濟(jì)師《經(jīng)濟(jì)基礎(chǔ)》復(fù)習(xí)題
1. Queue is a useful structure
* What is a queue?
* Write 5 operations or functions, without details, that can be done on a
queue.
2. Insert a sequence fo keys(24,49,13,20,59,23,90,35) into a data structur
e, which has no keys initially. Depict the data structure after these insertio
ns, if it is:
* a heap tree
* an AVL tree
3. * What is a synchronous I/O bus?
* What is an asnchronous I/O bus?
* Compare the advantages and disadvantages of synchronous and a synchronou
s I/O bus.
4. Explain the following terminology:
* Baud rate
* Handshaking
* Memory mapped I/O
5. Explain the key issues in supporting a real-time operation system for e
mbedded system.
6. Explain the mapping of visual addresses to real addresses under paging
by
* direct mapping
* associative mapping
* combined direct/associated mapping
7. Please explain what is “write-back” and “write-through”, and discus
s the advantage and disadvantage about these two methods.
8. Explain the concept and benefit of threads
9. What is hardware interrupt? What is software interrupt? What is excepti
on? Please tell me all you know about interrupt.
10. Write a recursive function that tests wether a string is a palindrome.
A palindrome is s string such as “abcba” or “otto” that reads the same in
both directions.If you can write this function recursively,you can write an i
terative version of this function instead.
【中級(jí)經(jīng)濟(jì)師《經(jīng)濟(jì)基礎(chǔ)》復(fù)習(xí)題】相關(guān)文章：
經(jīng)濟(jì)師《中級(jí)經(jīng)濟(jì)基礎(chǔ)》復(fù)習(xí)題04-09
經(jīng)濟(jì)師考試《中級(jí)經(jīng)濟(jì)基礎(chǔ)》復(fù)習(xí)題03-16
2017經(jīng)濟(jì)師《中級(jí)經(jīng)濟(jì)基礎(chǔ)》考試復(fù)習(xí)題03-20
中級(jí)經(jīng)濟(jì)師《經(jīng)濟(jì)基礎(chǔ)》練習(xí)03-30
2017中級(jí)經(jīng)濟(jì)師考試《經(jīng)濟(jì)基礎(chǔ)》復(fù)習(xí)題及答案04-27
中級(jí)經(jīng)濟(jì)師經(jīng)濟(jì)基礎(chǔ)考點(diǎn)分析04-01
經(jīng)濟(jì)師《中級(jí)經(jīng)濟(jì)基礎(chǔ)》章節(jié)習(xí)題05-31