Questions along with Answers Below - Explanations are always welcome
1. For the 8 - bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory ?
(1) 10011001 (2) 00011001 (3) 00111000 (4) 11000110
2. Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What is the maximum data transfer rate for this microprocessor ?
(1) 8x106 bytes/sec (2) 4 x106 bytes/sec (3) 16x106 bytes/sec (4) 4 x109 bytes/sec
3. The RST 7 instruction in 8085 microprocessor is equivalent to :
(1) CALL 0010 H (2) CALL 0034 H (3) CALL 0038 H (4) CALL 003C H
4. The equivalent hexadecimal notation for octal number 2550276 is :
(1) FADED (2) AEOBE (3) ADOBE (4) ACABE
5. The CPU of a system having 1 MIPS execution rate needs 4 machine cycles on an average for executing an instruction. The fifty percent of the cycles use memory bus. A memory read/ write employs one machine cycle. For execution of the programs, the system utilizes 90 percent of the CPU time. For block data transfer, an IO device is attached to the system while CPU executes the background programs continuously. What is the maximum IO data transfer rate if programmed IO data transfer technique is used ?
(1) 500 Kbytes/sec (2) 2.2 M bytes/sec (3) 125 Kbytes/sec (4) 250 Kbytes/sec
6. The number of flip-flops required to design a modulo - 272 counter is :
(1) 8 (2) 9 (3) 27 (4) 11
7. Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one - many and R2 is many - many. R1 and R2 do not have any attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model ?
(1) 4 (2) 3 (3) 2 (4) 1
8. The STUDENT information in a university stored in the relation
STUDENT (Name, SEX, Marks, DEPT_Name)
Consider the following SQL Query SELECT DEPT_Name from STUDENT where SEX S 'M' group by DEPT_Name having avg (Marks) >SELECT avg (Marks) from STUDENT. It Returns the Name of the Department for which :
(1) The Average marks of Male students is more than the average marks of students in the same Department (2) The average marks of male students is more than the average marks of students in the University
(3) The average marks of male students is more than the average marks of male students in the University
(4) The average marks of students is more than the average marks of male students in the University
9. Select the 'False' statement from the following statements about Normal Forms :
(1) Lossless preserving decomposition into 3NF is always possible
(2) Lossless preserving decomposition into BCNF is always possible
(3) Any Relation with two attributes is in BCNF
(4) BCNF is stronger than 3NF
10. The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because:
(1) Nonkey attribute V_name is dependent on V_no which is part of composite key
(2) Nonkey attribute V_name is dependent on Qty_sup
(3) Key attribute Qty_sup is dependent on primary_key unit price
(4) Key attribute V_ord_no is dependent on primary_key unit price
11. The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if :
(a) R1 ∩R2 ↠(R1 - R2)
(b) R1 →R2
(c) R1 ∩R2↠(R2 - R1 )
(d) R2→R1 ∩R2
Codes :
(1) (a) and (b) happens (2) (a) and (d) happens
(3) (a) and (c) happens (4) (b) and (c) happens
12. In the indexed scheme of blocks to a file, the maximum possible size of the file depends on :
(1) The number of blocks used for index and the size of index
(2) Size of Blocks and size of Address
(3) Size of index
(4) Size of Block
13. Give the number of principal vanishing point(s) along with their direction for the standard perspective transformation :
(1) Only one in the direction K (2) Two in the directions I and J
(3) Three in the directions I, J and K (4) Only two in the directions J and K
14. Consider a triangle A(0,0), 13(1,1) and C(5,2). The triangle has to be rotated by an angle of 45° about the point P(-1, -1). What shall be the coordinates of the new triangle ?
(1) A' = ( 1,√ 2 - 1 ) , B' = ( -1, 2√ 2 - 1 ) and C' = [3√ 2 - 1, 9/2 √ 2 - 1]
(2) A' = ( 1,√ 2 - 1 ) , B' = ( 2√ 2 - 1, -1 ) and C' = [3√ 2 - 1, 9/2 √ 2 - 1]
(3) A' = ( -1,√ 2 - 1 ) , B' = ( -1, 2√ 2 - 1 ) and C' = [3√ 2 - 1, 9/2 √ 2 - 1]
(4) A' = (√ 2 - 1, -1 ), B' = ( -1, 2√ 2 - 1 ) and C' = [3√ 2 - 1, 9/2 √ 2 - 1]
15. The process of dividing an analog signal into a string of discrete outputs, each of constant amplitude, is called:
(1) Strobing (2) Amplification (3) Conditioning (4) Quantization
16. Which of the following is not a basic primitive of the Graphics Kernel System (GKS) ?
(1) POLYLINE (2) POLYDRAW (3) FILL AREA (4) POLYMARKER
17. Which of the following statement(s) is/are incorrect ?
(a) Mapping the co-ordinates of the points and lines that form the picture into the appropriate co-ordinates on the device or workstation is known as viewing transformation.
(b) The right-handed cartesian co-ordinates system in whose co-ordinates we describe the picture is known as world co-ordinate system.
(c) The co-ordinate system that corresponds to the device or workstation where the image is to be displayed is known as physical device co-ordinate system.
(d) Left - handed co-ordinate system in which the display area of the virtual display device corresponds to the unit (Ixl) square whose lower left-hand corner is at the origin of the co-ordinate system, is known as normalized device co-ordinate system.
Codes :
(1) (a) only (2) (a) and (b) (3) (c) only (4) (d) only
18. Match the following :
List-I List-II
(a) Flood Gun (i) An electron gun designed to flood the entire screen with electrons.
(b) Collector (ii) Partly energised by flooding gun, stores the charge generated by the writing gun.
(c) Ground (iii) Used to discharge the collector.
(d) Phosphorus grains (iv) Used in memory - tube display and similar to those used in standard CRT.
(e) Writing Gun System (v) Used in memory - tube display and basically the same as the electron gun used in a conventional CRT.
Codes :
(a) (b) (c) (d) (e)
(1) (i) (ii) (iii) (iv) (v)
(2) (ii) (iii) (i) (iv) (v)
(3) (iii) (i) (ii) (v) (iv)
(4) (iv) (v) (i) (ii) (iii)
19. Minimal deterministic finite automaton for the language L = {0n | n ≥ 0 , n ≠ 4} will have :
(1) 1 final state among 5 states (2) 4 final states among 5 states
(3) 1 final state among 6 states (4) 5 final states among 6 states
20. The regular expression corresponding to the language L where
L = {x ∈ {0, 1}* | x ends with 1 and does not contain substring 00} is :
(1) (1+01)* (10 + 01) (2) (1+01)* 01
(3) (1+01)* (1 + 01) (4) (10+01)*01
21. The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by :
δ(q0, a) = q1 ; δ(q0, b) = q2
δ(q1, a) = q0 ; δ(q1, b) = q3
δ(q2, a) = q3 ; δ(q2, b) = q0
δ(q3, a) = q2 ; δ(q3, b) = q1
The initial and final states of the automata are :
(1) q0 and q0 respectively (2) q0 and q1 respectively
(3) q0 and q2 respectively (4) q0 and q3 respectively
22. The clausal form of the disjunctive normal form ¬ A ∨ ¬ B ∨ ¬ C ∨ D is:
(1) A∧B∧C⇒D (2) A∨B∨C∨D⇒true
(3) A∧B∧C∧D⇒true (4) A ∧ B ∧ C ∧ D ⇒ false
23. Which of the following is false for the programming language PROLOG ?
(1) A PROLOG variable can only be assigned to a value once
(2) PROLOG is a strongly typed language
(3) The scope of a variable in PROLOG is a single clause or rule
(4) The scope of a variable in PROLOG is a single query
24. Which one of the following is true ?
(1) The resolvent of two Horn clauses is not a Horn clause
(2) The resolvent of two Horn clauses is a Horn clause
(3) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or non-null goal
(4) If we resolve a negated goal G against a fact or rule A to get clause C then C has positive literal or null goal
25. Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender ?
(1) Broadcasting (2) Unicasting
(3) Packet switching (4) Circuit switching
26. Which of the following control fields in TCP header is used to specify whether the sender has no more data to transmit ?
(1) FIN (2) RST (3) SYN (4) PSH
27. Which are the two modes of IP security ?
(1) Transport and certificate (2) Transport and tunnel
(3) Certificate and tunnel (4) Preshared and transport
28. A message "COMPUTERNETWORK" encrypted (ignore quotes) using columnar transposition cipher with a key "LAYER". The encrypted message is :
(1) CTTOEWMROPNRUEK (2) MROUEKCTTPNROEW
(3) OEWPNRCTTUEKMRO (4) UEKPNRMROOEWCTT
29. Suppose a digitized voice channel is made by digitizing 8 kHz bandwidth analog voice signal. It is required to sample the signal at twice the highest frequency (two samples per hertz). What is the bit rate required, if it is assumed that each sample requires 8 bits ?
(1) 32 kbps (2) 64 kbps (3) 128 kbps (4) 256 kbps
30. The maximum payload of a TCP segment is :
(1) 65,535 (2) 65,515 (3) 65,495 (4) 65,475
31. An all-pairs shortest-paths problem is efficiently solved using :
(1) Dijkstra' algorithm (2) Bellman-Ford algorithm
(3) Kruskal algorithm (4) Floyd-Warshall algorithm
32. The travelling salesman problem can be solved in :
(1) Polynomial time using dynamic programming algorithm
(2) Polynomial time using branch-and-bound algorithm
(3) Exponential time using dynamic programming algorithm or branch-and-bound algorithm
(4) Polynomial time using backtracking algorithm
33. Which of the following is asymptotically smaller ?
(1) lg(lg*n) (2) lg*(lgn) (3) lg(n!) (4) lg*(n!)
34. Consider a hash table of size m = 100 and the hash function h(k) = floor (m(kA mod 1)) for A = (√ 2 -1) / 2 = 0.618033. Compute the location to which the key k = 123456 is placed in hash table.
(1) 77 (2) 82 (3) 88 (4) 89
35. Let ƒ(n) and g (n) be asymptotically non-negative functions. Which of the following is correct ?
(1) θ(ƒ(n)*g(n)) = min(ƒ(n), g(n)) (2) θ(ƒ(n)*g(n)) = max(ƒ(n), g(n))
(3) θ(ƒ(n)+g(n)) = min(ƒ(n), g(n)) (4) θ(ƒ(n)+g(n)) = max(ƒ(n), g(n))
36. The number of nodes of height h in any n - element heap is ________ .
(1) h (2) zh (3) ceil (n /zh ) (4) ceil (n/zh+1)
37. In Java, when we implement an interface method, it must be declared as :
(1) Private (2) Protected (3) Public (4) Friend
38. The Servlet Response interface enables a servlet to formulate a response for a client using the method . (1) void log(Exceptione, Strings) (2) void destroy ()
(3) int get ServerPort() (4) void set ContextType(String type)
39. Which one of the following is correct ?
(1) Java applets can not be written in any programming language
(2) An applet is not a small program
(3) An applet can be run on its own
(4) Applets are embedded in another applications
40. In XML we can specify the frequency of an element by using the symbols :
(1) + * ! (2) # * ! (3) + * ? (4) - * ?
41. In XML, DOCTYPE declaration specifies to include a reference to file.
(1) Document type Definition (2) Document type declaration
(3) Document transfer definition (4) Document type language
42. Module design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule?
(1) Inheritance (2) Polymorphism (3) Encapsulation (4) Abstraction
43. Verification:
(1) refers to the set of activities that ensure that software correctly implements a specific function
(2) gives answer to the question - Are we building the product right ?
(3) requires execution of software
(4) both (1) and (2)
44. Which design matric is used to measure the compactness of the program in terms of lines of code?
(1) Consistency (2) Conciseness (3) Efficiency (4) Accuracy
45. Requirements prioritisation and negotiation belongs to :
(1) Requirements validation (2) Requirements elicitation
(3) Feasibility study (4) Requirements reviews
46. Adaptive maintenance is a maintenance which .
(1) correct errors that were not discovered till testing phase.
(2) is carried out to port the existing software to a new environment.
(3) improves the system performance.
(4) both (2) and (3)
47. A Design concept Refinement is a:
(1) Top-down approach
(2) Complementary of Abstraction concept
(3) Process of elaboration
(4) All of the above
48. A software design is highly modular if :
(1) cohesion is functional and coupling is data type.
(2) cohesion is coincidental and coupling is data type.
(3) cohesion is sequential and coupling is content type.
(4) cohesion is functional and coupling is stamp type.
49. Match the following for operating system techniques with the most appropriate advantage :
List-I List-II
(a) Spooling (i) Allows several jobs in memory to improve CPU utilization
(b) Multiprogramming (ii) Access to shared resources among geographically dispersed computers in a transparent way
(c) Time sharing (iii) Overlapping I/O and computations
(d) Distributed computing (iv) Allows many users to share a computer simultaneously by switching processor frequently
Codes :
(a) (b) (c) (d)
(1) (iii) (i) (ii) (iv)
(2) (iii) (i) (iv) (ii)
(3) (iv) (iii) (ii) (i)
(4) (ii) (iii) (iv) (i)
50. Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm ?
(1) Queues have different priorities
(2) Each queue may have different scheduling algorithm
(3) Processes are permanently assigned to a queue
(4) This algorithm can be configured to match a specific system under design
51. What is the most appropriate function of Memory Management Unit (MMU) ?
(1) It is an associative memory to store TLB
(2) It is a technique of supporting multiprogramming by creating dynamic partitions
(3) It is a chip to map virtual address to physical address
(4) It is an algorithm to allocate and deallocate main memory to a process
52. Dining Philosopher's problem is a :
(1) Producer - consumer problem (2) Classical IPC problem
(3) Starvation problem (4) Synchronization primitive
53. In_________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
(1) Index (2) Linked (3) Contiguous (4) Bit Map
54. A unix file may be of the type:
(1) Regular file (2) Directory file
(3) Device file (4) Any one of the above
55. Match the following :
List-I List - II
(a) Intelligence (i) Contextual, tacit, transfer needs learning
(b) Knowledge (ii) Scattered facts, easily transferable
(c) Information (iii) Judgemental
(d) Data (iv) Codifiable, endorsed with relevance and purpose
Codes :
(a) (b) (c) (d)
(1) (iii) (ii) (iv) (i)
(2) (iii) (i) (iv) (ii)
(3) (i) (ii) (iii) (iv)
(4) (i) (iii) (iv) (ii)
56. Match the following knowledge representation techniques with their applications :
List-I List - II
(a) Frames (i) Pictorial representation of objects, their attributes and relationships
(b) Conceptual dependencies (ii) To describe real world stereotype events
(c) Associative networks (iii) Record like structures for grouping closely related knowledge
(d) Scripts (iv) Structures and primitives to represent sentences
Codes :
(a) (b) (c) (d)
(1) (iii) (iv) (i) (ii)
(2) (iii) (iv) (ii) (i)
(3) (iv) (iii) (i) (ii)
(4) (iv) (iii) (ii) (i)
57. In propositional logic P ↔ Q is equivalent to (Where ~ denotes NOT) :
(1) ~(P ∨Q)∧~(Q∨P) (2) (~ P∨Q) ∧ (~ Q ∨P)
(3) (P ∨ Q) ∧ (Q ∨ P) (4) ~(P∨Q)→ ~(Q∨P)
58. Which of the following statements is true for Branch - and - Bound search ?
(1) Underestimates of remaining distance may cause deviation from optimal path.
(2) Overestimates can't cause right path to be overlooked.
(3) Dynamic programming principle can be used to discard redundant partial paths.
(4) All of the above
59. Match the following with respect to heuristic search techniques :
List-I List-II
(a) Steepest-accent Hill Climbing (i) Keeps track of all partial paths which can be candidate for further exploration
(b) Branch - and - bound (ii) Discover problem state(s) that satisfy a set of constraints
(c) Constraint satisfaction (iii) Detects difference between current state and goal state
(d) Means-end-analysis (iv) Considers all moves from current state and selects best move
Codes :
(a) (b) (c) (d)
(1) (i) (iv) (iii) (ii)
(2) (iv) (i) (ii) (iii)
(3) (i) (iv) (ii) (iii)
(4) (iv) (ii) (i) (iii)
60. Match the following for methods of MIS develpoment :
List-I List-II
(a) Joint Application Design (JAD) (i) Delivers functionality in rapid iteration measured in weeks and needs frequent communication, development, testing and delivery
(b) Computer Aided Software Engg (ii) Reusable applications generally with one specific function. It is closely linked with idea of web services and service oriented architecture.
(c) Agile development (iii) Tools to automate many tasks of SDLC
(d) Component based technology (iv) A group based tool for collecting user requirements and creating system design. Mostly used in analysis and design stages of SDLC
Codes :
(a) (b) (c) (d)
(1) (i) (iii) (ii) (iv)
(2) (iv) (iii) (i) (ii)
(3) (iii) (iv) (i) (ii)
(4) (iii) (i) (iv) (ii)
61. A context free grammar for L = { w | n0 (w) > n1 (w)} is given by :
(1) S→ 0|0S|1SS (2) S→ 0S|1S|0SS|1SS|0|1
(3) S→ 0|0S|1SS|S1S|SS1 (4) S→ 0 S | 1 S | 0 | 1
62. Given the following two statements :
S1 : If L1 and L2 are recursively enumerable languages over ∑, then L1 ∪ L2 and L1 ∩ L2 are also recursively enumerable.
S2 : The set of recursively enumerable languages is countable.
Which of the following is correct?
(1) S1 is correct and S2 is not correct
(2) S1 is not correct and S2 is correct
(3) Both S1 and S2 are not correct
(4) Both S1 and S2 are correct
63 Given the following grammars:
G1: S→ AB|aaB
A → aA | ∈
B→ bB| ∈
G2: S→ A | B
A→ a A b|ab
B→ a b B| ∈
Which of the following is correct?
(1) G1 is ambiguous and G2 is unambiguous grammars
(2) G1 is unambiguous and G2 is ambiguous grammars
(3) both G1 and G2 are ambiguous grammars
(4) both G1 and G2 are unambiguous grammars
64 Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits 30 30 30 30 30 30 30 30 per symbol is:
(1)67/30 (2) 70/34 (3)76/30 (4)78/30
65. The redundancy in images stems from :
(1) pixel decorrelation (2) pixel correlation
(3) pixel quantization (4) image size
66. In a binary Hamming Code the number of check digits is r then number of message digits is equal to:
(1) 2r - 1 (2) 2r - r -1 (3) 2r - r +1 (4) 2r +r +1
67. In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of:
(1) rows or columns (2) rows + columns
(3) rows + columns - 1 (4) rows + columns +1
68. Consider the following transportation problem :
→ Warehouse
Factory
↓
The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method (VAM) is given below :
→ Warehouse
Factory
| W1 | W2 | W3 | Supply | |
|---|---|---|---|---|
| F1 | 16 | 20 | 12 | 200 |
| F2 | 14 | 8 | 18 | 160 |
| F3 | 26 | 24 | 16 | 90 |
| Demand | 180 | 120 | 150 |
→ Warehouse
Factory
↓
The solution of the above problem :
(1) is degenerate solution (2) is optimum solution
(3) needs to improve (4) is infeasible solution
69. Given the following statements with respect to linear programming problem :
S1 : The dual of the dual linear programming problem is again the primal problem
S2 : If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S3 : If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?
(1) S1 and S2 (2) S1 and S3
(3) S2 and S3 (4) S1, S2 and S3
70. Consider the two class classification task that consists of the following points :
Class C1 :[1 1.5] [1 -1.5]
Class C2 :[-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by :
(1) x1 + x2 + 1.5 = 0 (2) x1 + x2 - 1.5 = 0
(3) x1 + 1.5 = 0 (4)x1 -1.5 = 0
71. Let A and B be two fuzzy integers defined as :
A = {(1, 0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)}
B = {(10, 0.5), (11, 1), (12, 0.5)}
(1) {(11, 0.8), (13, 1), (15,1)}
(2) {(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
(3) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
(4) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}
72. Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x - 3)2 + 2.
Around -4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f (Around -4) is given by:
(1) {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}
(2) {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
(3) {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}
(4) {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}
73. Match the following for unix system calls :
List-I List - II
(a) exec (i) Creates a new process
(b) brk (ii) Invokes another program overlaying memory space with a copy of an executable file
(c) wait (iii) To increase or decrease the size of data region
(d) fork (iv) A process synchronizes with termination of child process
Codes :
(a) (b) (c) (d)
(1) (ii) (iii) (iv) (i)
(2) (iii) (ii) (vi) (i)
(3) (iv) (iii) (ii) (i)
(4) (iv) (iii) (i) (ii)
74. WOW32 is a:
(1) Win 32 API library for creating processes and threads.
(2) Special kind of file system to the NT name space.
(3) Kernel - mode objects accessible through Win 32 API
(4) Special execution environment used to run 16 bit Windows applications on 32 - bit machines.
75. The unix command :
$vi filel file2
(1) Edits filel and stores the contents of filel in file2
(2) Both files i.e. filel and file2 can be edited using 'ex' command to travel between the files
(3) Both files can be edited using 'mv' command to move between the files
(4) Edits filel first, saves it and then edits file2
| W1 | W2 | W3 | Supply | |
|---|---|---|---|---|
| F1 | 16 (140) | 20 | 12 (60) | 200 |
| F2 | 14 (40) | 8 (120) | 18 | 160 |
| F3 | 26 | 24 | 16 (90) | 90 |
| Demand | 180 | 120 | 150 |
(1) is degenerate solution (2) is optimum solution
(3) needs to improve (4) is infeasible solution
69. Given the following statements with respect to linear programming problem :
S1 : The dual of the dual linear programming problem is again the primal problem
S2 : If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.
S3 : If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?
(1) S1 and S2 (2) S1 and S3
(3) S2 and S3 (4) S1, S2 and S3
70. Consider the two class classification task that consists of the following points :
Class C1 :[1 1.5] [1 -1.5]
Class C2 :[-2 2.5] [-2 -2.5]
The decision boundary between the two classes using single perceptron is given by :
(1) x1 + x2 + 1.5 = 0 (2) x1 + x2 - 1.5 = 0
(3) x1 + 1.5 = 0 (4)x1 -1.5 = 0
71. Let A and B be two fuzzy integers defined as :
A = {(1, 0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)}
B = {(10, 0.5), (11, 1), (12, 0.5)}
(1) {(11, 0.8), (13, 1), (15,1)}
(2) {(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
(3) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), (16, 0.5), (17, 0.2)}
(4) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}
72. Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x - 3)2 + 2.
Around -4 ={(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)} respectively. Then f (Around -4) is given by:
(1) {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}
(2) {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
(3) {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}
(4) {(2, 0.6), (3, 0.3), (6, 0.6), (11, 0.3)}
73. Match the following for unix system calls :
List-I List - II
(a) exec (i) Creates a new process
(b) brk (ii) Invokes another program overlaying memory space with a copy of an executable file
(c) wait (iii) To increase or decrease the size of data region
(d) fork (iv) A process synchronizes with termination of child process
Codes :
(a) (b) (c) (d)
(1) (ii) (iii) (iv) (i)
(2) (iii) (ii) (vi) (i)
(3) (iv) (iii) (ii) (i)
(4) (iv) (iii) (i) (ii)
74. WOW32 is a:
(1) Win 32 API library for creating processes and threads.
(2) Special kind of file system to the NT name space.
(3) Kernel - mode objects accessible through Win 32 API
(4) Special execution environment used to run 16 bit Windows applications on 32 - bit machines.
75. The unix command :
$vi filel file2
(1) Edits filel and stores the contents of filel in file2
(2) Both files i.e. filel and file2 can be edited using 'ex' command to travel between the files
(3) Both files can be edited using 'mv' command to move between the files
(4) Edits filel first, saves it and then edits file2
No comments:
Post a Comment
Unable to Comment ? Switch Other Browsers i.e FireFox, Chrome etc
Please leave your Name & location with comment