What are near and far pointers, Computer Engineering

These days, they're pretty much obsolete; they're definitely system-particular. They had to do with 16-bit programming under MS-DOS and perhaps some early on versions of Windows. If you really require to know, see a DOS- or Windows-specific programming reference. If you're using a machine which doesn't need (or permit) making the near/far pointer distinction, just delete the unnecessary ''near'' and ''far'' keywords (perhaps using the preprocessor: ''#define far /* nothing */'').      

 

 

Posted Date: 4/8/2013 3:14:42 AM | Location : United States







Related Discussions:- What are near and far pointers, Assignment Help, Ask Question on What are near and far pointers, Get Answer, Expert's Help, What are near and far pointers Discussions

Write discussion on What are near and far pointers
Your posts are moderated
Related Questions
Write an applet that sets the background colour to cyan and foreground colour to red and displays a message that illustrates the order in which various applet methods are called wh

What are the different types of layers in TCP/IP protocol stack? Layers into the TCP/IP protocol architecture are as given below: • Application Layer, • Host-to-Host Tra

What are the uses of interrupts?  Recovery from errors Debugging Communication among programs Use of interrupts in operating system

design a gray to bcd code converter using 16:1 de multiplexe

Explain Excess 3 Codes Ans. Excess 3 Codes 1. This is the other form of BCD code. All decimal digits are coded in 4 bit binary code. 2. The code for all decimal di

Design and test the functions that are needed: a.  Test Main  in the Testing project add a new file main.c. b.  Test Drivers  in the Testing project add 2 new files, testDriver

What is partition? Partitions divide a system into several independent or weakly coupled subsystems, each giving one kind of service. Partitions use peer-peer subsystems.

State and prove Demorgan's second theorem   Proof: Demorgan's second theorem   = A‾ + B‾ The two sides of the equation here   = A‾ + B‾ is represented through the logic d

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.

Optimal Page Replacement Algorithm The optimal page replacement algorithm that as well known as OPT is an algorithm which works as follows: while a page needs to be swapped in,