Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
which structure can be used as a criterion for classification of data structures used in language processingand nature of a data structure purpose of
the turn-around time of a user job is theans total time taken to execute the job is called turn around
the term page traffic describesans page traffic describes the movement of pages in and out of
the scheduling in which cpu is allocated to the process with least cpu-burst time is calledans shortest job first scheduling wherein cpu is allocated
which scheduler selects processes from secondary storage deviceans medium term scheduler selects processes from secondary storage
interval between the time of submission and completion of the job isans turnaround time is the interval in between the time of submission and
shell is the exclusive feature ofans shell is the exclusive feature of
a program in execution is called ans when a program in execution is known as
which translator perform macro expansion is calledans macro pre-processor perform macro
symbolic names can be associated withans with data or instruction symbolic names
load address for the first word of the program is calledans load address origin is known as load address for the first word of the
analysis which determines the meaning of a statement once its grammatical structure becomes known is termed asans the meaning of a statement when its
translator for low level programming language were termed asans translator for low level programming language is called as
write a program to simulate searching over a hashed file with different assumptions for the sizeof file pageswrite a program to perform equality
write a program to create a hashed file that stores the records currently in the file data2013 records should use the same fixed-length schema given
consider the file search2013 this is a text file containingsearch key values each entry is a particular id in the schema given above you are
in a chained hash table each table entry is a pointer to a collection of elements it can be any collection that supports insert remove and find but
compare the basic cocomo model with the detailed cocomo modelcocomo having of a hierarchy of three increasingly detailed and accurate forms-
design of structure chart- standard quality structure charts result in programs that are modular reusable and simple to execute- measures
steps in building the structure chart1 recognize top level modules and decompose them into lower levels2 add control connections3 add couples4 review
types of structure chartstransaction structure - control module calls subordinate modules each of which handles a certain transactionmore afferent
building the structure chart- processes in the dfd tend to show single module on the structure chartafferent processes - give inputs to systemcentral
write a short note on structure chart structure chart is an significant program design method and it shows all components of code in a
explain cause effect graphing cause-effect graphing is a test case design method that gives a concise representation of logical conditions and
what can you say about the existence of a stationary point in the interval 1 3 for the function f x x 2 2x