This document defines a tables class with three methods - two(), three(), and four() - that each multiply two numbers in a loop and print the results. The main method gets a choice from the user and calls the corresponding method on a tables object.
The document compares the performance of several open source web mapping frameworks - OpenLayers 2, OpenLayers 3, and Leaflet. It conducted tests rendering and panning points, lines, and polygons using these frameworks. OpenLayers 3 API Branch had the best performance, followed by Leaflet 0.8-dev, with OpenLayers 2 Canvas also performing well. The document discusses optimizations like using Canvas instead of DOM for rendering and the potential of WebGL.
This document covers logic and binary concepts for an Arduino workshop. It discusses binary representation, converting decimal to binary, binary addition and subtraction, and the logic gates AND, OR, and NOT. Examples are provided for binary operations and each of the logic gates.
An adder is a digital circuit that performs addition of numbers. There are two main types of adders: half adders and full adders. A half adder accepts two binary digits as input and produces a sum and carry bit as output. A full adder accepts two input bits and an input carry, and generates a sum output and output carry. Full adders are used to build adders that can add more than two bits by chaining multiple full adders together. Subtractors operate on similar principles to adders but use an inverted input to perform subtraction.
This document contains 5 questions regarding algorithms and data structures for a 3 hour examination. Question 1 asks about algorithms, asymptotic analysis, and Big-O notation. Question 2 involves analyzing a binary search algorithm. Question 3 is about implementing selection sort. Question 4 focuses on implementing a dynamic stack using nodes and linked lists. Question 5 deals with binary search trees, including drawing a sample tree, traversing it, defining a node structure, and writing functions to traverse and search the tree.
This document contains a list of 21 MATLAB and Scilab problems related to signals and systems. The problems cover topics like generating standard signals, plotting functions, finding signal properties, solving differential equations, and manipulating discrete-time signals. Solving these problems helps learn how to represent and analyze continuous-time and discrete-time signals using MATLAB and Scilab.
This document contains questions about radical functions, solving equations algebraically and graphically, working with complex numbers including addition, subtraction, multiplication, division, and solving equations with complex numbers. Specifically, it asks the reader to:
- Find the domain and range of various radical functions
- Solve equations algebraically by isolating radicals, squaring both sides, and checking solutions
- Simplify expressions with imaginary numbers
- Perform basic operations like addition and multiplication on complex numbers
- Solve equations involving complex numbers
The document describes how to load image data from multiple files, calculate the mean pixel value for each image, and save the results to a MATLAB data file. Specifically, it loops through numbers 1 to 10, constructs image file names by concatenating a file path with the number as a string, reads in each image, calculates the mean pixel value, and saves the values to a matrix M. It then saves M to a MATLAB data file called "MEANS.mat" and loads the data back into the variable MR.
The document compares the performance of several open source web mapping frameworks - OpenLayers 2, OpenLayers 3, and Leaflet. It conducted tests rendering and panning points, lines, and polygons using these frameworks. OpenLayers 3 API Branch had the best performance, followed by Leaflet 0.8-dev, with OpenLayers 2 Canvas also performing well. The document discusses optimizations like using Canvas instead of DOM for rendering and the potential of WebGL.
This document covers logic and binary concepts for an Arduino workshop. It discusses binary representation, converting decimal to binary, binary addition and subtraction, and the logic gates AND, OR, and NOT. Examples are provided for binary operations and each of the logic gates.
An adder is a digital circuit that performs addition of numbers. There are two main types of adders: half adders and full adders. A half adder accepts two binary digits as input and produces a sum and carry bit as output. A full adder accepts two input bits and an input carry, and generates a sum output and output carry. Full adders are used to build adders that can add more than two bits by chaining multiple full adders together. Subtractors operate on similar principles to adders but use an inverted input to perform subtraction.
This document contains 5 questions regarding algorithms and data structures for a 3 hour examination. Question 1 asks about algorithms, asymptotic analysis, and Big-O notation. Question 2 involves analyzing a binary search algorithm. Question 3 is about implementing selection sort. Question 4 focuses on implementing a dynamic stack using nodes and linked lists. Question 5 deals with binary search trees, including drawing a sample tree, traversing it, defining a node structure, and writing functions to traverse and search the tree.
This document contains a list of 21 MATLAB and Scilab problems related to signals and systems. The problems cover topics like generating standard signals, plotting functions, finding signal properties, solving differential equations, and manipulating discrete-time signals. Solving these problems helps learn how to represent and analyze continuous-time and discrete-time signals using MATLAB and Scilab.
This document contains questions about radical functions, solving equations algebraically and graphically, working with complex numbers including addition, subtraction, multiplication, division, and solving equations with complex numbers. Specifically, it asks the reader to:
- Find the domain and range of various radical functions
- Solve equations algebraically by isolating radicals, squaring both sides, and checking solutions
- Simplify expressions with imaginary numbers
- Perform basic operations like addition and multiplication on complex numbers
- Solve equations involving complex numbers
The document describes how to load image data from multiple files, calculate the mean pixel value for each image, and save the results to a MATLAB data file. Specifically, it loops through numbers 1 to 10, constructs image file names by concatenating a file path with the number as a string, reads in each image, calculates the mean pixel value, and saves the values to a matrix M. It then saves M to a MATLAB data file called "MEANS.mat" and loads the data back into the variable MR.
The document describes building a half subtractor circuit to subtract two bits and verify the output using a truth table. The half subtractor has two inputs - minuend and subtrahend - and two outputs - the difference and borrow bit. The procedure involves connecting the circuit as shown, setting input bit streams, running the simulation, and verifying the output matches the truth table.
An AVL tree, ordered by key insert: a standard insert; (log n) find: a standard find (without removing, of course); (log n) remove: a standard remove; (log n)
This document discusses topological sorting and strongly connected components in directed graphs. It defines topological sorting as a linear ordering of the vertices in a directed acyclic graph such that for every edge from vertex u to v, u comes before v in the ordering. It presents Kahn's algorithm for performing topological sorting in O(V+E) time. It also defines strongly connected components as maximal sets of vertices such that there is a path between every pair, and presents an algorithm to find the strongly connected components in a graph in O(V+E) time using depth-first search on the transpose graph.
This document summarizes key points from lecture 2 on chapters 2 and 3 of the textbook. It discusses plotting in MATLAB, including plotting arrays and functions, formatting plots, and using multiple axes and figures. It also covers m-files, describing scripts and functions, and control structures like for loops and if/else statements.
This document contains code examples that demonstrate object-oriented programming concepts in C#, including inheritance, polymorphism, method overloading, and overriding. It defines base Shape and derived Circle, Rectangle, and Square classes, and shows how polymorphism allows a Shape reference variable to call draw methods on Circle, Rectangle and Square objects at runtime. It also contains examples of method overloading in the Circle class.
This Java program asks the user to input the base area and height of a shape, then calculates and prints the square area by multiplying the base area and height. It introduces the Scanner class to get user input, defines main() to contain the logic, and prints output statements to prompt for and display the results.
This document discusses half adders and full adders. It defines a half adder as adding two single binary digits and producing a sum and carry output. A full adder adds three binary digits and produces a sum and carry output, accounting for values carried in and out. Truth tables are provided showing the input and output values for half and full adders. Circuit designs are presented for each using logic gates, with the half adder using XOR and AND gates and the full adder using additional gates due to the third input.
This document discusses subtractors in digital electronics. It defines a half subtractor and full subtractor, providing their truth tables, boolean expressions, and logic circuits. A half subtractor subtracts one single bit binary number from another and outputs the difference and borrow. A full subtractor subtracts three single bit binary numbers and outputs the difference and borrow. The document also describes how a parallel binary subtractor can be implemented by connecting multiple full subtractors to subtract binary numbers with multiple bits.
This document outlines various keyboard shortcuts that can be used to navigate and execute commands more efficiently in computer software. It provides shortcuts for actions like selecting all text, copying, cutting, pasting, bolding, centering, finding, replacing, justifying, and more using Ctrl combined with various letters and symbols. These shortcuts allow performing common tasks more quickly than using drop-down menus and buttons.
The document describes Visual SQL Tuning (VST), a methodology for analyzing and improving SQL performance. It discusses how to:
1. Identify slow queries using monitoring tools or user complaints.
2. Examine the execution plan of a slow query to understand how it is executing.
3. Draw a map of the tables and joins in the query to help determine the best execution plan. The map shows relationships like one-to-one, one-to-many, and filters.
4. Apply techniques like choosing the best join order, adding indexes, or using partitions based on the analysis from steps 2 and 3.
Create a correlation plot from joined tables and lag timesDougLoqa
This explains a process that was captured in this whitepaper posted here: https://www.slideshare.net/DougLoqa/setting-up-a-correlation-plot-on-energy-demand-using-r. It seemed that posting that process in Word document format wasn't as easy to see on some devices. This PowerPoint explains the step-by-step process a little more clearly so you can combine fields of two tables, and look at lag times to connect cause and effect over time. The end result is a correlation plot showing relationships between that cause and the lag times of the effects.
This document summarizes common regular expression patterns and constructs. It explains character classes, quantifiers, boundaries, capture groups, lookahead and lookbehind assertions, and provides examples of phone number and URL matching patterns. Regular expressions can be used to search for, find and replace text in documents and code.
To calculate the arithmetic mean number of runs scored in cricket matches in 2016, the document describes using GNU coreutils and awk to: 1) sum the total runs scored by each team in each match from a data file; 2) divide the total runs by the number of matches to get the average runs per match; and 3) execute a command that outputs the result as 4.47776, which is the mean number of runs scored per game.
The document discusses various data structures including skip lists, AVL trees, and hashing. It explains that skip lists allow for logarithmic-time operations and are simple to implement. Hashing provides constant-time operations by mapping keys to array indices via a hash function, but collisions must be handled. Common hash functions discussed include summing character codes or converting to a number in a prime base.
The document discusses different types of binary adders and arithmetic circuits. A binary adder uses full adder circuits connected in cascade to generate the sum of two binary numbers of any length. A binary adder-subtractor can perform both addition and subtraction using an exclusive-OR gate with each full adder and a mode input to control the operation. A binary incrementer independently increments a number using a combinational circuit. An arithmetic circuit uses a parallel adder as its basic component and multiplexers to choose different arithmetic operations like addition, subtraction, and increment on its inputs and output.
This document provides an introduction to Python programming concepts including basic arithmetic operations, variables, data types, functions, strings, lists, conditional statements, while loops, and for loops. It explains key Python syntax such as operators, comments, functions, indexing lists, conditional checks, and loop structures. Examples are given for basic math calculations, string manipulation, list indexing/modification, conditional logic, and while/for loops. Key terms like integers, floats, booleans, strings, lists, tuples, dictionaries, if/else statements, comparison operators, and loop types are defined.
The document provides steps for graphing a function from a function table:
1) Use the function table to determine coordinate points and plot them on a coordinate plane.
2) Connect the points to form a graph and write the function in standard y=kx notation where k is the constant of proportionality.
3) Describe the characteristics of the graph such as whether it is increasing, decreasing, or staying the same.
This document discusses various methods of data representation in computers, including:
1. Numeric data such as integers and real numbers can be represented in binary, octal, hexadecimal, or decimal number systems. Positional number systems like binary are preferred in computers due to their efficient hardware implementation.
2. Fixed point numbers represent numeric values using a binary number and radix point at a fixed location. Signed magnitude, 1's complement, and 2's complement representations allow representing positive and negative numbers.
3. Floating point numbers represent values using a signed mantissa and exponent, allowing a wider range of numbers but with less precision than fixed point. The radix and radix point position are implied rather than fixed.
This document appears to be an exam paper for an introductory computing course. It provides instructions for a 3 hour exam with 50 multiple choice questions worth 2 marks each. Negative marking of 1 mark is applied for incorrect answers. Students are instructed to write their name and roll number on the question paper and answer sheet. Use of mobile phones or calculators during the exam is prohibited.
AP PGECET Computer Science 2016 question paperEneutron
This document contains instructions for a 120-minute, 120-question multiple choice exam with 4 answer choices for each question. It states that each question carries 1 mark and there are no penalties for wrong answers. The booklet contains 16 pages and students should notify the invigilator of any issues. Answers must be marked on the provided OMR answer sheet using a blue or black pen.
This document provides an overview of using data.tables in R. It discusses how to create and subset data.tables, manipulate columns by reference, perform grouped operations, and use keys and indexes. Some key points include:
- Data.tables allow fast subsetting, updating, and grouping of large data sets using keys and indexes.
- Columns can be manipulated by reference using := to efficiently add, update, or remove columns.
- Grouped operations like summing are performed efficiently using by to split the data.table into groups.
- Keys set on one or more columns allow fast row selection similar to SQL queries on indexed columns.
The document describes building a half subtractor circuit to subtract two bits and verify the output using a truth table. The half subtractor has two inputs - minuend and subtrahend - and two outputs - the difference and borrow bit. The procedure involves connecting the circuit as shown, setting input bit streams, running the simulation, and verifying the output matches the truth table.
An AVL tree, ordered by key insert: a standard insert; (log n) find: a standard find (without removing, of course); (log n) remove: a standard remove; (log n)
This document discusses topological sorting and strongly connected components in directed graphs. It defines topological sorting as a linear ordering of the vertices in a directed acyclic graph such that for every edge from vertex u to v, u comes before v in the ordering. It presents Kahn's algorithm for performing topological sorting in O(V+E) time. It also defines strongly connected components as maximal sets of vertices such that there is a path between every pair, and presents an algorithm to find the strongly connected components in a graph in O(V+E) time using depth-first search on the transpose graph.
This document summarizes key points from lecture 2 on chapters 2 and 3 of the textbook. It discusses plotting in MATLAB, including plotting arrays and functions, formatting plots, and using multiple axes and figures. It also covers m-files, describing scripts and functions, and control structures like for loops and if/else statements.
This document contains code examples that demonstrate object-oriented programming concepts in C#, including inheritance, polymorphism, method overloading, and overriding. It defines base Shape and derived Circle, Rectangle, and Square classes, and shows how polymorphism allows a Shape reference variable to call draw methods on Circle, Rectangle and Square objects at runtime. It also contains examples of method overloading in the Circle class.
This Java program asks the user to input the base area and height of a shape, then calculates and prints the square area by multiplying the base area and height. It introduces the Scanner class to get user input, defines main() to contain the logic, and prints output statements to prompt for and display the results.
This document discusses half adders and full adders. It defines a half adder as adding two single binary digits and producing a sum and carry output. A full adder adds three binary digits and produces a sum and carry output, accounting for values carried in and out. Truth tables are provided showing the input and output values for half and full adders. Circuit designs are presented for each using logic gates, with the half adder using XOR and AND gates and the full adder using additional gates due to the third input.
This document discusses subtractors in digital electronics. It defines a half subtractor and full subtractor, providing their truth tables, boolean expressions, and logic circuits. A half subtractor subtracts one single bit binary number from another and outputs the difference and borrow. A full subtractor subtracts three single bit binary numbers and outputs the difference and borrow. The document also describes how a parallel binary subtractor can be implemented by connecting multiple full subtractors to subtract binary numbers with multiple bits.
This document outlines various keyboard shortcuts that can be used to navigate and execute commands more efficiently in computer software. It provides shortcuts for actions like selecting all text, copying, cutting, pasting, bolding, centering, finding, replacing, justifying, and more using Ctrl combined with various letters and symbols. These shortcuts allow performing common tasks more quickly than using drop-down menus and buttons.
The document describes Visual SQL Tuning (VST), a methodology for analyzing and improving SQL performance. It discusses how to:
1. Identify slow queries using monitoring tools or user complaints.
2. Examine the execution plan of a slow query to understand how it is executing.
3. Draw a map of the tables and joins in the query to help determine the best execution plan. The map shows relationships like one-to-one, one-to-many, and filters.
4. Apply techniques like choosing the best join order, adding indexes, or using partitions based on the analysis from steps 2 and 3.
Create a correlation plot from joined tables and lag timesDougLoqa
This explains a process that was captured in this whitepaper posted here: https://www.slideshare.net/DougLoqa/setting-up-a-correlation-plot-on-energy-demand-using-r. It seemed that posting that process in Word document format wasn't as easy to see on some devices. This PowerPoint explains the step-by-step process a little more clearly so you can combine fields of two tables, and look at lag times to connect cause and effect over time. The end result is a correlation plot showing relationships between that cause and the lag times of the effects.
This document summarizes common regular expression patterns and constructs. It explains character classes, quantifiers, boundaries, capture groups, lookahead and lookbehind assertions, and provides examples of phone number and URL matching patterns. Regular expressions can be used to search for, find and replace text in documents and code.
To calculate the arithmetic mean number of runs scored in cricket matches in 2016, the document describes using GNU coreutils and awk to: 1) sum the total runs scored by each team in each match from a data file; 2) divide the total runs by the number of matches to get the average runs per match; and 3) execute a command that outputs the result as 4.47776, which is the mean number of runs scored per game.
The document discusses various data structures including skip lists, AVL trees, and hashing. It explains that skip lists allow for logarithmic-time operations and are simple to implement. Hashing provides constant-time operations by mapping keys to array indices via a hash function, but collisions must be handled. Common hash functions discussed include summing character codes or converting to a number in a prime base.
The document discusses different types of binary adders and arithmetic circuits. A binary adder uses full adder circuits connected in cascade to generate the sum of two binary numbers of any length. A binary adder-subtractor can perform both addition and subtraction using an exclusive-OR gate with each full adder and a mode input to control the operation. A binary incrementer independently increments a number using a combinational circuit. An arithmetic circuit uses a parallel adder as its basic component and multiplexers to choose different arithmetic operations like addition, subtraction, and increment on its inputs and output.
This document provides an introduction to Python programming concepts including basic arithmetic operations, variables, data types, functions, strings, lists, conditional statements, while loops, and for loops. It explains key Python syntax such as operators, comments, functions, indexing lists, conditional checks, and loop structures. Examples are given for basic math calculations, string manipulation, list indexing/modification, conditional logic, and while/for loops. Key terms like integers, floats, booleans, strings, lists, tuples, dictionaries, if/else statements, comparison operators, and loop types are defined.
The document provides steps for graphing a function from a function table:
1) Use the function table to determine coordinate points and plot them on a coordinate plane.
2) Connect the points to form a graph and write the function in standard y=kx notation where k is the constant of proportionality.
3) Describe the characteristics of the graph such as whether it is increasing, decreasing, or staying the same.
This document discusses various methods of data representation in computers, including:
1. Numeric data such as integers and real numbers can be represented in binary, octal, hexadecimal, or decimal number systems. Positional number systems like binary are preferred in computers due to their efficient hardware implementation.
2. Fixed point numbers represent numeric values using a binary number and radix point at a fixed location. Signed magnitude, 1's complement, and 2's complement representations allow representing positive and negative numbers.
3. Floating point numbers represent values using a signed mantissa and exponent, allowing a wider range of numbers but with less precision than fixed point. The radix and radix point position are implied rather than fixed.
This document appears to be an exam paper for an introductory computing course. It provides instructions for a 3 hour exam with 50 multiple choice questions worth 2 marks each. Negative marking of 1 mark is applied for incorrect answers. Students are instructed to write their name and roll number on the question paper and answer sheet. Use of mobile phones or calculators during the exam is prohibited.
AP PGECET Computer Science 2016 question paperEneutron
This document contains instructions for a 120-minute, 120-question multiple choice exam with 4 answer choices for each question. It states that each question carries 1 mark and there are no penalties for wrong answers. The booklet contains 16 pages and students should notify the invigilator of any issues. Answers must be marked on the provided OMR answer sheet using a blue or black pen.
This document provides an overview of using data.tables in R. It discusses how to create and subset data.tables, manipulate columns by reference, perform grouped operations, and use keys and indexes. Some key points include:
- Data.tables allow fast subsetting, updating, and grouping of large data sets using keys and indexes.
- Columns can be manipulated by reference using := to efficiently add, update, or remove columns.
- Grouped operations like summing are performed efficiently using by to split the data.table into groups.
- Keys set on one or more columns allow fast row selection similar to SQL queries on indexed columns.
The document appears to be a test paper containing multiple choice questions about C, C++ language concepts. There are 43 questions testing knowledge of topics like C language syntax, data types, operators, loops, functions, pointers, arrays and structures. The questions have a single correct answer among 4 options for each.
1. VB.NET uses a try-catch-finally block to handle exceptions in a structured way. Within this block, code in the try section will execute, while catch blocks handle specific exceptions and finally blocks contain cleanup code.
2. Structures allow grouping of related data and can contain fields, methods, and events. Enumerations are used to represent sets of constants as numeric values.
3. Object-oriented programming models real-world entities as objects that contain data fields and associated methods. Key concepts include inheritance, polymorphism, and encapsulation.
This document contains a past GATE exam paper from 1996. It provides 23 multiple choice questions in Section A that test concepts in computer science such as data structures, algorithms, automata theory, programming, operating systems, computer architecture, and discrete mathematics. It also advertises classroom test series conducted by GATE Forum to help students prepare for the GATE exam through mock tests and online discussion forums with IISc alumni.
The document describes implementing a Windows Forms application in C# using various controls like menus, dialog boxes, and tooltips. It includes code for handling events like loading the form, clicking menu items like File and Edit, and clicking items on a toolbar. The application demonstrates using common controls and handling events in a Windows Forms application.
This question paper is divided into 3 sections for the Computer Science exam. Section A has 25 multiple choice questions to attempt 20. Section B has 24 multiple choice questions to attempt 20. Section C has 6 case study based questions to attempt 5. All questions carry equal marks. The document provides a sample question paper format and questions asked in sections A and B. Rohit has been given an incomplete Python code to create a CSV file from a list of student records and needs help completing it.
The document contains code snippets in VB.NET for various programming concepts like addition of two numbers, reversing a number, calculating factorial using a for loop, checking if a number is a palindrome, finding the greatest of three numbers, checking if a number is an Armstrong number, calculating the sum of digits, checking for a leap year, generating Fibonacci series, reversing a number, printing a number triangle, finding the maximum of two numbers, generating palindrome numbers, swapping two variables using a function, converting between Fahrenheit and Centigrade, swapping two variables without a third variable, summing array elements using a function, finding Armstrong numbers between 1 to 2000, inputting and printing array elements, adding array elements, using message boxes
The document discusses a computer organization and architecture course. It provides an overview of course topics including computing environments, combinational circuits, number systems, and base conversions. It also gives examples of Boolean algebra, truth tables, Karnaugh maps, and minimizing logic functions. Combinational circuits are represented using algebraic expressions, truth tables, and circuit diagrams. Methods for simplifying Boolean functions include algebraic manipulation, Karnaugh maps, and the Quine-McCluskey algorithm.
The document provides information about error handling in Python programming. It discusses different types of exceptions that may occur during program execution and how to handle them using try, except, else and finally blocks. It gives examples of programs that handle errors from inputting non-integer values or dividing by zero. The document also covers other Python programming concepts like lists, random numbers, and comparing Python to C/C++.
This document provides an overview of optimization techniques that can be performed using MATLAB. It discusses unconstrained optimization problems where the goal is to minimize or maximize an objective function without any constraints on the variables. Constrained optimization problems are also discussed, where the goal is to optimize the objective function subject to certain equality and inequality constraints. MATLAB functions like fminsearch and fmincon can be used to find the optimal solution for unconstrained and constrained problems respectively. Gradient-based methods for solving constrained optimization problems are also briefly covered.
The document contains a set of multiple choice questions and answers related to programming in C. Some key points covered include:
- Literal means a string constant
- Coercion refers to implicit type conversion
- The output of printf("%d", printf("tim")); is tim3
- Automatic variables that are not initialized have an unpredictable value
- main() is often called a high level language
- Templates in C++ allow functions and classes to be reused for different data types through generic programming. This avoids defining multiple functions to handle the same task on different types.
- A template can be viewed as a variable that can be instantiated to any data type. Two functions min() are shown, one for ints and one for doubles, demonstrating the need for templates.
- A template solution defines a single min() function that accepts any type through a template parameter <Type>. This provides a more flexible solution than separate overloaded functions.
- Templates in C++ allow functions and classes to be reused for different data types through generic programming. This avoids defining multiple functions to handle the same task on different types.
- A template can be viewed as a variable that can be instantiated for any data type. Two min() functions showed how templates provide a cleaner solution than separate functions.
- A stack is an abstract data type that follows LIFO (last-in, first-out) behavior. Elements are added and removed only from one end, called the top. Common stack operations are push, pop, empty, and top.
This program allows a user to collect personal, educational, and professional information from a candidate to automatically generate a resume in rich text format (RTF). The program includes controls to dynamically add additional educational courses and work experiences. It collects information such as name, date of birth, address, education history, work experience, skills and generates an RTF resume file with the collected information.
This document contains 27 multiple choice questions regarding number systems, Boolean algebra, logic gates and digital circuits. The questions cover topics such as binary, hexadecimal and decimal conversions; Boolean expressions and logic functions; logic gates; and basic digital circuits. Sample questions include the decimal equivalent of a binary number, Boolean expressions for logic functions, minimum number of gates needed for an implementation, and output waveforms of simple circuits.
This document provides an introduction to coding principles and Java programming, covering key topics like data types, variables, decision making, loops, strings, arrays, and XML. It includes examples of Java code demonstrating how to declare and use variables, loops, if/else statements, and arrays. It also lists different Java data types and their bit representations. The goal is to introduce foundational coding concepts in Java to prepare students for future application engineering and design work.
This document provides information about a GATE CS mock exam from 1999, including sample questions from sections A and B. It advertises a test preparation series offered by GATE Forum, providing full practice exams designed by IISc alumni. The questions cover topics like probability, algorithms, automata, databases, operating systems, and computer architecture. It encourages readers to join online discussion forums to review exam papers with other students preparing for GATE CS.
1. Imports System
Public Class tables
Private a As Integer
Private b As Integer
Private c As Integer
Private v As Integer
Public Sub two()
a = 1
b = 2
While a <= 20
c = a * b
Console.WriteLine(c)
Console.ReadLine()
a = a + 1
End While
End Sub
Public Sub three()
a = 1
b = 3
Do
c = a * b
Console.WriteLine(c)
Console.ReadLine()
a = a + 1
Loop While a <= 20
Exit Sub
End Sub
Public Sub four()
Dim s As Integer
Dim e As Integer
v = 1
s = 1
b = 4
e = 20
For v As Integer = s To e
c = v * b
Console.WriteLine(c)
Console.ReadLine()
v = v + 1
Next v
End Sub
End Class
Module module1
Sub Main()
Dim t As New tables()
Console.WriteLine("enter your choice")
Console.WriteLine("two")
Console.WriteLine("three")
Console.WriteLine("four")
Dim ch As String = Console.ReadLine()
Console.ReadLine()
Select Case ch
Case "two"
t.two()