Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.
Last Answer : (D) Deletion of the last node of the linked list.
Description : Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first ... linked list. A) i-only B) ii-only C) Both i and ii D) None of both
Last Answer : C) Both i and ii
Description : Suppose d = {“john”:40, “peter”:45}, to delete the entry for “john” what command do we use a) d.delete(“john”:40) b) d.delete(“john”) c) del d[“john”]. d) del d(“john”:40)
Last Answer : c) del d[“john”].
Description : Consider the following UNIX command: sort temp; head -30
Last Answer : (C) Sort, taking the input from "in" and writing the output to "temp" then prints 30 lines from temp on terminal. Finally "temp" is removed.
Description : Suppose list1 is [4, 2, 2, 4, 5, 2, 1, 0], which of the following is correct syntax for slicing operation? a) print(list1[0]) b) print(list1[:2]) c) print(list1[:-2]) d) all of the mentioned
Last Answer : d) all of the mentioned
Description : Find the false statement: (A) The relationship construct known as the weak relationship type was defined by Dey, Storey & Barron (1999). (B) A weak relationship occurs when two ... Ternary, Quaternary and Quintary relationships are shown through a series of application scenario's and vignette's
Last Answer : (C) Conceptual model is not accurate representation of "Universe of interest".
Description : Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also ... memory were available? (A) 60 sec (B) 30 sec (C) 45 sec (D) 10 sec
Last Answer : Answer: C Explanation: T = Ninstr x 1µs + 15,000 x 2,000 µs = 60s Ninstr x 1µs = 60,000,000 µs - 30,000,000 µs = 30,000,000 µs Ninstr = 30,000,000 The number of instruction ... doesn't mean that the program runs twice as fast as on the first system. Here, the performance increase is of 25%.
Description : Steel Beam theory is the method of analysis and a design of [ A ] Singly reinforced sections [ B ] Doubly reinforced sections [ C ] Both (a) and (b) [ D ] Steel structures only
Last Answer : [ B ] Doubly reinforced sections
Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes
Last Answer : (C) Only rear pointer changes
Description : What's the Correct alphabetical listing method for last names like von Braun?
Last Answer : I would think under V, von. I think “von whomever” is akin to Mc names, like McFadden.
Description : Suppose list Example is [‘h’,’e’,’l’,’l’,’o’], what is len(list Example)? a) 5 b) 4 c) None d) Error
Last Answer : a) 5
Description : 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? (A) 10011001 (B) 00011001 (C) 00111000 (D) 11000110
Last Answer : (B) 00011001
Description : Suppose that the time to do a null remote procedure call (RPC) (i.e, 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs? (A) 49 msec (B) 80 msec (C) 48 msec (D) 100 msec
Last Answer : (B) 80 msec
Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364
Last Answer : (C) 926, 203, 912, 241, 913, 246, 364
Description : In Java variables, if first increment of the variable takes place and then the assignment occurs. This operation is also called ............................. . A) pre increment B) post increment C) incrementation D) pre incrementation
Last Answer : A) pre increment
Description : ………… is not the component of data structure. A) Operations B) Storage Structures C) Algorithms D) None of above
Last Answer : D) None of above
Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.
Last Answer : (D) Both S1 and S2 are correct.
Description : The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? (A) File descriptor table (B) System call state (C) Scheduling parameters (D) Kernel stack
Last Answer : (C) Scheduling parameters
Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.
Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.
Description : Linked Lists -- Can you tell me how to check whether a linked list is circular?
Last Answer : Create two pointers, and set both to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next ... before pointer1, or the item before that. Either way, its either 1 or 2 jumps until they meet.
Description : Tell how to check whether a linked list is circular.
Last Answer : Create two pointers, each set to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) { print (\"circular\n\"); }
Description : Which of the following express has the longest Train route in India? A. Howrah Express B. Vivek Express C. Utkal Express D. Duranto Express
Last Answer : B [Vivek Express] Explanation: Vivek Express covers the longest train route in India. It originates in northern Assam and goes all the way to the southern tip of India to Kanyakumari.
Description : Which train in India has the longest route length? A. Howrah - Jammu Tawi Himgiri Express B. Kanyakumari - Jammu Tawi Himsagar Express C. Kanyakumari - Dibrugarh Vivek Express D. Guwahati-Thiruvanthapuram Express
Last Answer : C [Kanyakumari - Dibrugarh Vivek Express] Explanation: Dibrugarh–Kanyakumari Vivek Express is a weekly Express train of the Vivek Express series the Indian Railways which runs from Dibrugarh in India's north eastern state Assam to Kanyakumari in Tamil Nadu.
Description : Ajay and vivek are active partner in a particular work. Ajay receive 1/7th of the capital for 84 months and vivek receives 1/8 th of the profit, for how long vivek amount was used? a) 11 b) 8. C) 4 d) 2
Last Answer : Answer: D) Let total profit be A. Profit earned by vivek =1/8*A. Profit earned by Ajay =7/8 *A Ratio of vivek & Ajay =1:7 Let total capital investment be Z Ajay receive 1/7th of Z for 84 months Vijay receive 6/7th of Z for Y months 7/1=(1/7*Z*84)/(6/7*Z*Y) => Y = 2month
Description : ………………. is not an operation performed on linear list Get More Mcqs from http://www.siteforinfotech.com/p/mcqs.html a) Insertion b) Deletion c) Retrieval d) Traversal A) only a,b and c B) only a and b C) All of the above D) None of the above
Last Answer : D) None of the above
Description : The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A) Lists B) Linked Lists C) Trees D) Queues
Last Answer : B) Linked Lists
Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map
Last Answer : (B) Linked
Description : How can I delete linked email addresses in Gmail?
Last Answer : answer:Not 100% sure this is what you're referring to, but I think if you click on the gear wheel (under that right-hand corner icon), select Settings, then go to the Accounts and Import tab, ... !). You may want to do a bit more research about this before proceeding - perhaps on Google forums.
Description : Suppose d = { john :40, peter :45}, what happens when we try to retrieve a value using the expression d[ susan ]? a) Since susan is not a value in the set, Python raises a KeyError ... Python raises a KeyError exception d) Since susan is not a key in the set, Python raises a syntax error
Last Answer : c) Since “susan” is not a key in the set, Python raises a KeyError exception
Description : Suppose d = {“john”:40, “peter”:45}. To obtain the number of entries in dictionary which command do we use? a) d.size() b) len(d) c) size(d) d) d.len()
Last Answer : b) len(d)
Description : Suppose t = (1, 2, 4, 3), which of the following is incorrect? a) print(t[3]) b) t[3] = 45 c) print(max(t)) d) print(len(t))
Last Answer : b) t[3] = 45
Description : Suppose list1 = [0.5 * x for x in range(0, 4)], list1 is : a) [0, 1, 2, 3]. b) [0, 1, 2, 3, 4]. c) [0.0, 0.5, 1.0, 1.5]. d) [0.0, 0.5, 1.0, 1.5, 2.0].
Last Answer : c) [0.0, 0.5, 1.0, 1.5].
Description : Suppose list1 is [1, 3, 2], What is list1 * 2 ? a) [2, 6, 4]. b) [1, 3, 2, 1, 3]. c) [1, 3, 2, 1, 3, 2] . D) [1, 3, 2, 3, 2, 1].
Last Answer : c) [1, 3, 2, 1, 3, 2] .
Description : Suppose list1 is [2, 33, 222, 14, 25], What is list1[:-1] ? a) [2, 33, 222, 14]. b) Error c) 25 d) [25, 14, 222, 33, 2].
Last Answer : a) [2, 33, 222, 14].
Description : Suppose list1 is [2, 33, 222, 14, 25], What is list1[-1] ? a) Error b) None c) 25 d) 2
Last Answer : c) 25
Description : Suppose list1 is [1, 5, 9], what is sum(list1) ? a) 1 b) 9 c) 15 d) Error
Last Answer : c) 15
Description : Suppose list1 is [3, 5, 25, 1, 3], what is min(list1) ? a) 3 b) 5 c) 25 d) 1
Last Answer : d) 1
Description : Suppose list1 is [2445, 133, 12454, 123], what is max(list1) ? a) 2445 b) 133 c) 12454 d) 123
Last Answer : c) 12454
Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2
Last Answer : (C) √2xz
Description : 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: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}
Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}
Description : 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 ... sample requires 8 bits? (A) 32 kbps (B) 64 kbps (C) 128 kbps (D) 256 kbps
Last Answer : (C) 128 kbps
Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively
Last Answer : (D) 4 and 2 respectively
Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state
Last Answer : Answer: B
Description : Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1/50000, and that the proportion of people having stiff neck is 1/20. Then ... complain about stiff neck is: (A) 0.01% (B) 0.02% (C) 0.04% (D) 0.05%
Description : Which of the following arguments are not valid? (a) If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he ... and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)
Last Answer : Answer: B Explanation: (a) P: Gora gets the job Q: Gora works hard R: Gora gets promotion S: Gora will be happy The argument can bet written as (P˄Q)→R R→S ¬S ... also be written as: ((P˅Q)˄¬P)→Q where P, and Q are propositions expressed in some formal system.
Description : The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to ... ) 25 person months (B) 75 person months (C) 62.5 person months (D) 72.5 person months
Last Answer : (C) 62.5 person months
Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4
Last Answer : (C) Yes, P4 P3 P1 P2
Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2
Last Answer : (C) (n-1)/2
Description : Suppose that R1 and R2 are reflexive relations on a set A. Which of the following statements is correct? (A) R1∩R2 is reflexive and R1UR2 is irreflexive. (B) R1∩R2 is irreflexive and R1UR2 is reflexive. (C) Both R1∩R2 and R1UR2 are reflexive. (D) Both R1∩R2 and R1UR2 are irreflexive.
Last Answer : (C) Both R1∩R2 and R1UR2 are reflexive.