Question 8 I am logged on as student and my current directory is /home/student. What is the RELATIVE path to the linuxgym-data directory from this directory? O /usr/local/linuxgym-data O ~/usr/local/linuxgym-data O ../../usr/local/linuxgym-data O ~/linuxgym-data O ../usr/local/linuxgym-data Question 9 Most file systems are organised as trees. What is an "edge" of a tree in regards to a filesystem? This is a "branch" of the tree. O This is the bottom of the tree This is where the nodes have the same parent This is the top of the tree O This is a node that has no children Question 10 O Which of the following "Big O" notations has the HIGHEST cost? (e.g. number of accesses required to read a files blocks) O O(n²) O O(n) O(log(n)) O(1)

LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.
5th Edition
ISBN:9781337569798
Author:ECKERT
Publisher:ECKERT
Chapter10: Common Administrative Tasks
Section: Chapter Questions
Problem 8HOP
icon
Related questions
Question
Question 8
I am logged on as student and my current directory is /home/student. What is the RELATIVE path
to the linuxgym-data directory from this directory?
O /usr/local/linuxgym-data
O ~/usr/local/linuxgym-data
O ../../usr/local/linuxgym-data
O ~/linuxgym-data
O ../usr/local/linuxgym-data
Question 9
Most file systems are organised as trees. What is an "edge" of a tree in regards to a filesystem?
This is a "branch" of the tree.
O This is the bottom of the tree
This is where the nodes have the same parent
This is the top of the tree
O This is a node that has no children
Question 10
O
Which of the following "Big O" notations has the HIGHEST cost? (e.g. number of accesses required
to read a files blocks)
O O(n²)
O O(n)
O(log(n))
O(1)
Transcribed Image Text:Question 8 I am logged on as student and my current directory is /home/student. What is the RELATIVE path to the linuxgym-data directory from this directory? O /usr/local/linuxgym-data O ~/usr/local/linuxgym-data O ../../usr/local/linuxgym-data O ~/linuxgym-data O ../usr/local/linuxgym-data Question 9 Most file systems are organised as trees. What is an "edge" of a tree in regards to a filesystem? This is a "branch" of the tree. O This is the bottom of the tree This is where the nodes have the same parent This is the top of the tree O This is a node that has no children Question 10 O Which of the following "Big O" notations has the HIGHEST cost? (e.g. number of accesses required to read a files blocks) O O(n²) O O(n) O(log(n)) O(1)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Linux
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.
LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.
Computer Science
ISBN:
9781337569798
Author:
ECKERT
Publisher:
CENGAGE L