System Administration/ CIT Q2: Suppose you have two hard disks (sda,sdb) and sdb has already been partitioned to sdb1 and sdb2. Create physical volumes using the whole sda and the two partitions of sdb. Create a volume group that contains a complete sda disk and one partition on another disk . create two logical volumes ( a small one and a bigger one) in this volume group . Format all logical volumes with ext4 and mount them. Extend the volume group. Extend only one logical volume. -You have to suggest the size of each hard disk and also make sure to give the appropriate size for each logical volumes. -Do not forget to use commands that check each step you do . The answer of the second question is only acceptable if you write it by your hand.

System Administration/ CIT Q2: Suppose you have two hard disks (sda,sdb) and sdb has already been partitioned to sdb1 and sdb2. Create physical volumes using the whole sda and the two partitions of sdb. Create a volume group that contains a complete sda disk and one partition on another disk . create two logical volumes ( a small one and a bigger one) in this volume group . Format all logical volumes with ext4 and mount them. Extend the volume group. Extend only one logical volume. -You have to suggest the size of each hard disk and also make sure to give the appropriate size for each logical volumes. -Do not forget to use commands that check each step you do . The answer of the second question is only acceptable if you write it by your hand.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter7: File Handling And Applications

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
With linked allocation, each file is a linked list of disk blocks; the disk blocks may be scattered anywhereon the disk. The directory contains a pointer to the first and last blocks of the file. Each block contains a pointerto the next block. Refer to the illustration below. Need help to fill in the codes in void main() --- #include<stdio.h>#include<stdlib.h>#define TOTAL_DISK_BLOCKS 32#define TOTAL_DISK_INODES 8int blockStatus[TOTAL_DISK_BLOCKS]; // free = 0int blockList[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES]; // list of blocks of a filestruct file_table {char fileName[20];int fileSize;struct block *sb;};struct file_table fileTable[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES];struct block {int blockNumber;struct block *next;};int AllocateBlocks(int Size) {---}void main(){int i = 0, j = 0, numFiles = 0, nextBlock= 0, ret = 1;char s[20]; struct block *temp;---for(i = 0; i < numFiles; i++) {---ret = AllocateBlocks(fileTable[i].fileSize);---}---//Seed the pseudo-random number…
Q2
In an executable object file that is in executable and linkable format (ELF), which section defines the addresses of the stack and the heap? A. The data section B. The .text section C. These addresses are not defined in the executable object file. Instead, they are assigned by the operating system when the program is loaded in to me D. These addresses are not defined in the executable object file. Instead, they are assigned by the user when the program is running in memory. Reset Selection
Instructions Your job is to write a program to encrypt outgoing messages and decrypt incoming messages using a Vigenere Cypher. In this assignment, you will parse a string of words from a file into tokens using the strtok_s command with pointers and then use the Vigenere Cypher algorithm to encrypt and decrypt the parsed words. Before you can perform any encryption/decryption activities, the first step is to read in messages from a file and parse the messages into individual words. The Program: Setting up classes and understanding tokenization The first step in encrypting/decrypting messages is to parse the messages into words before applying the encryption/decryption algorithms to them. This parsing process is called “tokenization.” Read the contents of a file into this array using the getline command. The objective of this assignment is to demonstrate the use of pointers in a program utilizing c-strings and tokenization. The use of pointers is foundational in C++. This…
1. Suppose that the name of a file in a computer directory consists of three digits followed by two lowercase letters, and each digit is 0, 1, or 2,and each letter is either a or b. List the names of these files in lexicographic order, where we order letters using the usual alphabetic order of letters.
A file has r=30,000 EMPLOYEE records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. a) Calculate the record size R in bytes. b) Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. c) Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr i.
Each student record in the data area where pupil information is stored has the following format:The student ID is stored in the first nine bytes in ASCII.The course stamp is the following byte.The section number comes after that. Such student records have been sequentially loaded into memory starting at address $10000 and number well over 300. A fake record with the section identifier $FFFF is the last record to load, indicating the conclusion of the records. Create the GetMax assembler subroutine to search the entire list for the highest score. In the event of a tie, the top pupil on the list should be identified. the beginning address of the subroutine should
SAME PARAMETERS: In the RENTALS table shown in fig 2, 40 customers have created 50 rental contracts over time. A RENTALS record is 122 bytes and the block size for your OS is set to 1024 bytes with each block having a 1 byte pointer to the next written block as well as a 1 byte pointer to the next physically consecutive block. Assuming spanned organization, how many blocks do you estimate the RENTALS file is using at its current size? multiple choice a.50 b.6 c.400 d.7
UNIX ASSIGNMENT - IXQuestion 9 : In an organisation one wants to know how many programmers are there. The employee data is stored in a file called ‘personnel’ with one record per employee. Every record has field for designation. How can grep be used for this purpose?
File organization, databases
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.