A. Height and width
B. Rows and columns
C. Layers and planes
D. Lines and spaces
Option: B
|
A. Height and width
B. Rows and columns
C. Layers and planes
D. Lines and spaces
Option: B
A. XML
B. SGML
C. HTML 4.0
D. HTML 5.0
Option: D
A. CGI-BIN
B. RECYCLE-BIN
C. BIN
D. All of these
Option: A
A. The amount of information with in data as opposed to the amount of redundancy or noise
B. One of the defining aspects of a data warehouse
C. Restriction that requires data in one column of a database table to the a subset of another-column
D. None of these
Option: C
A. Machine-learning involving different techniques
B. The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned
C. Learning by generalizing from examples
D. None of these
Option: C
A. A component of a network
B. In the context of KDD and data mining, this refers to random errors in a database table.
C. One of the defining aspects of a data warehouse
D. None of these
Option: B
A. Non-trivial extraction of implicit previously unknown and potentially useful information from data
B. Set of columns in a database table that can be used to identify each record within this table uniquely.
C. collection of interesting and useful patterns in a database
D. none of these
Option: A
A. Minimum
B. Maximum
C. Virtual
D. Both (a) and (b)
Option: B
A. Go-back-N method requires more storage at the receiving site
B. Selective repeat involves complex login than GO-back-N
C. Go-back-N has better line utilization
D. Selective repeat has better line utilization
Option: C
A. Web Browsers
B. HTML
C. Internet Explorer
D. None of these
Option: A
A. Tree structure
B. Plex Structure
C. Normalize Structure
D. Table Structure
Option: A
A. Ellipse
B. Dashed ellipse
C. Rectangle
D. Diamond
Option: D
A. windef.h
B. winnt.h
C. winbase.h
D. All of these
Option: D
A. HInstance
B. hPrecInstance
C. Int nCmdShow
D. All of these
Option: D
A. #
B. $
C. &
D. ^
Option: A