search
Log In
1 vote
1.2k views

What does the following command do? grep -vn "abc" x

  1. It will print all of the lines in the file x that match the search string "abc"
  2. It will print all of the lines in file x that do not match the search string "abc"
  3. It will print the total number of lines in the file x that match the search string "abc"
  4. It will print the specific line numbers of the file x in which there is a match for string "abc"
in Operating System
edited by
1.2k views

1 Answer

1 vote
ans is B grep(globally search a regular expression and print it) with -v invert match option display those line which do not contain the specified string

edited by
1
Thank you for the answer but it cannot be v for verbose that doesn't make sense, it is v for invert-match!
Answer:

Related questions

15 votes
3 answers
1
2.3k views
The inorder and preorder traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectively The postorder traversal of the binary tree is: $\text{d e b f g c a}$ $\text{e d b g f c a}$ $\text{e d b f g c a}$ $\text{d e f g b c a}$
asked Sep 22, 2014 in DS Kathleen 2.3k views
0 votes
1 answer
2
848 views
Which of the following commands will output &ldquo;onetwothree&rdquo; ? for val; do echo-n $val; done < one two three for one two three; do echo-n-; done for n in one two three; do echo-n $n; done for n in one two three {echo &ndash;n $ n}
asked Jun 29, 2016 in Others makhdoom ghaya 848 views
2 votes
2 answers
3
2.4k views
A LRU page replacement is used with $4$ page frames and eight pages. How many page faults will occur with the reference string $0172327103$ if the four frames are initially empty? $6$ $7$ $5$ $8$
asked Jul 31, 2016 in Operating System jothee 2.4k views
2 votes
2 answers
4
3k views
A disk drive has $100$ cylinders, numbered $0$ to $99$. Disk requests come to the disk driver for cylinders $12, 26, 24, 4, 42, 8$ and $50$ in that order. The driver is currently serving a request at a cylinder $24$. A seek takes $6$ msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? $0.984$ sec $0.396$ sec $0.738$ sec $0.42$ sec
asked Jul 31, 2016 in Operating System jothee 3k views
...