Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
38. When creating a tree of directories with depth d and breadth b, the directories that have already been explored are held (memorized) in (a) open (b) closed (c) temp (d) successors (e)none of the above

38. When creating a tree of directories with depth d and breadth b, the directories that have already been explored are held (memorized) in (a) open (b) closed (c) temp (d) successors (e)none of the above

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

please give right answers do not use other webiste and chatgpt for this answer its giving wring answers all time please also this webiste allow exert answer 3 question i am asking only 2 question please 33 38 answer correctly 

31. Assuming ls -1 /home/cs288 returns a string 'drwxr-xr-x+ 1 CS288 CS288 123 Dec 25 2013' the command to find the file size 123 is (b)cut -d'' - £4 (e)none of the above (a)cut -d'' -£3 (d)cut -f' ' -d4 32. Consider a list of file sizes 1st = (1 2 3 4 5), the average file size is computed by: sum=0; n=${#1st [@] }; (a) for ((i=0;i<n;i++)); do ((sum-sum+1st[i])); done; ((avg=sum/n)); (b) for x in ${lst[@]}; do sum='expr $sum + $x'; done; avg='expr $sum / $n'; (c) for x in ${!lst[@]}; do ((sum-sum+lst[x])); done; ((avg=sum/n)); (d) all of the above (e) none of the above 33. To list commands that start with (a) ls /bin | grep ^a (c) ls /bin | grep a (e) none of the above 34. To list commands that end with 'a' under /bin you type (b) ls /bin | grep a* (d) ls /bin | grep as (a) ls /bin | grep ^a (c) ls /bin | grep a (e) none of the above 'a' under /bin you type (b) ls /bin | grep a* (d) ls /bin | grep a$ (c) cut -f'' -d4 35. To find the number of commands that start with 'a' (a) ls, grep, cut, count (b) ls, (d) ls, (c) ls, grep, wc, cut (e) none of the above under /bin you need commands grep, count, split grep, wc, split
Transcribed Image Text:31. Assuming ls -1 /home/cs288 returns a string 'drwxr-xr-x+ 1 CS288 CS288 123 Dec 25 2013' the command to find the file size 123 is (b)cut -d'' - £4 (e)none of the above (a)cut -d'' -£3 (d)cut -f' ' -d4 32. Consider a list of file sizes 1st = (1 2 3 4 5), the average file size is computed by: sum=0; n=${#1st [@] }; (a) for ((i=0;i<n;i++)); do ((sum-sum+1st[i])); done; ((avg=sum/n)); (b) for x in ${lst[@]}; do sum='expr $sum + $x'; done; avg='expr $sum / $n'; (c) for x in ${!lst[@]}; do ((sum-sum+lst[x])); done; ((avg=sum/n)); (d) all of the above (e) none of the above 33. To list commands that start with (a) ls /bin | grep ^a (c) ls /bin | grep a (e) none of the above 34. To list commands that end with 'a' under /bin you type (b) ls /bin | grep a* (d) ls /bin | grep as (a) ls /bin | grep ^a (c) ls /bin | grep a (e) none of the above 'a' under /bin you type (b) ls /bin | grep a* (d) ls /bin | grep a$ (c) cut -f'' -d4 35. To find the number of commands that start with 'a' (a) ls, grep, cut, count (b) ls, (d) ls, (c) ls, grep, wc, cut (e) none of the above under /bin you need commands grep, count, split grep, wc, split
36. When creating a tree of directories with depth d and breadth b, how many nested loops do you have to have as we discussed in class? (a)1 (b)2 (c) 3 (d) 4 (e)none of the above 37. When creating a tree of directories with depth d and breadth b, the directories that have yet to be explored are held (memorized) in (a) open (b) closed (c) temp (d) successors (e)none of the above with depth d and breadth b, the directories that have already been (c) temp (d) successors (e)none of the above 39. Breadth-first search creates directories in the following order for d=3 and b=3, where numbers are directory names and /'s are subdirectories: 38. When creating a tree of directories explored are held (memorized) in (a) open (b) closed (a) 0,1,2,0/0,0/1,0/2,1/0,... (b) 0,0/0,0/0/0,0/0/1,0/0/2,0/1/0,... (c) 0,1,2,0/0,0/0/0,0/0/1,0/0/2,... (d) 0,0/0,0/1,0/2,1,1/0,1/1,1/2,... (e)none of the above 40. Depth-first search creates directories in the following order for d=3 and b=3, where numbers are direc- tory names and /'s are subdirectories: (a) 0,1,2,0/0,0/1,0/2,1/0,... (c) 0,1,2,0/0,0/0/0,0/0/1,0/0/2,... (b) 0,0/0,0/0/0,0/0/1,0/0/2,0/1/0,... (d) 0,0/0,0/1,0/2,1,1/0,1/1,1/2,... (e)none of the above
Transcribed Image Text:36. When creating a tree of directories with depth d and breadth b, how many nested loops do you have to have as we discussed in class? (a)1 (b)2 (c) 3 (d) 4 (e)none of the above 37. When creating a tree of directories with depth d and breadth b, the directories that have yet to be explored are held (memorized) in (a) open (b) closed (c) temp (d) successors (e)none of the above with depth d and breadth b, the directories that have already been (c) temp (d) successors (e)none of the above 39. Breadth-first search creates directories in the following order for d=3 and b=3, where numbers are directory names and /'s are subdirectories: 38. When creating a tree of directories explored are held (memorized) in (a) open (b) closed (a) 0,1,2,0/0,0/1,0/2,1/0,... (b) 0,0/0,0/0/0,0/0/1,0/0/2,0/1/0,... (c) 0,1,2,0/0,0/0/0,0/0/1,0/0/2,... (d) 0,0/0,0/1,0/2,1,1/0,1/1,1/2,... (e)none of the above 40. Depth-first search creates directories in the following order for d=3 and b=3, where numbers are direc- tory names and /'s are subdirectories: (a) 0,1,2,0/0,0/1,0/2,1/0,... (c) 0,1,2,0/0,0/0/0,0/0/1,0/0/2,... (b) 0,0/0,0/0/0,0/0/1,0/0/2,0/1/0,... (d) 0,0/0,0/1,0/2,1,1/0,1/1,1/2,... (e)none of the above
Expert Solution
steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
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
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS