All categories

3 years ago

If I gain a rank and go under the points that the rank coust do I lose the rank

Computers and Technology

2 answers:

padilas [110]3 years ago

4 0

This is a good question, and I've wondered about that myself. I'm going to 'report' the question, not because there's anything wrong with it, but to bring it to the attention of the Moderators, so they can tell both of us.

Lana71 [14]3 years ago

4 0

That is a good question that I too once wondered. Based on my experience as a moderator, under normal circumstances, you can't lose your rank.

I can give an example of why that is so. I have the rank of "Ace". To be an Ace, 3,000 points and 15 best answers are required within the past thirty days, once I gain that rank, I cannot lose that. So this past month, after getting the Ace rank, I got less than 15 best answers, but I did not lose my rank. Likewise, with points, if you get less points than the minimum of your rank, you do not lose your points. Once you gain that rank, its permanent.

There are a few exceptions in which you may possibly lose your rank. But it is not possible if you are a normal, rule following user. The only time I have seen people lose their rank is if they get their account deleted. But do not worry. People only get their account deleted at the most extreme level (such as using profane language and spamming dozens of questions/answers) In which case, they do lose their rank, by deletion.

So based on what I said, do not be afraid. If you follow the rules, even asking dozens of questions that make you fall below the minimum amount to your rank, as long as you have at one point gotten that rank, you cannot lose that rank. I hoped that I answered your question to your preference.

Another note I want to make is that If you have any future questions involving Brainly whatsoever, do not hesitate to ask any of us Moderators. We are here to help.t rank

You might be interested in

A cell has an unlimited number of conditions for Conditional Formatting.<br> A.true<br> B.false

Mekhanik [1.2K]

I believe the answer is false.
I Hope this helps! :)
If you don't understand plz message me
If you do plz brainlest
Thank you!

7 0

3 years ago

Write a Python function that will accept as input three string values from a user. The method will return to the user a concaten

Aleks04 [339]

Answer:

Following are the program in python language

def cat_rev(x,y,z): # function definition

x=x[::-1]# reverse the first string

y=y[::-1]# reverse the second string

z=z[::-1]# reverse the third string

z=x+y+z; #concat the string

return(z)#return the string

#main method

s=input("Enter the first string:") #read the first string

r=input("Enter the second string:")#Read the second string

t=input("Enter the third string:")#Read the third string by user

rev1= cat_rev(s,r ,t ) #function calling

print(rev1)# display reverse string

Output:

Enter the first string:san

Enter the second string:ran

Enter the third string:tan

nasnarnat

Explanation:

Following are the description of program

In the main function we read the three value by the user in the "s", "r" and "t" variable respectively.

After that call the function cat_rev() by pass the variable s,r and t variable in that function .

Control moves to the function definition of the cat_rev() function .In this function we reverse the string one by one and concat the string by using + operator .

Finally in the main function we print the reverse of the concat string .

5 0

3 years ago

There will be 10 numbers stored contiguously in the computer at location x 7000 . Write a complete LC-3 program, starting at loc

Artist 52 [7]

Answer:

The LC-3 (Little Computer 3) is an ISA definition for a 16-bit computer. Its architecture includes physical memory mapped I/O via a keyboard and display; TRAPs to the operating system for handling service calls; conditional branches on N, Z, and P condition codes; a subroutine call/return mechanism; a minimal set of operation instructions (ADD, AND, and NOT); and various addressing modes for loads and stores (direct, indirect, Base+offset, PC-relative, and an immediate mode for loading effective addresses). Programs written in LC-3 assembler execute out of a 65536 word memory space. All references to memory, from loading instructions to loading and storing register values, pass through the get Mem Adr() function. The hardware/software function of Project 5 is to translate virtual addresses to physical addresses in a restricted memory space. The following is the default, pass-through, MMU code for all memory references by the LC-3 simulator.

unsigned short int get Mem Adr(int va, int rwFlg)

{

unsigned short int pa;

// Warning: Use of system calls that can cause context switches may result in address translation failure

// You should only need to use gittid() once which has already been called for you below. No other syscalls

// are necessary.

TCB* tcb = get TCB();

int task RPT = tcb [gettid()].RPT;

pa = va;

// turn off virtual addressing for system RAM

if (va < 0x3000) return &memory[va];

return &memory[pa];

} // end get MemAdr

Simple OS, Tasks, and the LC-3 Simulator

We introduce into our simple-os a new task that is an lc3 Task. An lc3 Task is a running LC-3 simulator that executes an LC-3 program loaded into the LC-3 memory. The memory for the LC-3 simulator, however, is a single global array. This single global array for memory means that alllc3 Tasks created by the shell use the same memory for their programs. As all LC-3 programs start at address 0x3000 in LC-3, each task overwrites another tasks LC-3 program when the scheduler swaps task. The LC-3 simulator (lc3 Task) invokes the SWAP command every several LC-3 instruction cycles. This swap invocation means the scheduler is going to be swapping LC-3 tasks before the tasks actually complete execution so over writing another LC-3 task's memory in the LC-3 simulator is not a good thing.

You are going to implement virtual memory for the LC-3 simulator so up to 32 LC-3 tasks can be active in the LC-3 simulator memory without corrupting each others data. To implement the virtual memory, we have routed all accesses to LC-3 memory through a get Mem Adr function that is the MMU for the LC-3 simulator. In essence, we now have a single LC-3 simulator with a single unified global memory array yet we provide multi-tasking in the simulator for up to 32 LC-3 programs running in their own private address space using virtual memory.

We are implementing a two level page table for the virtual memory in this programming task. A two level table relies on referring to two page tables both indexed by separate page numbers to complete an address translation from a virtual to a physical address. The first table is referred to as the root page table or RPT for short. The root page table is a fixed static table that always resides in memory. There is exactly one RPT per LC-3 task. Always.

The memory layout for the LC=3 simulator including the system (kernel) area that is always resident and non-paged (i.e., no virtual address translation).

The two figures try to illustrate the situation. The lower figure below demonstrates the use of the two level page table. The RPT resident in non-virtual memory is first referenced to get the address of the second level user page table or (UPT) for short. The right figure in purple and green illustrates the memory layout more precisely. Anything below the address 0x3000 is considered non-virtual. The address space is not paged. The memory in the region 0x2400 through 0x3000 is reserved for the RPTs for up to thirty-two LC-3 tasks. These tables are again always present in memory and are not paged. Accessing any RPT does not require any type of address translation.

The addresses that reside above 0x3000 require an address translation. The memory area is in the virtual address space of the program. This virtual address space means that a UPT belonging to any given task is accessed using a virtual address. You must use the RPT in the system memory to keep track of the correct physical address for the UPT location. Once you have the physical address of the UPT you can complete the address translation by finding the data frame and combining it with the page offset to arrive at your final absolute physical address.

A Two-level page table for virtual memory management.

x7000 123F x7000 0042

x7001 6534 x7001 6534

x7002 300F x7002 300F

x7003 4005 after the program is run, memory x7003 4005

x7004 3F19

7 0

3 years ago

Read 2 more answers

1. Which of the following is NOT an example of systems software? (Points : 1)

vladimir2022 [97]

The answer is "operating systems" brcause you need that that to use the rest
'

4 0

3 years ago

Read 2 more answers

Convert infix to postfix

kvv77 [185]

Answer:

static int checkSymbol(char ch)

{

switch (ch)

{

case '+':

case '-':

return 1;

case '*':

case '/':

return 2;

case '^':

return 3;

}

return -1;

}

static String convertInfixToPostfix(String expression)

{

String calculation = new String("");

Stack<Character> operands = new Stack<>();

Stack<Character> operators = new Stack<>();

for (int i = 0; i<expression.length(); ++i)

{

char c = expression.charAt(i);

if (Character.isLetterOrDigit(c))

operands.push(c);

else if (c == '(')

operators.push(c);

else if (c == ')')

{

while (!operators.isEmpty() && operators.peek() != '(')

operands.push(operators.pop());

if (!operators.isEmpty() && operators.peek() != '(')

return NULL;

else

operators.pop();

}

else

{

while (!operators.isEmpty() && checkSymbol(c) <= checkSymbol(operators.peek()))

operands.push(operators.pop());

operators.push(c);

}

while (!operators.isEmpty())

operands.push(operators.pop());

while (!operands.isEmpty())

calculation+=operands.pop();

calculation=calculation.reverse();

return calculation;

}

Explanation:

Create the checkSymbol function to see what symbol is being passed to the stack.
Create the convertInfixToPostfix function that keeps track of the operands and the operators stack.
Use conditional statements to check whether the character being passed is a letter, digit, symbol or a bracket.
While the operators is not empty, keep pushing the character to the operators stack.
At last reverse and return the calculation which has all the results.

4 0

3 years ago