Practice Basics of Computers Questions and Answers

• Port number for data and control of FTP protocol
• Size of MD5 message digest
•   Which all is/are Ransomware
• How do we can Delete all in SQL
• Truncate command in SQL
• Data mart types
• State True/False With a data mart, teams can access data and gain insights faster, because they don’t have to spend time searching within a more complex...
• Identify correct statement w.r.t Java Syntax
• Operator overloading in C++
• Bitwise operators in C++
• Command to change the priority in LINUX
• To count total no of argument in shell
• Definition of 2NF
• Quick sort average time complexity
• Divide and conquer is used by
• Dynamic programming is used by
• Which all statements are correct about Sorting
• Which is/are correct w.r.t Passive attacks
• Which is/are Keyword in C++
• Purpose of Scope resolution operator
• Identify the OSI layer responsible for end to end transmission
• Data Frame are associated with which layer of OSI Model
• 1.    Predict the output of the code public class Animal {     public static void main(String args[])              {            ...
• Recursion uses
• Abstract Class in Java
• SMTP commands
• Aggregate function in SQL
• Graph Traversal algorithms
• Predict the   program output void main () {   int x = 128;   printf ("n%d", 1 + x++); }
• Java. Lang package
• Appending value to list in python
• The important aspect of data warehouse environment is that data found within the data warehouse is
• The time horizon of data warehouse is
• Which of the following is defined as an attempt to steal, spy, damage or destroy computer systems, networks, or their associated information?
• The first line in any shell script begins with a _____
• What is the space complexity of program to reverse stack recursively?
• In Huffman coding, data in a tree always occur?
• You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that elem...
• For a given array, there can be multiple ways to reach the end of the array using minimum number of jumps.
• The values appearing in given attributes of any tuple in the referencing relation must likewise occur in specified attributes of at least one tuple in the ...