OS FULL 117

Axakalov Beksultan
Quiz by Axakalov Beksultan, updated more than 1 year ago
Axakalov Beksultan
Created by Axakalov Beksultan almost 3 years ago
27
1

Description

YUNIKOVA

Resource summary

Question 1

Question
1. What is not a main structural element of a computer system?
Answer
  • Main Memory
  • I/O Modules
  • System Bus
  • Operating system
  • Processor

Question 2

Question
2. Which of the following registers are used by the processor to exchange data with memory?
Answer
  • I/OAR and I/OBR
  • Program status word
  • PC and IR
  • MAR and MBR

Question 3

Question
3. Which of the following registers are used by the processor to exchange data with input/output module?
Answer
  • I/OAR and I/OBR
  • MAR and MBR
  • Program status word
  • PC and IR

Question 4

Question
4. Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Answer
  • Processor
  • System bus
  • I/O modules
  • Main memory

Question 5

Question
5. Which of the following element of a computer system stores data and programs?
Answer
  • I/O modules
  • Processor
  • System bus
  • Main memory

Question 6

Question
6. Which of the following provides for communication among elements of a computer system?
Answer
  • • I/O modules
  • • Processor
  • • System bus
  • • Main memory

Question 7

Question
7. Which of the following element of a computer system moves data between the computer and its external environment?
Answer
  • • Main memory
  • • Processor
  • • I/O modules
  • • System bus

Question 8

Question
8. The processor contains a single data register, called
Answer
  • • PSW
  • • AC
  • • IR
  • • PC

Question 9

Question
9. This register specifies a particular input/output device
Answer
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Question 10

Question
10. This register is used for the exchange of data between an I/O module and the processor
Answer
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Question 11

Question
11. This register contains the data to be written into memory or which receives the data read from memory
Answer
  • • I/OBR
  • • memory address register
  • • memory buffer register
  • • I/OAR

Question 12

Question
12. This register specifies the location in memory for the next read or write
Answer
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Question 13

Question
14. Which register contains the address of the next instruction to be fetched?
Answer
  • • process counter
  • • program counter
  • • execution register
  • • instruction register

Question 14

Question
14. Which register contains the instruction most recently fetched?
Answer
  • • process counter
  • • instruction register
  • • execution register
  • • program counter

Question 15

Question
15. Which register contains condition codes set by the processor hardware as the result of operations?
Answer
  • • Stack pointer
  • • Program status word
  • • Accumulator
  • • Program counter

Question 16

Question
16. The fetched instruction is loaded into the
Answer
  • • PC
  • • Memory
  • • Accumulator
  • • IR

Question 17

Question
17. At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
Answer
  • • PC
  • • MAR
  • • MBR
  • • IR

Question 18

Question
18. The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Answer
  • • PC -> MAR M -> MBR MBR -> AC IR -> MAR M -> MBR MBR -> AC
  • • PC -> MBR M -> MAR MAR -> IR IR -> MAR M -> MBR MBR -> AC
  • PC -> MAR M -> MBR MBR -> IR IR -> MAR M -> MBR MBR -> AC
  • • PC -> MAR M -> MBR MBR -> IR IR -> MBR M -> MAR MAR -> AC

Question 19

Question
19. When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Answer
  • • The processor stops execution of the current instruction without finishing it and responds to the interrupt
  • • The processor loads the program counter with the entry location of the interrupt-handling routine
  • • The processor saves information needed to resume the current program at the point if interrupt
  • • The processor finishes execution of the current instruction before responding to the interrupt

Question 20

Question
20. When the time required for the I/O operation is less that the time to complete the execution of instructions between write operations in the user program, it is:
Answer
  • • Short I/O wait
  • • Long I/O wait
  • • Slow I/O wait
  • • Fast I/O wait

Question 21

Question
21. When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is:
Answer
  • • Short I/O wait
  • • Fast I/O wait
  • • Long I/O wait
  • • Slow I/O wait

Question 22

Question
22. If there no interrupts, after each write operation, the processor must:
Answer
  • • Pause and remain idle until the I/O operation
  • • Save the PSW and PC onto control stack
  • • Finish execution of current instruction
  • • Load new PC value

Question 23

Question
23. Complete the relationship concerning the memory systems: faster access time –
Answer
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Question 24

Question
24. Complete the relationship concerning the memory systems: greater capacity –
Answer
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Question 25

Question
25. Complete the relationship concerning the memory systems: greater capacity –
Answer
  • • faster access speed
  • • greater cost per bit
  • • slower access time
  • • lower capacity

Question 26

Question
26. The smaller, more expensive, faster memory is:
Answer
  • • Register
  • • Main memory
  • • Cache
  • • Disk drive

Question 27

Question
27. If the accessed word is found in the faster memory, that is defined as a:
Answer
  • • evrika
  • • hit
  • • win
  • • bingo

Question 28

Question
28. If the accessed word is not found in the faster memory, that is defined as a:
Answer
  • • Loss
  • • zero
  • • miss
  • • ricochet

Question 29

Question
29. This type of memory is nonvolatile:
Answer
  • • Main memory
  • • Cache
  • • Secondary memory
  • • Register

Question 30

Question
30. When a processor attempts to read a byte or word of memory, it firstly checks the:
Answer
  • • Main memory
  • • Secondary memory
  • • Cache
  • • Register

Question 31

Question
31. This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks:
Answer
  • • locality of reference
  • • cache size
  • • write policy
  • • replacement algorithm

Question 32

Question
32. If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:
Answer
  • • replacement algorithm
  • • locality of reference
  • • mapping function
  • • write policy

Question 33

Question
33. Which of the following is not a technique possible for I/O operations?
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 34

Question
34. The processor issues an I/O command to a module and waits, periodically checking the status of the I/O module until it finds that the operation is complete.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 35

Question
35. The I/O module performs the requested action and then sets the appropriate bits in the I/O status register but takes no further action to alert the processor.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 36

Question
36. The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 37

Question
37. The processor issues an I/O command to a module and then go on to some other useful work.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 38

Question
38. The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 39

Question
39. The main disadvantage of this technique: consumes a lot of processor time, because every word of data that goes from memory to I/O module or from I/O module to memory must pass through the processor.
Answer
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Question 40

Question
40. The processor issues an I/O command to a separate module, by sending the type of operation (read/write), the address of the I/O device, the starting location in memory for data, number of words. Then the processor continues with other work.
Answer
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Question 41

Question
41. The module transfers the entire block of data to/from memory without going through the processor.
Answer
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Question 42

Question
42. The main disadvantage of this technique: there is a competition for bus usage.
Answer
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Question 43

Question
43. A hardcopy sign-up sheet was used to reserve computer time with
Answer
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Question 44

Question
44. A system clock generates interrupts at a rate of approximately one every 0.2 seconds. At each clock interrupt, the OS regained control and could assign the processor to another user. This technique is known as
Answer
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Question 45

Question
45. Batch operating systems were used (years)
Answer
  • • In early 1960s
  • • From the mid-1950 to early 1960s
  • • From the late 1940s to the mid-1950s

Question 46

Question
46. Job control language was used
Answer
  • • From the mid-1950s to early 1960s
  • • From late 1940s to the mid-1950s
  • • used to provide instructions to the monitor,In early 1960s

Question 47

Question
47. Serial processing was used
Answer
  • • From the mid-1950s to early 1960s
  • • From late 1940s to the mid-1950s
  • • In early 1960s

Question 48

Question
48. The central idea in this system was the use of a piece of software known as the monitor
Answer
  • • Serial processing
  • • Multiprogrammed batch system
  • • Simple batch system
  • • Time-sharing-system

Question 49

Question
49. The concept of a batch operating system was developed to
Answer
  • • Minimize processor utilization
  • • Support interactive mode
  • • Minimize response time
  • • Maximize processor utilization (To improve utilization)

Question 50

Question
50. The concept of modes of operation (user mode, system mode) was introduced with
Answer
  • • Serial processing
  • • Multiprogrammed batch system
  • • Simple batch system
  • • Time-sharing-system

Question 51

Question
51. The principal objective of the time-sharing system is to
Answer
  • • Maximize processor utilization
  • • Maximize response time
  • • Minimize processor utilization
  • • Minimize response time

Question 52

Question
52. The processor was often idle waiting for the I/O instruction to conclude. To overcome the problem the following approach was introduced: when one job needs to wait for I/O, the processor can switch to the other job. This was a
Answer
  • • Time-sharing-system
  • • Serial processing
  • • Simple batch system
  • • Multiprogramming or multitasking batch system

Question 53

Question
53. The programmer interacted directly with the computer hardware with
Answer
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Question 54

Question
54. The serial processing presented two main problems:
Answer
  • • scheduling
  • • multiprogramming
  • • time slicing
  • • using a monitor
  • • setup time

Question 55

Question
55. There were no OS with
Answer
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Question 56

Question
56. This system handles multiple interactive jobs
Answer
  • • Multiprogrammed batch system
  • • Serial processing
  • • Simple batch system
  • • Time-sharing-system

Question 57

Question
57. This system was developed by General Motors for the use on an IBM 701
Answer
  • • Time-sharing system
  • • Multiprogrammed batch system
  • • Serial processing
  • • Simple Batch Systems or GM-NAA I/O

Question 58

Question
58 This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
Answer
  • • Time-sharing-system
  • • Simple batch system
  • • Multiprogrammed batch system
  • • Serial processing

Question 59

Question
59. Lost signals, duplicate signals received'. This is
Answer
  • • Failed mutual exclusion
  • • Deadlocks
  • • Nondeterminate program operation
  • • Improper synchronization

Question 60

Question
60. 'Two or more programs hung up waiting for each other'. This is
Answer
  • • Improper synchronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Question 61

Question
61. 'When programs share memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The results of a particular program depend on the activities of other programs in a shared system'. This is
Answer
  • • Improper syncronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Question 62

Question
. Choose the storage management responsibility for "Many application programs require means for storing information for extended periods of time, after the computer has been powered down"
Answer
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Protection and access control
  • • Long-term storage

Question 63

Question
. Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"
Answer
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Question 64

Question
Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
Answer
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Question 65

Question
. Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
Answer
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Question 66

Question
Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
Answer
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Question 67

Question
In operating system security and protection, authenticity:
Answer
  • • Concerned with protecting the system against interruption
  • • Protection of data from unauthorized modification
  • • Assuring that users cannot read data for which access is unauthorized
  • • Concerned with the proper verification of the identity of users and the validity of messages or data

Question 68

Question
In operating system security and protection, availability is:
Answer
  • • Concerned with the proper verification of the identity of users and the validity of messages or data
  • • Assuring that users cannot read data for which access is unauthorized
  • • Protection of data from unauthorized modification
  • o Concerned with protecting the system against interruption

Question 69

Question
In operating system security and protection, confidentiality is:
Answer
  • • Concerned with the proper verification of the identity of users and the validity of messages or data
  • • Assuring that users cannot read data for which access is unauthorized
  • • Protection of data from unauthorized modification
  • • Concerned with protecting the system against interruption

Question 70

Question
In operating system security and protection, data integrity is:
Answer
  • • Concerned with protecting the system against interruption
  • • Protection of data from unauthorized modification
  • • Assuring that users cannot read data for which access is unauthorized
  • • Concerned with the proper verification of the identity of users and the validity of messages or data

Question 71

Question
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
Answer
  • • Merry-go-round technique
  • • Carousel technique
  • • Prioritizing
  • • Round-robin technique

Question 72

Question
The base register
Answer
  • • Contains the staring address of the region of memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the index into the process list of the process currently controlling the processor
  • • Defines the size of the region of (in bytes or words)

Question 73

Question
. The limit register
Answer
  • • Contains the staring address of the region of memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the index into the process list of the process currently controlling the processor
  • • Defines the size of the region of (in bytes or words)

Question 74

Question
The process index register
Answer
  • • Contains the index into a process list of the process currently controlling the processor
  • • Define the region in memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the starting address of the region of memory occupied by the process

Question 75

Question
This term was first used by the designers of Multics in the 1960s
Answer
  • • Time sharing
  • • Multiprogramming
  • • Process
  • • Monitor

Question 76

Question
'Ease of evolution of an OS' corresponds to the following objective:
Answer
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Question 77

Question
'The OS as a resource manager' corresponds to the following objective:
Answer
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Question 78

Question
'The OS as a User/Computer interface' corresponds to the following objective:
Answer
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Question 79

Question
. An application programs is developed by the
Answer
  • • Hardware
  • • Operating system
  • • End user
  • • Application programmer

Question 80

Question
The end user views a computer system in terms of
Answer
  • • a set of applications
  • • a set of system programs
  • • utilities
  • • a set of machine instructions

Question 81

Question
The hardware and software used in providing applications to a user can be viewed in a:
Answer
  • • leveled fashion
  • • sandwich fashion
  • • layered fashion
  • • classified fashion

Question 82

Question
This contains the most frequently used functions in the OS:
Answer
  • • Centre
  • • Base
  • • Root
  • • Kernel (или nucleus)

Question 83

Question
Utilities are
Answer
  • • Processor registers
  • • Opcodes
  • • System programs
  • • Application program

Question 84

Question
Process is
Answer
  • • A program in execution
  • • A job in secondary memory
  • • Contents of main memory
  • • Program in High level language kept on disk
  • • contents of main memory
  • • a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
  • • a job in secondary memory

Question 85

Question
A task in a blocked state
Answer
  • • is waiting for same temporarily unavailable resources
  • • must still be placed in the run queues
  • • is executable
  • • is running

Question 86

Question
The systems which allows only one process execution at a time, are called
Answer
  • ● unicasting systems
  • ● uniprogramming systems
  • ● uniprocessing systems
  • ● unitasking systems

Question 87

Question
The state of a process is defined by:
Answer
  • • the current activity of the process
  • • the activity to next be executed by the process
  • • the final activity of the process
  • • the activity is just executed by the process

Question 88

Question
Which of the following is not the state of a process?
Answer
  • • ready
  • • Old
  • • terminated
  • • running
  • • new

Question 89

Question
. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
Answer
  • • Suspended state
  • • Terminated state
  • • Running state
  • • Ready state

Question 90

Question
. Which of the following state transitions is not possible?
Answer
  • • ready to running
  • • blocked to ready
  • • running to blocked
  • • blocked to running

Question 91

Question
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Answer
  • • synchronous exclusion
  • • mutual exclusion
  • • asynchronous exclusion
  • • critical exclusion

Question 92

Question
. Interprocess communication:
Answer
  • • allows processes to communicate and synchronize their actions without using the same address space
  • • allows processes to communicate and synchronize their actions when using the same address space
  • • allows the processes to only synchronize their actions without communication
  • • none of the above

Question 93

Question
A sequence of instructions, in a computer language, to get the desired result, is known as?
Answer
  • • program
  • • process
  • • instruction
  • • algorithm

Question 94

Question
In operating system, each process has its own:
Answer
  • • program code
  • • all of the mentioned
  • • set of data
  • • address space and global variables

Question 95

Question
For each process OS creates and manages:
Answer
  • • Thread control block
  • • Program
  • • Program code
  • • Process control block

Question 96

Question
The available vector defines
Answer
  • • total amount of each resource NOT allocated to any process
  • • total amount of each resource allocated to all processes
  • • total amount of each resource in the system
  • • total amount of resources required for all processes

Question 97

Question
The resource vector define
Answer
  • • total amount of each resource NOT allocated to any process
  • • total amount of each resource allocated to all processes
  • • total amount of each resource in the system
  • • total amount of resources required for all processes

Question 98

Question
This matrix defines the current allocation to process i of the resource j
Answer
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Question 99

Question
This matrix defines the amount of resources of type j requested by process i
Answer
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Question 100

Question
This matrix defines requirements of processes i for the resources j
Answer
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Question 101

Question
The banker's algorithm is referred to as
Answer
  • • resource allocation refusal
  • • loan allocation denial
  • • resource allocation denial
  • • denial of service

Question 102

Question
'Hold and wait' condition for deadlock is defined as
Answer
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Question 103

Question
'Circular wait' condition for deadlock is defined as
Answer
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Question 104

Question
'No preemption' condition for deadlock is defined as
Answer
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Question 105

Question
'Mutual exclusion' condition for deadlock is defined as
Answer
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Question 106

Question
What is NOT an example of consumable resource?
Answer
  • • Messages
  • • Main memory
  • • Signals
  • • Information in I\O buffers

Question 107

Question
What is NOT an example of reusable resource?
Answer
  • • i/o channels
  • • interrupt
  • • processors
  • • semaphores

Question 108

Question
This resource can be created and destroyed
Answer
  • • finite resource
  • • restartable resource
  • • consumable resource
  • • resumable resource

Question 109

Question
This resource can be safely used by only one process at a time and is not depleted by that use
Answer
  • • refreshing resource
  • • reusable resource
  • • replenishing resource
  • • refurbished resource

Question 110

Question
Deadlock inevitable region can be referred to as a
Answer
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Question 111

Question
This illustrates the progress of two processes competing for two resources
Answer
  • ● joint progress diagram
  • ● joint regress diagram
  • ● joint ingres diagram
  • ● joint process diagram

Question 112

Question
When each process in the set is blocked awaiting for resource seized by another blocked process
Answer
  • ● it is a mortallock
  • ● it is a softlock
  • ● it is a deadlock
  • ● it is a deadend

Question 113

Question
Which of the following statements is false:
Answer
  • • the system must stop everything while it performs the compaction
  • • compaction is also known as garbage collection
  • • the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
  • • compaction does not involve relocation of programs

Question 114

Question
. Memory is:
Answer
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Question 115

Question
Processor is:
Answer
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Question 116

Question
Program is:
Answer
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Question 117

Question
The memory allocation scheme subject to "external" fragmentation is?
Answer
  • • pure demand paging
  • • multiple contiguous fixed partitionings
  • • swapping
  • • segmentation
Show full summary Hide full summary

Similar

Spanish Vocabulary- Beginner
PatrickNoonan
Mind Maps Essay Template
linda_riches
Pythagorean Theorem Quiz
Selam H
GCSE AQA Biology 2 Plants & Photosynthesis
Lilac Potato
How the European Union Works
Sarah Egan
1PR101 2.test - Část 17.
Nikola Truong
SISTEMAS Y RELACIONES
cecy menchaca
mi mapa conceptual
Alejandra De león
DESARROLLO DE COMPETENCIAS
damary acevedo
Los SI:Evolución y desarrollo
Luis Arcos
BASES EPISTEMOLOGICAS
alba yolanda gonzalez florez