0
What else can I help you with?
Which is not considered a method that a virus might use to inject itself into its target a. Overwrite b. Prepend c. Bit-stack traversal d. Append?
A
Why is there no threading for post order traversal of a binary search tree?
You don't need it. Think about it, you can just use a stack (or a recursive function.)
Size of stack memory and stack pointer register in 8051 microprocessor?
8 bit
Which of the following traversal is used for printing the keys of binary search tree in ascending order?
In order traversal is used.
What is the 16 bit register in the 8051?
pc and stack pointer
What is traverse technique used in chain survey?
1. pre-order b-tree traversal. 2. in-order b-tree traversal. 3. post-order b-tree traversal
Why stack pointer is 8-bit in microcontroller?
On 8-bit processors it is 16 bit, but in some processors (MosTek 65xx) the upper eight bit is constant 00000001.
Why are programme counter and stack pointer register 16 bit registers?
The program counter (PC) and stack pointer (SP) registers are 16-bit registers in the 8085 and in the 8086/8088 because that is how Intel designed the processors.
What is the time complexity of tree traversal?
The time complexity of tree traversal is O(n), where n is the number of nodes in the tree.
How much space did the Intel 8080 microprocessor have?
The stack size of Intel's 8085 microprocessor is theoretically 64 kb, but the real limit is a function of memory and program architecture and layout. The stack pointer is 16 bits, but that is not the same as stack size.
Write a sequence of instruction to exchange two register contents using stack in 8086 processor?
To exchange two registers, say the BX and CX registers, in the 8086 using the stack, you can use...PUSH BXPUSH CXPOP BXPOP CX... Of course, this is for 16 bit operation. If you want 8 bit operation, you will need to do more than that, because stack operations are always 16-bit operations.
What is the time complexity of binary tree traversal?
The time complexity of binary tree traversal is O(n), where n is the number of nodes in the tree.
