1) Which of the following is not true a. Sorting is done on the basics of first character of each line b. Sort command sorts a file word by word rather than line by line c. Sort command has s provision to do a numeric sort d. Sort is not […]
1) To find the block size on your file system the command is Blksz Szblk Chksz Cmchk 2) Each entry in inode table is of size 64 kb 32kb 32 bytes 64 bytes 3) The program contained in boot block, that loads kernel into memory is […]
1. Unix OS was first developed by a. Dennis Ritchie b. Bjarne stroustrup c. Ken Thompson d. Brian Kernighan 2. Unix OS was first developed at a. Microsoft corp. USA b. AT & T Bell Labs, USA c. IBM, USA d. Borland International, USA 3. Unix is written in a. […]
UNIX MCQ SET 1 UNIX MCQ SET 2 UNIX MCQ SET 3 UNIX MCQ SET 4 UNIX MCQ SET 5 UNIX MCQ SET 6 UNIX MCQ SET 7 UNIX MCQ SET 8 UNIX MCQ SET 9 UNIX MCQ SET 10
1 . In Reverse Polish notation, expression A* B+C* D is written as (A)AB*CD*+ (B) A* BCD*+ (C) AB*CD+* (D) A* B*CD+ Ans: A 2. SIMD represents an organization that . A) refers to a computer system capable of processing several programs at the same time. B) represents organization of […]
Which of the following algorithms solves the all pair shortest path problem? Diskstra’s algorithm Floyd algorithm Prim’s algorithm Warshall’s algorithm The minimum number of colors required to color a graph having n (n>3) vertices and 2 edges is 4 3 2 1 The maximum degree of any vertex in a […]
The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is a 4 digit decimal number) 280 40 47 38 If each node in a tree has a value greater than every value in its left sub tree and has value less than […]
Which of the following programming languages features require a stack-base allocation pointer Block-structure recursion dynamic scoping Push down stack or push down list is stack queue linked list dequeue Stack is useful for radix sort breadth first search recursion Heap sort Stacks can not be used to evaluate an arithmetic […]
The recurrence relation that arises in relation with the complexity of binary search is T(n)=T(n/2)+k, where k is constant T(n)=2T(n/2)+k, where k is constant T(n)=T(n/2)+log(n) T(n)=T(n/2)+n The running time T(n), where `n’ is the input size of a recursive algorithm is given as followsT(n)=c+T(n-1),if n>1 d, if nā¤ 1 […]