State true of false. i) A node is a parent if it has successor nodes. ii) A node is child node if out degree is one. A) True, True B) True, False C) False, True D) False, False

State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
by

1 Answer

Answer :

B) True, False
by

Related questions

State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Description : State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called as internal nodes. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

Any node is the path from the root to the node is called A) Successor node B) Ancestor node C) Internal node D) None of the above

Description : Any node is the path from the root to the node is called A) Successor node B) Ancestor node C) Internal node D) None of the above

Last Answer : B) Ancestor node

State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False

Description : State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False

Last Answer : C) True, True

A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Last Answer : a) True

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Description : A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A) vertices, edges B) edges, vertices C) vertices, paths D) graph node, edges

Last Answer : A) vertices, edges

A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Description : A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1. A) Directed tree B) Undirected tree C) Dis-joint tree D) Direction oriented tree

Last Answer : A) Directed tree

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning? (A) I (B) HI (C) CHI (D) GHI

Description : Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning?  (A) I (B) HI (C) CHI (D) GHI

Last Answer : (B) HI

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

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

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

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 representation, which of the following operation cannot be implemented in O(1) time ? (A) Insertion at the front of the linked list. (B) Insertion at the end of the linked list. (C) Deletion of the front node of the linked list. (D) Deletion of the last node of the linked list.

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. 

Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Description : Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Last Answer : a) True

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 node in case of singly linked list. A) i-only B) ii-only C) Both i and ii D) None of both

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

For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Last Answer : (D) O(th)

For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65

Last Answer : Answer: All

In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Last Answer : (C) Shared memory segments 

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False

Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False

Last Answer : a) True

Which of the following statements are true with reference to the way of describing XML data ? (a) XML uses DTD to describe the data (b) XML uses XSL to describe the data (c) XML uses a description node to describe the data Codes : (A) (a) only (B) (b) only (C) (a) and (b) (D) (a) and (c)

Description : Which of the following statements are true with reference to the way of describing XML data ? (a) XML uses DTD to describe the data (b) XML uses XSL to describe the data (c) XML uses a description node to describe the data Codes : (A) (a) only (B) (b) only (C) (a) and (b) (D) (a) and (c)

Last Answer : Answer: D

State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true of false. i) Public can only be assigned to class ii) Protected protects a statement iii) Protected method is never accessible outside the package iv) Friendly variable may be accessible outside class A) i- ... -false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : C) i-false, ii-true, iii-false, iv-false

State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, ... false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : A) i-true, ii-true, iii-false, iv-true

State true or false. i) Jpanel is a class included in awt package. ii) Anonymous classes are mostly used for event handling. iii) Names of anonymous classes must be unique iv) JOptionPane is an inner class A) i-false, ii-false, iii-true, iv-true B) i-true, ii-false, iii-true, iv-false C) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Description : State true or false. i) Jpanel is a class included in awt package. ii) Anonymous classes are mostly used for event handling. iii) Names of anonymous classes must be unique iv) JOptionPane is an inner class A) i-false ... ) i-false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true

Last Answer : C) i-false, ii-true, iii-false, iv-false

State true or false. i) init() is called after start() in applet ii) applets are used for networking iii) inheritance is a part of Java Foundation Classes iv) final does not prevent inheritance A) i-true, ii-true, iii-false, iv-true B) i-false, ii-false, iii-false, iv-false C) i-true, ii-true, iii-true, iv-true D) i-true, ii-false, iii-false, iv-false

Description : State true or false. i) init() is called after start() in applet ii) applets are used for networking iii) inheritance is a part of Java Foundation Classes iv) final does not prevent inheritance A) i-true, ii- ... C) i-true, ii-true, iii-true, iv-true D) i-true, ii-false, iii-false, iv-false

Last Answer : B) i-false, ii-false, iii-false, iv-false

State whether true or false. i) init( ) of servlet is called after a client request comes in ii) Servlets are ultimately converted into JSP A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State whether true or false. i) init( ) of servlet is called after a client request comes in ii) Servlets are ultimately converted into JSP A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

State true or false for the following statements in Java. i) Java beans slow down software development process. ii) Java Servlets do not have built in multithreading feature. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true or false for the following statements in Java. i) Java beans slow down software development process. ii) Java Servlets do not have built in multithreading feature. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : C) i-true, ii-false

State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Description : State true or false for Java Program. i) All class variables are instance variables ii) All protected methods are friendly methods A) i-false, ii-false B) i-false, ii-true

Last Answer : B) i-false, ii-true

State true of false. i) AWT is an extended version of swing ii) Paint( ) of Applet class cannot be overridden A) i-false, ii-false B) i-false,ii-true C) i-true, ii-false D) i-true, ii-true

Description : State true of false. i) AWT is an extended version of swing ii) Paint( ) of Applet class cannot be overridden A) i-false, ii-false B) i-false,ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

State True or False i) A destructor never takes any argument nor does it return any value. ii) It releases memory space for future use. A) True, True B) True, False C) False, True D) False, False

Description : State True or False i) A destructor never takes any argument nor does it return any value. ii) It releases memory space for future use. A) True, True B) True, False C) False, True D) False, False

Last Answer : A) True, True

State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Last Answer : B) True, False

State true of false. i) We cannot make the function inline by defining a function outside the class. ii) A member function can be called by using its name inside another member function of the same class, this is known as nesting of member function. A) True, True B) True, False C) False, True D) False, False

Description : State true of false. i) We cannot make the function inline by defining a function outside the class. ii) A member function can be called by using its name inside another member function of the same class, this ... of member function. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

State whether true of false. i) A worm mails a copy of itself to other systems. ii) A worm executes a copy of itself on another system. A) True, False B) False, True C) True, True D) False, False

Description : State whether true of false. i) A worm mails a copy of itself to other systems. ii) A worm executes a copy of itself on another system. A) True, False B) False, True C) True, True D) False, False

Last Answer : C) True, True

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

State true or false. i) Unix, support multiple user process but only support one thread per process. ii) A java run time environment is an example of a system of one process with multiple threads. A) True, False B) True, True C) False, True D) False, False

Description : State true or false. i) Unix, support multiple user process but only support one thread per process. ii) A java run time environment is an example of a system of one process with multiple threads. A) True, False B) True, True C) False, True D) False, False

Last Answer : B) True, True

State whether true or false. i) Multithreading is useful for application that perform a number of essentially independent tasks that do not be serialized. ii) An example of multithreading is a database server that listens for and process numerous client request. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : State whether true or false. i) Multithreading is useful for application that perform a number of essentially independent tasks that do not be serialized. ii) An example of multithreading is a database server that listens for ... B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : B) i-True, ii-True

State whether the following statement is true. i) It takes less time to terminate a thread than a process. ii) Threads enhance efficiency in communication between different executing programs. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : State whether the following statement is true. i) It takes less time to terminate a thread than a process. ii) Threads enhance efficiency in communication between different executing programs. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : B) i-True, ii-True

State True or False. i) In spooling high speed device like a disk is interposed between running program and low-speed device in Input/output. ii) By using spooling for example instead of writing directly to a printer, outputs are written to the disk. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : State True or False. i) In spooling high speed device like a disk is interposed between running program and low-speed device in Input/output. ii) By using spooling for example instead of writing directly to a printer, ... ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : B) i-True, ii-True

State True or False. i) Master Development Plan basically is a schedule of various applications to be comprised. ii) It consists of start and finish dates of a system analysis, design implementation and maintenance activities. A) i-True, ii-True B) i-False, ii-True C) i-True, ii-False D) i-False, ii-False

Description : State True or False. i) Master Development Plan basically is a schedule of various applications to be comprised. ii) It consists of start and finish dates of a system analysis, design implementation and maintenance activities. ... B) i-False, ii-True C) i-True, ii-False D) i-False, ii-False

Last Answer : A) i-True, ii-True

State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Description : State True or False. i) An undirected graph which contains no cycles is called forest. ii) A graph is said to be complete if there is an edge between every pair of vertices. A) True, True B) False, True C) False, False D) True, False

Last Answer : A) True, True

State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no edge between every pair of vertices. A) True, False, True B) True, True, False C) True, True, True D) False, True, True

Description : State True of False. i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no ... ) True, False, True B) True, True, False C) True, True, True D) False, True, True

Last Answer : B) True, True, False

State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. A) i-true, ii-false B) i-false, ii-true C) i-true, ii-true D) i-false, ii-false

Description : State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. A) i-true, ii-false B) i-false, ii-true C) i-true, ii-true D) i-false, ii-false

Last Answer : C) i-true, ii-true

State whether the following statement are true. i) An application-level gateway is often referred to as a proxy. ii) In proxy, a direct connection is established between the client and destination server. A) True, False B) False, True C) True, True D) False, False

Description : State whether the following statement are true. i) An application-level gateway is often referred to as a proxy. ii) In proxy, a direct connection is established between the client and destination server. A) True, False B) False, True C) True, True D) False, False

Last Answer : A) True, False

State true or false. i) Socks are a standard for circuit level gateways. ii) The NAT is used for small number of the hosts in a private network. A) True, False B) False, True C) True, True D) False, False

Description : State true or false. i) Socks are a standard for circuit level gateways. ii) The NAT is used for small number of the hosts in a private network. A) True, False B) False, True C) True, True D) False, False

Last Answer : D) False, False

State whether true or false. i) A connection oriented protocol can only use unicast addresses. ii) The anycast service is included in IPV6. A) True, True B) True, False

Description : State whether true or false. i) A connection oriented protocol can only use unicast addresses. ii) The anycast service is included in IPV6. A) True, True B) True, False

Last Answer : i) A connection oriented protocol can only use unicast addresses.

State the following statement is true or false. i) In class B addresses a total of more than 1 billion addresses can be formed. ii) Class E addresses are reserved for future or experimental use. A) True, False B) True, True C) False, True D) False, False

Description : State the following statement is true or false. i) In class B addresses a total of more than 1 billion addresses can be formed. ii) Class E addresses are reserved for future or experimental use. A) True, False B) True, True C) False, True D) False, False

Last Answer : B) True, True

State whether the following is True or False. i) In bus topology, heavy Network traffic slows down the bus speed. ii) It is multipoint configuration. A) True, True B) True, False C) False, True D) False, False

Description : State whether the following is True or False. i) In bus topology, heavy Network traffic slows down the bus speed. ii) It is multipoint configuration. A) True, True B) True, False C) False, True D) False, False

Last Answer : A) True, True