This document contains instructions for a 30 minute, 30 mark exam covering computer science topics. It is divided into 3 sections with 5 questions each worth 2 marks each, for a total of 10 marks per section and 30 marks overall. Section 1 covers operating systems topics like multi-user systems, GUIs, multiprocessing, common operating systems, Linux distributions, and memory management advantages. Section 2 covers file management topics like cut/copy differences, logging off Ubuntu, open source advantages, file extensions, and Linux server distributions. Section 3 covers algorithm topics like determining algorithmic problems, assignment vs equality operators, abstraction, assignment statements, algorithm specification format, and state representation in algorithms.
This document contains instructions for a 30 minute, 30 mark exam covering computer science topics. It is divided into 3 sections with 5 questions each worth 2 marks each, for a total of 10 marks per section and 30 marks overall. Section 1 covers operating systems topics like multi-user systems, GUIs, multiprocessing, common operating systems, Linux distributions, and memory management advantages. Section 2 covers file management topics like cut/copy differences, logging off Ubuntu, open source advantages, file extensions, and Linux server distributions. Section 3 covers algorithm topics like determining algorithmic problems, assignment vs equality operators, abstraction, assignment statements, algorithm specification format, and state representation in algorithms.
This document contains instructions for a 30 minute, 30 mark exam covering computer science topics. It is divided into 3 sections with 5 questions each worth 2 marks each, for a total of 10 marks per section and 30 marks overall. Section 1 covers operating systems topics like multi-user systems, GUIs, multiprocessing, common operating systems, Linux distributions, and memory management advantages. Section 2 covers file management topics like cut/copy differences, logging off Ubuntu, open source advantages, file extensions, and Linux server distributions. Section 3 covers algorithm topics like determining algorithmic problems, assignment vs equality operators, abstraction, assignment statements, algorithm specification format, and state representation in algorithms.
b. What is a GUI? c. What is multi-processing? d. What are the different operating systems used in computer? e. List out the distributions of Linux operating system. f. What are the advantages of memory management?
II Write any five in the following: 5x2=10
a. Differentiate cut and copy options.
b. How will you log off from Ubuntu OS? c. What is open source? What are the advantages of open source? d. What is the use of a file extension? e. Mention the different server distribution in Linux OS. f. Differentiate save and save as option.
III Write any five in the following: 5x2=10
a. When do you say that the problem is algorithmic in nature?
b. What is the difference between assignment operator and equality operator? c. What is abstraction? d. What is the form and meaning of assignment statement? e. What is the format of the specification of an algorithm? f. How is state represented in algorithms?