Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Computer Programming Articles
Page 5 of 18
Fuzzy Logic and Probability: The Confusing Terms
In this article, you will understand the difference between fuzzy logic and probability. Fuzzy logic It is a many-valued logic where the truth value of variables may be a real number between 0 and 1, including 0 and 1. Everything is associated with a degree. It is based on natural language processing. It can be integrated with programming. It is best suited for approximation. It is generally used by quantitative analysts. It helps understand the concept of vagueness. It captures the meaning of partial truth. The degree of membership is in a set. It is used in air conditioners, ...
Read MoreDifference between Von Neumann and Harvard Architecture
There are two distinct varieties of digital computer architectures, each of which provides a description of the functioning and execution of computer systemsThe first is known as the Von Neumann Architecture, which was designed by the well-known physicist and mathematician John Von Neumann in the late 1940s.The second is known as the Harvard Architecture, which was based on the original Harvard Mark relay-based computer and used separate memory systems to store data and instructions. Both of these computer architectures were developed in the 1950s.In the original Harvard architecture, data and instructions were both stored in electro-mechanical counters, while the instructions ...
Read MoreDifference Between DDA and Bresenham Line Drawing algorithm
The realm of computer graphics is an expansive one that is always undergoing development. It involves a variety of concepts and ideas, of which "drawing a line" is the most fundamental tasks involved in working with graphical media.There are two algorithmic rules that are followed while drawing a line on the screen. They are DDA (Digital Differential Analyser) algorithmic rule and Bresenham line algorithm.Both the DDA and Bresenham's algorithm are examples of computational procedures that can be utilised for the goal of approximating the length of a line segment.What is DDA?The primary purpose of a DDA in computer graphics is ...
Read MoreCan I learn Java without any coding background?
After you’ve learned the basics of computer science, you’ll be ready to learn a programming language. Java is a high-level object-oriented programming language which is platform independent and can be run on any mobile, web or desktop applications.Theoretically, it is true that with hard work, effort and right direction one can become an expert in Java programming. But practically it would help if you know one or two core programming languages to understand the jargon easily. Learning the basics of computer science will not be enough. If you have prior knowledge of C language and the concepts, learning Java becomes easier.Java ...
Read MoreTop 10 Tools for Team Communication
In every walk of life, communication has become indispensable. Needless to say, team communications has become an integral part of each and every enterprise. E-mails are still being used by many enterprises for the sake of team communication. It is quite common these days for both employees and employers to see their respective email accounts flooded with newsletters, spam messages, unnecessary attachments etc. Despite the fact that top email service providers such as Google and Yahoo provide excellent filtering options, having a dedicated tool or software for seamless team communication will undoubtedly enhance the productivity of both employees and employers.In ...
Read MoreConvert the following LEX program into Lexical Analyzer.nAUXILIARY DEFINITIONSn −n −n −nTRANSLATION RULESn a{ }n abb{ }n a*b+
SolutionConvert the pattern into NFA’sMake a Combined NFAConvert NFA to DFAA = ε − closure (0) = {0, 1, 3, 7}The transition on symbols a, b from state AFor State Aε − closure (Ta) ε − closure (Tb)= ε − closure ({2, 4, 7}) = ε − closure ({8})= {2, 4, 7} = B = {8} = CFor State Bε − closure (7) ...
Read MoreWhat is Implementation of Block Structured Language in compiler design?
A block is a statement containing its own local data declaration. The concept of a block is originated with ALGOL. The block-structured language permits an array with adjustable length. The main feature of blocks is their bracketing structure (begin and end used in ALGOL) in which they can define their data.Activation Record for Block Structured LanguagesBlock structured language like ALGOL, and PL/I permit adjustable arrays, i.e., of varying length. Therefore, we cannot store irregular size arrays in between activation records. It can allocate the flexible or variable arrays at one corner of the activation record or above the fixed-size data. ...
Read MoreWhat is syntax-directed translation schemes in compiler design?
It is a kind of notation in which each production of Context-Free Grammar is related with a set of semantic rules or actions, and each grammar symbol is related to a set of Attributes. Thus, the grammar and the group of semantic Actions combine to make syntax-directed definitions.The translation may be the generation of intermediate code, object code, or adding the information in symbol table about constructs type. The modern compiler uses the syntax-directed translation that makes the user’s life easy by hiding many implementation details and free the user from having to specify explicitly the order in which semantic ...
Read MoreWhat is Block Structure?
A block is a statement containing its own local data declaration. The concept of a block is originated with ALGOL. The block-structured language permits an array with adjustable length. The main feature of blocks is their bracketing structure (begin and end used in ALGOL) in which they can define their data. In 'C' language, the syntax of the block is −{ declaration statements; }where the braces limit the block. The characteristic of a block is its nesting structure. Delimiters mark the starting and end of the block. In 'C' language, the braces { } act as delimiters, while ALGOL ...
Read MoreWhat is Stack Allocation of Procedure Calls?
In stack allocation, it can analyze how the memory is allocated at runtime when a procedure is called & when the value from the procedure is returned.Passing Parameter to Procedure (param x)− When actual parameter x is passed to the procedure, it will be pushed into the stack, i.e., push (x).∴ param(x) refers to push (x) which refers to decrementing of the top pointer from N + 1 to N and x will be pushed onto the stack.∴ The following statements will be executed.top = top – 1*top = x or 0[top] = xHere 0[top] means 0 offsets from the ...
Read More