This document contains a 25 question multiple choice exam on computer science topics. The questions cover a range of subjects including formal languages, automata theory, algorithms, computer architecture, operating systems, databases and more. For each question, students are instructed to select the most appropriate answer among 4 options (A, B, C or D) and mark their response on an answer sheet. The exam is divided into two sections, with the first section containing 25 one-mark questions and the second section containing 25 two-mark questions.
This document provides information about a GATE CS mock exam from 1999, including sample questions from sections A and B. It advertises a test preparation series offered by GATE Forum, providing full practice exams designed by IISc alumni. The questions cover topics like probability, algorithms, automata, databases, operating systems, and computer architecture. It encourages readers to join online discussion forums to review exam papers with other students preparing for GATE CS.
This document contains a 20 question multiple choice exam on topics in computer science such as algorithms, data structures, automata theory, and programming. Some example questions are about the number of states in a deterministic finite automaton for a specific language, properties of regular languages, time complexity of sorting algorithms, and topological ordering of directed acyclic graphs. The exam also contains a section matching scheduling algorithms to applications and classifying statements about threads as true or false.
The document provides instructions for a GATE exam. It states that the exam is 3 hours long and contains questions worth 1 or 2 marks. It provides details on how answers should be marked on the answer sheet, notes on calculators and rough work, and information that negative marks will be given for incorrect answers. The instructions emphasize accurately filling out identification details on the answer sheet and carefully reading the entire paper.
This document contains a past GATE exam paper from 1996. It provides 23 multiple choice questions in Section A that test concepts in computer science such as data structures, algorithms, automata theory, programming, operating systems, computer architecture, and discrete mathematics. It also advertises classroom test series conducted by GATE Forum to help students prepare for the GATE exam through mock tests and online discussion forums with IISc alumni.
This document contains a sample paper for the CS GATE exam from 2009. It includes 56 multiple choice questions worth 1 or 2 marks each. The questions cover topics such as computer organization, operating systems, algorithms, theory of computation, programming and data structures. An excerpt of the question paper is provided in the document for reference.
This document describes a GATE CS test paper from 1995 and provides information about joining mock test series and online discussion forums to prepare for the GATE exam. It includes 25 one-mark questions and 25 two-mark questions on topics related to computer science. Additional context is provided about the exam format and instructions for answering the objective response questions.
This document provides information about a GATE CS test paper from 2003 and discusses joining an All India Mock GATE Classroom Test Series conducted by GATE Forum. It includes sample questions from the 2003 GATE CS paper, covering topics like algorithms, data structures, automata theory, databases, computer networks, operating systems and more. 30 questions have one mark each and 60 questions have two marks each. The document encourages visiting the GATE Forum website for more details on joining their test series to help prepare for GATE.
This document contains a GATE exam question paper from 2000 with multiple choice questions in sections A and B testing knowledge of computer science topics. Section A contains 23 one-mark questions and section B contains 26 two-mark questions covering areas like algorithms, data structures, computer architecture, databases and more. The questions test understanding of concepts like binary trees, graphs, complexity analysis, regular expressions and more through matching, reasoning and problem solving questions.
This document provides information about a GATE CS mock exam from 1999, including sample questions from sections A and B. It advertises a test preparation series offered by GATE Forum, providing full practice exams designed by IISc alumni. The questions cover topics like probability, algorithms, automata, databases, operating systems, and computer architecture. It encourages readers to join online discussion forums to review exam papers with other students preparing for GATE CS.
This document contains a 20 question multiple choice exam on topics in computer science such as algorithms, data structures, automata theory, and programming. Some example questions are about the number of states in a deterministic finite automaton for a specific language, properties of regular languages, time complexity of sorting algorithms, and topological ordering of directed acyclic graphs. The exam also contains a section matching scheduling algorithms to applications and classifying statements about threads as true or false.
The document provides instructions for a GATE exam. It states that the exam is 3 hours long and contains questions worth 1 or 2 marks. It provides details on how answers should be marked on the answer sheet, notes on calculators and rough work, and information that negative marks will be given for incorrect answers. The instructions emphasize accurately filling out identification details on the answer sheet and carefully reading the entire paper.
This document contains a past GATE exam paper from 1996. It provides 23 multiple choice questions in Section A that test concepts in computer science such as data structures, algorithms, automata theory, programming, operating systems, computer architecture, and discrete mathematics. It also advertises classroom test series conducted by GATE Forum to help students prepare for the GATE exam through mock tests and online discussion forums with IISc alumni.
This document contains a sample paper for the CS GATE exam from 2009. It includes 56 multiple choice questions worth 1 or 2 marks each. The questions cover topics such as computer organization, operating systems, algorithms, theory of computation, programming and data structures. An excerpt of the question paper is provided in the document for reference.
This document describes a GATE CS test paper from 1995 and provides information about joining mock test series and online discussion forums to prepare for the GATE exam. It includes 25 one-mark questions and 25 two-mark questions on topics related to computer science. Additional context is provided about the exam format and instructions for answering the objective response questions.
This document provides information about a GATE CS test paper from 2003 and discusses joining an All India Mock GATE Classroom Test Series conducted by GATE Forum. It includes sample questions from the 2003 GATE CS paper, covering topics like algorithms, data structures, automata theory, databases, computer networks, operating systems and more. 30 questions have one mark each and 60 questions have two marks each. The document encourages visiting the GATE Forum website for more details on joining their test series to help prepare for GATE.
This document contains a GATE exam question paper from 2000 with multiple choice questions in sections A and B testing knowledge of computer science topics. Section A contains 23 one-mark questions and section B contains 26 two-mark questions covering areas like algorithms, data structures, computer architecture, databases and more. The questions test understanding of concepts like binary trees, graphs, complexity analysis, regular expressions and more through matching, reasoning and problem solving questions.
Gate 2013 computer science and information technology previous year paperLokesh Kataria
The document provides instructions for a computer science and information technology exam. It details that the exam is 3 hours, contains 65 multiple choice questions worth 100 marks, and includes sections on computer science and general aptitude. Instructions are provided on filling out the optical response sheet, types of questions, marking scheme, and materials allowed.
The document contains 37 multiple choice questions related to computer science topics such as Boolean logic, data structures, algorithms, computer architecture, operating systems, and computer networks. The questions cover a wide range of fundamental concepts and require applying core CS principles to analyze problems and choose the best answer.
The document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, automata theory, computer architecture, operating systems and more. Sample questions include properties of finite state automata and pushdown automata, complexity analysis of graph algorithms, cache hierarchies, pipelining and more.
This document provides information about an online test preparation forum for the GATE exam. It advertises classroom mock tests in 25 cities across India, designed by IISc alumni. It also details online discussion forums and other resources for students. The document then provides a sample test paper containing 35 single-choice questions and 20 multi-choice questions covering topics in computer science like algorithms, data structures, automata theory and computer architecture.
This document contains a sample question paper for the CS GATE exam from 2010. It has 55 questions worth 1 or 2 marks each. The questions cover topics like graphs, algorithms, data structures, computer architecture, theory of computation and programming in C.
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
This document provides information about a GATE CS test paper from 2000. It includes 23 single-mark questions covering topics like arrays, matrices, data structures, algorithms, computer architecture, programming languages and databases. It also includes 26 two-mark questions on additional topics like logic, automata theory, complexity, probability, relations and Boolean algebra. The document encourages joining mock test series and online discussion forums to prepare for the GATE exam.
AP PGECET Computer Science 2016 question paperEneutron
This document contains instructions for a 120-minute, 120-question multiple choice exam with 4 answer choices for each question. It states that each question carries 1 mark and there are no penalties for wrong answers. The booklet contains 16 pages and students should notify the invigilator of any issues. Answers must be marked on the provided OMR answer sheet using a blue or black pen.
This document contains the text of the GATE CS exam from 1992. It includes 20 multiple choice questions and 9 short answer/essay questions covering topics in computer science such as computer architecture, algorithms, theory of computation and data structures. It also provides information about joining an online test preparation community that offers full length and section mock exams designed by IISc alumni to help students prepare for the GATE exam.
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
This document discusses the implementation of digital filters in fixed-point arithmetic on embedded systems. It presents the need for methodology and tools to design fixed-point embedded filter systems. The key steps are: 1) choosing a filter algorithm, 2) rounding coefficients to fixed-point, and 3) implementing the algorithm. Optimal implementations minimize degradation from quantization errors while meeting resource constraints. The document outlines a global flow from filter design to code generation and optimization.
This document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, logic, automata theory and databases. Sample questions ask about the minimum number of multiplications needed to evaluate a polynomial, the expected value of the smallest number in a random sample, and the recovery procedure after a database system crash during transaction logging.
This document discusses formatting bits to better implement signal processing algorithms with integer arithmetic. It begins by introducing the context and objectives, which is to develop a methodology and tools to implement embedded filter algorithms using only integer arithmetic while controlling errors. It then discusses fixed-point arithmetic and how filters can be implemented using sum-of-products operations. The objective is given a bound on the final error, to find an implementation that reduces bit usage while controlling output error. The document proposes a two-step bit formatting method that first formats the most significant bits using Jackson's rule, then determines the minimum number of least significant bits that need to be kept to ensure faithful rounding of the final result.
Ec2203 digital electronics questions anna university by www.annaunivedu.organnaunivedu
EC2203 Digital Electronics Anna University Important Questions for 3rd Semester ECE , EC2203 Digital Electronics Important Questions, 3rd Sem Question papers,
http://www.annaunivedu.org/digital-electronics-ec-2203-previous-year-question-paper-for-3rd-sem-ece-anna-univ-question/
20101017 program analysis_for_security_livshits_lecture02_compilersComputer Science Club
This document provides an introduction and overview of compiler optimization techniques, including:
1) Flow graphs, constant folding, global common subexpressions, induction variables, and reduction in strength.
2) Data-flow analysis basics like reaching definitions, gen/kill frameworks, and solving data-flow equations iteratively.
3) Pointer analysis using Andersen's formulation to model references between local variables and heap objects. Rules are provided to represent points-to relationships.
The document provides a sample question paper for Class XII Informatics Practices exam. It includes a blueprint showing the distribution of questions by topic, type and marks. It also includes a sample paper with 7 sections consisting of short answer and long answer questions related to networking, programming, databases, IT applications and object oriented programming. The marking scheme for the sample questions is also provided.
CAPE Computer Science Unit 1 Paper 1 - Practice PaperAlex Stewart
This document provides a practice exam for the Caribbean Examinations Council Advanced Proficiency Examination in Computer Science. The exam covers fundamentals of computer science, including programming constructs like loops and functions, generations of programming languages, and basic computer hardware concepts. It consists of 45 multiple choice questions testing these core CS topics.
This document provides information about a GATE CS test from 2001 and discusses joining an All India Mock GATE classroom test series conducted by GATE Forum. It includes sample questions from Section A of the 2001 GATE CS test paper with one-mark multiple choice sub-questions on topics like matrices, logic, automata theory, algorithms, databases and operating systems.
This document appears to be a study guide for the GATE CS exam from 2002. It provides 25 one-mark questions in Section A and 25 two-mark questions in Section B on topics related to computer science. The questions cover areas such as algorithms, data structures, computer architecture, programming languages, theory of computation and operating systems. Fifteen of the two-mark questions from Section B need to be answered on the provided answer book.
Gate 2013 computer science and information technology previous year paperLokesh Kataria
The document provides instructions for a computer science and information technology exam. It details that the exam is 3 hours, contains 65 multiple choice questions worth 100 marks, and includes sections on computer science and general aptitude. Instructions are provided on filling out the optical response sheet, types of questions, marking scheme, and materials allowed.
The document contains 37 multiple choice questions related to computer science topics such as Boolean logic, data structures, algorithms, computer architecture, operating systems, and computer networks. The questions cover a wide range of fundamental concepts and require applying core CS principles to analyze problems and choose the best answer.
The document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, automata theory, computer architecture, operating systems and more. Sample questions include properties of finite state automata and pushdown automata, complexity analysis of graph algorithms, cache hierarchies, pipelining and more.
This document provides information about an online test preparation forum for the GATE exam. It advertises classroom mock tests in 25 cities across India, designed by IISc alumni. It also details online discussion forums and other resources for students. The document then provides a sample test paper containing 35 single-choice questions and 20 multi-choice questions covering topics in computer science like algorithms, data structures, automata theory and computer architecture.
This document contains a sample question paper for the CS GATE exam from 2010. It has 55 questions worth 1 or 2 marks each. The questions cover topics like graphs, algorithms, data structures, computer architecture, theory of computation and programming in C.
This document contains a 25 question multiple choice test on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, computer architecture, operating systems, databases, networks, and formal languages. The test asks the examinee to choose the best answer from among 4 options for each question. It also provides 2 mark questions in the later part testing more comprehensive understanding.
This document provides information about a GATE CS test paper from 2000. It includes 23 single-mark questions covering topics like arrays, matrices, data structures, algorithms, computer architecture, programming languages and databases. It also includes 26 two-mark questions on additional topics like logic, automata theory, complexity, probability, relations and Boolean algebra. The document encourages joining mock test series and online discussion forums to prepare for the GATE exam.
AP PGECET Computer Science 2016 question paperEneutron
This document contains instructions for a 120-minute, 120-question multiple choice exam with 4 answer choices for each question. It states that each question carries 1 mark and there are no penalties for wrong answers. The booklet contains 16 pages and students should notify the invigilator of any issues. Answers must be marked on the provided OMR answer sheet using a blue or black pen.
This document contains the text of the GATE CS exam from 1992. It includes 20 multiple choice questions and 9 short answer/essay questions covering topics in computer science such as computer architecture, algorithms, theory of computation and data structures. It also provides information about joining an online test preparation community that offers full length and section mock exams designed by IISc alumni to help students prepare for the GATE exam.
This document contains a set of multiple choice questions and answers related to data structures. There are 56 questions covering topics like hashing, graphs, trees, sorting algorithms, linked lists, stacks, queues, arrays, and more. The questions test knowledge of concepts like time complexity, operations on different data structures, representations of data like matrices and graphs, and algorithms that use common data structures.
This document discusses the implementation of digital filters in fixed-point arithmetic on embedded systems. It presents the need for methodology and tools to design fixed-point embedded filter systems. The key steps are: 1) choosing a filter algorithm, 2) rounding coefficients to fixed-point, and 3) implementing the algorithm. Optimal implementations minimize degradation from quantization errors while meeting resource constraints. The document outlines a global flow from filter design to code generation and optimization.
This document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, complexity analysis, logic, automata theory and databases. Sample questions ask about the minimum number of multiplications needed to evaluate a polynomial, the expected value of the smallest number in a random sample, and the recovery procedure after a database system crash during transaction logging.
This document discusses formatting bits to better implement signal processing algorithms with integer arithmetic. It begins by introducing the context and objectives, which is to develop a methodology and tools to implement embedded filter algorithms using only integer arithmetic while controlling errors. It then discusses fixed-point arithmetic and how filters can be implemented using sum-of-products operations. The objective is given a bound on the final error, to find an implementation that reduces bit usage while controlling output error. The document proposes a two-step bit formatting method that first formats the most significant bits using Jackson's rule, then determines the minimum number of least significant bits that need to be kept to ensure faithful rounding of the final result.
Ec2203 digital electronics questions anna university by www.annaunivedu.organnaunivedu
EC2203 Digital Electronics Anna University Important Questions for 3rd Semester ECE , EC2203 Digital Electronics Important Questions, 3rd Sem Question papers,
http://www.annaunivedu.org/digital-electronics-ec-2203-previous-year-question-paper-for-3rd-sem-ece-anna-univ-question/
20101017 program analysis_for_security_livshits_lecture02_compilersComputer Science Club
This document provides an introduction and overview of compiler optimization techniques, including:
1) Flow graphs, constant folding, global common subexpressions, induction variables, and reduction in strength.
2) Data-flow analysis basics like reaching definitions, gen/kill frameworks, and solving data-flow equations iteratively.
3) Pointer analysis using Andersen's formulation to model references between local variables and heap objects. Rules are provided to represent points-to relationships.
The document provides a sample question paper for Class XII Informatics Practices exam. It includes a blueprint showing the distribution of questions by topic, type and marks. It also includes a sample paper with 7 sections consisting of short answer and long answer questions related to networking, programming, databases, IT applications and object oriented programming. The marking scheme for the sample questions is also provided.
CAPE Computer Science Unit 1 Paper 1 - Practice PaperAlex Stewart
This document provides a practice exam for the Caribbean Examinations Council Advanced Proficiency Examination in Computer Science. The exam covers fundamentals of computer science, including programming constructs like loops and functions, generations of programming languages, and basic computer hardware concepts. It consists of 45 multiple choice questions testing these core CS topics.
This document provides information about a GATE CS test from 2001 and discusses joining an All India Mock GATE classroom test series conducted by GATE Forum. It includes sample questions from Section A of the 2001 GATE CS test paper with one-mark multiple choice sub-questions on topics like matrices, logic, automata theory, algorithms, databases and operating systems.
This document appears to be a study guide for the GATE CS exam from 2002. It provides 25 one-mark questions in Section A and 25 two-mark questions in Section B on topics related to computer science. The questions cover areas such as algorithms, data structures, computer architecture, programming languages, theory of computation and operating systems. Fifteen of the two-mark questions from Section B need to be answered on the provided answer book.
This document contains information about a GATE CS test paper from 1995, including sample questions from sections A and B. It also provides information about GATE Forum, which conducts mock GATE tests and online discussion forums to help students prepare for GATE. The document encourages thinking about GATE and considering GATE Forum as a resource.
The document contains a 20 question multiple choice quiz on computer science topics. The questions cover areas like algorithms, data structures, automata theory, computer architecture, operating systems and more. Sample questions include properties of finite state automata and pushdown automata, complexity analysis of graph algorithms, cache hierarchies, pipelining and more.
1) The document contains a sample question paper for the GATE 2018 General Aptitude exam, with 10 multiple choice questions covering topics like English grammar, mathematics, data interpretation, and logical reasoning.
2) The questions are either single mark or two mark questions.
3) The paper tests concepts like filling blanks in sentences, number patterns, ratios, data interpretation, and logical inferences.
The document contains questions and answers related to binary search trees and graphs. It discusses finding the minimum element in a binary search tree, different tree traversals like preorder, inorder and postorder, properties of binary search trees like the increasing order of inorder traversal and complexity, balance factors of binary trees, cut vertices in graphs, and properties of complete graphs.
The document contains 10 questions for a DBMS quiz. The questions cover topics such as database concepts like tables, records, columns, keys; schema, relations, attributes; ER diagrams; SQL commands like CREATE, SELECT, UPDATE, ALTER; functional dependencies and normalization up to BCNF; concurrency control methods like locking, timestamps; and transaction management concepts like serialization, recoverability.
The document appears to be a test paper containing multiple choice questions about C, C++ language concepts. There are 43 questions testing knowledge of topics like C language syntax, data types, operators, loops, functions, pointers, arrays and structures. The questions have a single correct answer among 4 options for each.
The document provides instructions for a post graduate common entrance test for computer science engineering. It specifies the date, time, duration, and format of the test. Candidates are instructed to fill in personal details like registration number, question booklet code and serial number on the answer sheet. They are also provided instructions on how to answer questions within the given time limit, as well as guidelines for proper marking of responses. The test contains 2 parts - part 1 has 50 one-mark questions and part 2 has 25 two-mark questions.
This document contains a GATE exam paper from 1994. It has two sections - Section A with 8 multiple choice questions and Section B with 20 questions where the test taker must answer 10. The questions cover topics in computer science including algorithms, data structures, automata theory, databases, computer architecture and electronics.
The document contains a set of 45 multiple choice questions related to mathematical sciences topics like machine language, computer hardware, programming languages, matrices, probability, statistics, and linear algebra. The questions cover concepts such as eigenvectors, probability density functions, integration techniques, random variables, estimators, and congruences.
The exam will be closed book and notes. It will contain 15 problems: 10 multiple choice and 5 written. A sheet with Boolean theorems will be provided. Students can bring one information sheet (front side only) with additional notes to refer to during the exam. Sample problems included multiple choice questions testing understanding of Boolean algebra concepts like rewriting functions in SOP form, identifying false Boolean expressions, and determining equivalences between functions. Written questions may involve drawing circuit implementations or writing VHDL code.
I am Gozan. M. I am a Programming Exam Helper at liveexamhelper.com. I hold a master' Degree in Programming from the University of Denver, USA. I have been helping students with their exams for the past 9 years. You can hire me to take your exam in Programming. Visit liveexamhelper.com or email info@liveexamhelper.com. You can also call on +1 678 648 4277 for any assistance with the Programming Exam.
The document provides instructions for a computer science exam. It states that the exam contains 65 multiple choice questions worth a total of 100 marks. Questions 1-25 are worth 1 mark each, questions 26-55 are worth 2 marks each, and questions 56-65 are worth either 1 or 2 marks depending on the question. The instructions specify how to fill out the answer sheet and provide details on scoring, including deductions for incorrect answers.
1. The document contains 25 multiple choice questions in Section A of a mechanical engineering exam. It tests knowledge of topics including matrices, fluid mechanics, thermodynamics, heat transfer, and more.
2. It also contains 25 additional multiple choice questions testing further mechanical engineering topics. These questions cover areas such as dynamics, differential equations, stress analysis, and aerodynamics.
3. The examinee is asked to answer each question by selecting one or more correct answer choices and writing the corresponding letter(s) in the answer column. This examines their understanding of fundamental mechanical engineering concepts.
important DotNet Questions For Practicals And InterviewsRahul Jain
Deployment refers to distributing an application to end users. .NET Framework 4.0 supports several deployment methods including Windows Installer, ClickOnce, XCOPY, copying a web site, and publishing a web site. XCOPY enables deploying an application by copying files to a target computer without impacting the system. Windows Installer creates an .msi package that can be distributed and installed using an installation wizard. ClickOnce allows deploying and updating applications by publishing to a web location. Deploying creates a setup file while publishing directly installs from a web location.
The Global Positioning System (GPS) consists of three segments: the Control Segment, Space Segment, and User Segment. The Control Segment includes a Master Control Station and monitor stations that track GPS satellites and relay data to satellites. The Space Segment contains 24 active GPS satellites that transmit positioning signals. The User Segment comprises any device that receives and uses GPS satellite signals to determine its location.
The document introduces the Global Positioning System (GPS) by providing a brief history and overview of its key segments and functioning. It discusses how GPS works by using timing signals from satellites to calculate a receiver's location. Issues like accuracy problems caused by factors like selective availability and satellite geometry are also examined. The document then explores advancements like differential GPS and the Wide Area Augmentation System for improving precision.
Blogging PPT For More Follow On rahuljaincse.blogspot.inRahul Jain
The document provides tips and strategies for effective blogging, including defining the audience and conversation, planning content like stories and a calendar, sharing content through tools like Storify, building a blog community by engaging others, and measuring results with analytics. The goal is to create a year-round kitchen table conversation space around compelling camp stories and themes.
This document contains a GATE study material question paper with 30 single mark questions and 2 two-mark questions on computer science topics. The questions cover concepts like structured programming, data structures, algorithms, computer architecture, operating systems, databases, computer networks and logic. The document also provides information about a website that offers GATE preparation material, forums and downloads.
The document discusses HTML (Hypertext Markup Language), which is used to define the structure and layout of web pages. HTML uses tags to annotate text and other content for display in a web browser. Some key points covered include:
- HTML is a markup language that uses tags to describe document content and structure
- Web browsers are used to read HTML documents and display them as visible or audible web pages
- Common HTML tags include headings, paragraphs, and attributes that customize elements' behavior
- HTML documents can be written and edited in any basic text editor
The document discusses HTML (Hypertext Markup Language), which is used to define the structure and layout of web pages. HTML uses tags to annotate text and other content for display in a web browser. Some key points covered include:
- HTML is a markup language that uses tags like <h1> and <p> to structure headings, paragraphs, and other elements.
- Web browsers are used to display HTML documents on different platforms like Windows, Linux, and Mac.
- HTML documents can be written using any basic text editor and involve writing opening and closing tags around content.
- Common HTML tags were demonstrated like <h1> for main headings and <p> for paragraphs.
The document discusses HTML (Hypertext Markup Language), which is used to describe web pages. HTML uses tags to mark elements like headings, paragraphs, and other content. It is a markup language that allows web browsers to display pages. HTML documents can be created using any basic text editor. Common tags include <h1> for main headings and <p> for paragraphs. Attributes provide extra information for tags, like aligning paragraphs left or right.
The document discusses the concepts and goals of interviews, including obtaining information about a job and organization, determining suitability, and communicating qualifications. It outlines preparation steps like researching the organization and job, anticipating questions, and practicing skills. Interview types can vary based on purpose, format, and style. The goals of interviews are to attract the best candidates, gather information, assess qualifications, and determine fit with the organization.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
The Python for beginners. This is an advance computer language.
Gate Previous Years Papers
1. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
GATE CS - 2001
SECTION - A
1. This question consists of TWENTY-FIVE sub-questions (1.1 — 1.25) of ONE mark each. For
each of these sub-questions, four possible alternatives, A, B, C and D are provided. Choose
the most appropriate alternative and darken its bubble on the Objective Response Sheet
(ORS) against the corresponding sub-question number using a soft HB pencil. Do not darken
more than one bubble for any sub-question. Do not use the ORS for any rough work. You may
use the answer book for any rough work, if needed.
1.1 Consider the following statements:
S1: The sum of two singular n x n matrices may be non-singular
S2: The sum of two n x n non-singular matrices may be singular.
Which of the following statements is correct?
(a) 51 and S2 are both true
(b) 51 is true, S2 is false
(c) 51 is false, S2 is true
(d) 51 and S2 are both false
1.2 Consider the following relations:
Ri (a,b) iff (a+b) is even over the set of integers
R2 (a,b) iff (a+b) is odd over the set of integers
R3 (a,b) iff a.b > 0 over the set of non-zero rational numbers
R4 (a,b) iff a — bi 2 over the set of natural numbers
Which of the following statements is correct?
(a) Ri and R2 are equivalence relations, R3 and R4 are not
(b) Ri and R3 are equivalence relations, R2 and R4 are not
(c) Ri and R4 are equivalence relations, R2 and R3 are not
(d) Ri, R2, R3 and R4 are all equivalence relations
1.3 Consider two well-formed formulas in prepositional logic
El: P —iP E2: (Pi—iP)v(--iPiP)
Which of the following statements is correct?
(a) Fl is satisfiable, F2 is valid
(b) Fl unsatisfiable, F2 is satisfiable
(c) Fl is unsatisfiable, F2 is valid
(d) Fl and F2 are both satisfiable
1.4 consider the following two statements:
S1: {o2’Hn (- i)isa regular language
S2: {ominom÷n rn 1 and n i} is a regular language
Which of the following statements is correct?
(a) Only Si is correct
(b) Only S2 is correct
(c) Both Si and S2 are correct
(d) None of Si and S2 is correct
1.5 Which of the following statements s true?
(a) If a language is context free it can always be accepted by a deterministic push-down
automaton
(b) The union of two context free languages is context free
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
2. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
(c) The intersection of two context free languages is context free
(d) The complement of a context free language is context free
1.6 Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum
number of states in an equivalent minimized DFA is at least
(a) N2
(b) 2N
(c) 2N
(d) N!
1.7 More than one word are put in one cache block to
(a) exploit the temporal locality of reference in a program
(b) exploit the spatial locality of reference in a program
(c) reduce the miss penalty
(d) none of the above
1.8 Which of the following statements is false?
(a) Virtual memory implements the translation of a program’s address space into physical
memory address space
(b) Virtual memory allows each program to exceed the size of the primary memory
(c) Virtual memory increases the degree of multiprogramming
(d) Virtual memory reduces the context switching overhead
1.9 A low memory can be connected to 8085 by using
(a) INTER
(b) RESET IN
(c) HOLD
(d) READY
1.10 Suppose a processor does not have any stack pointer register. Which of the following
statements is true?
(a) It cannot have subroutine call instruction
(b) It can have subroutine call instruction, but no nested subroutine calls
(c) Nested subroutine calls are possible, but interrupts are not
(d) All sequences of subroutine calls and also interrupts are possible
1.11 Given the following Karnaugh map, which one of the following represents the minimal
Sum-Of-Products of the map?
(a) xy+y’z
(b) wx’y’+xy+xz
(c) w’x+y’z+xy
(d)xz+y
1.12 A processor needs software interrupt to
(a) test the interrupt system of the processor
(b) implement co-routines
(c) obtain system services which need execution of privileged instructions
(d) return from subroutine
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
3. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
1.13 A CPU has two modes-privileged and non-privileged. In order to change the mode from
privileged to non-privileged
(a) a hardware interrupt is needed
(b) a software interrupt is needed
(c) a privileged instruction (which does not generate an interrupt) is needed
(d) a non-privileged instruction (which does not generate an interrupt is needed
1.14 Randomized quicksort is an extension of quicksort where the pivot is chosen randomly.
What is the worst case complexity of sorting n numbers using randomized quicksort?
(a) 0(n)
(b) 0(n log n)
(c) 0(n2)
(d) 0(n!)
1.15 Consider any array representation of an n element binary heap where the elements are
stored from index 1 to index n of the array. For the element stored at index i of the array (I (-
n), the index of the parent is (1+1)
(a) i-i
(b) L]
(c) r.i
(d) 2
Nwx
YZ
00 01 11 10
00 0 X 0 X
01 X 1 X 1
11 0 X 1 0
10 0 1 X 0
1.16 Let f(n) = n2 logn and g(n) = n(logn)1° be two positive functions of n. Which of
the following statements is correct?
(a) f(n) = O(g(n) and g(n) O(f(n))
(b) g(n) = O(f(n) and f(n) O(g(n))
(c) f(n)=O(g(n)) and g(n) O(f(n))
(d) f(n)=O(g(n)) and g(n) =O(f(n))
1.17 The process of assigning load addresses to the various parts of the program and
adjusting the code and date in the program to reflect the assigned addresses is
called
(a) Assembly
(b) Parsing
(c) Relocation
(d) Symbol resolution
1.18 Which of the following statements is false?
(a) An unambiguous grammar has same leftmost and rightmost derivation
(b) An LL(1) parser is a top-down parser
(c) LALR is more powerful than SLR
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
4. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
(d) An ambiguous grammar can never be LR(k) for any k
1.19 Consider a set of n tasks with known runtimes r1, r2, .... r to be run on a uniprocessor
machine. Which of the following processor scheduling algorithms will result in the maximum
throughput?
(a) Round-Robin
(b) Shortest-Job-First
(c) Highest-Response-Ratio-Next
(d) First-Come-First-Served
1.20 Where does the swap space reside?
(a) RAM
(b) Disk
(c) ROM
(d) On-chip cache
1.21 Consider a virtual memory system with FIFO page replacement policy. For an arbitrary
page access pattern, increasing the number of page frames in main memory will
(a) always decrease the number of page faults
(b) always increase the number of page faults
(c) sometimes increase the number of page faults
(d) never affect the number of page faults
1.22 Which of the following requires a device driver?
(a) Register
(b) Cache
(c) Main memory
(d) Disk
1.23 Consider a schema R(A,B,C,D) and functional dependencies A - B and C - D. Then the
decomposition of R into R1 (AB) and R2(CD) is
(a) dependency preserving and lossless join
(b) lossless join but not dependency preserving
(c) dependency preserving but not lossless join
(d) not dependency preserving and not lossless join
1.24 Suppose the adjacency relation of vertices in a graph is represented in a table
Adj (X,Y). Which of the following queries cannot be expressed by a relational
algebra expression of constant length?
(a) List of all vertices adjacent to a given vertex
(b) List all vertices which have self loops
(c) List all vertices which belong to cycles of less than three vertices
(d) List all vertices reachable from a given vertex
1.25 Let r and s be two relations over the relation schemes R and S respectively, and
let A be an attribute in R. then the relational algebra expression 0Aa (rXJ 5) is
always equal to
(a) oA_a(r)
(b) r
(c) 0Aa (r)N s
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
5. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
(d) None of the above
2. This question consists of TWENTY-FIVE sub-questions (2.1 — 2.25) of TWO marks each. For
each of these sub-questions, four possible alternatives, A,B, C and D are provided. Choose the
most appropriate alternative and darken its bubble on the Objective Response Sheet (ORS)
against the corresponding sub-question number using a soft HB pencil. Do not darken more
than one bubble for any sub-question. Do not use the CR5 for any rough work. You may use
the answer book for any rough work, if needed.
2.1 How many 4-digit even numbers have all 4 digits distinct?
(a) 2240
(b) 2296
(c) 2620
(d) 4536
2.2 Consider the following statements:
S1: There exists infinite sets A, B, C such that An(BuC) is finite.
S2: There exists two irrational numbers x and y such that (x+y) is rational.
Which of the following is true about 51 and S2?
(a) Only 51 is correct
(b) Only S2 is correct
(c) Both 51 and S2 are correct
(d) None of 51 and S2 is correct
2.3 Let f: A - B be a function, and let E and F be subsets of A. Consider the following
statements about images.
Si:f(EuF)=f(E) uf(F)
S2:f(EnF)=f(E) nf(F)
Which of the following is true about Si and S2?
(a) Only Si is correct
(b) Only S2 is correct
(c) Both Si and S2 are correct
(d) None of Si and S2 is correct
2.4 Consider a DFA over ={a,b}accepting all strings which have number of a’s divisible by 6
and number of b’s divisible by 8. What is the minimum number of states that the DFA will
have?
(a) 8
(b) 14
(c) 15
(d) 48
2.5 Consider the following languages:
Li ={wwwE {a,b}*}
L2 = {wwR w {a, b}*, wR is the reverse of w}
L3 = {021 i is an integer)
= {o2 i is an integer)
Which of the languages are regular?
(a) Only Li and L2
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
6. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
(b) Only L2, L3 and L4
(c) Only L3 and L4
(d) Only L3
2.6 Consider the following problem X.
Given a Turing machine M over the input alphabet , any state q of M
And a word w E*, does the computation of M on w visit the state q?
Which of the following statements about X is correct?
(a) X is decidable
(b) X is undecidable but partially decidable
(c) X is undecidable and not even partially decidable
(d) X is not a decision problem
2.7 Which is the most appropriate match for the items in the first column with the items in the
second column
X. Indirect Addressing I. Array implementation
Y. Indexed Addressing II. Writing re-locatable code
Z. Base Register Addressing III. Passing array as parameter
(a) (X, III) (Y, I) (Z, II)
(b) (X, II) (Y, III) (Z, I)
(c) (X, III) (Y, II) (Z, I)
(d) (X, I) (Y, III) (Z, II)
2.8 The 2’s complement representation of is hexadecimal is
(a) ABE (b) DBC (c) DE5 (d) 9E7
2.9 Consider the circuit given below1th initial state Qo =1, Q = Q2 = 0. The state of the circuit
is given by the value 4Q2 + 2Q1 + Q0 -
Clock
Which one of the following is the correct state sequence of the circuit?
(a) 1,3,4,6,7,5,2
(b) 1,2,5,3,7,6,4
(c) 1,2,7,3,5,6,4
(d) 1,6,5,7,2,3,4
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
7. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
2.10 Consider the following data path of a simple non-pilelined CPU. The registers A, B, A1,
A2, MDR, the bus and the ALU are 8-bit wide. SP and MAR are 16-bit registers. The MUX is of
size 8 x (2:1) and the DEMUX is of size 8 x (1:2). Each memory operation takes 2 CPU clock
cycles and uses MAR (Memory Address Register) and MDR (Memory Date Register). SP can be
decremented locally.
How many CPU clock cycles are needed to execute the “push r” instruction?
(a) 2
(b) 3
(c) 4
(d) 5
2.11 Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done
starting from a node r. Let d(r,u) and d(r,v) be the lengths of the shortest paths from r to u
and v respectively in G. If u is visited before v during the breadth-first traversal, which of the
following statements is correct?
(a) d(r,u)<d(r,v)
(b) d(r,u)>d(r,v)
(c) d(r,u)<d(r,v)
(d) None of the above
2.12 How many undirected graphs (not necessarily connected) can be constructed out of a
given set V = {vi,v2,...v1of n vertices? n (n —1) }
(a) 2
(b) 2
2.13 What is the minimum number of stacks of size n required to implement a queue of size
n?
(a) One
(b) Two
(c) Three
(d) Four
2.14 What is printed by the print statements in the program P1 assuming call by reference
parameter passing?
Program P1Q
{
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
8. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
x=1O;
y= 3;
fu nc 1 (y,x,x);
print x;
print y;
}
funcl(x,y,z)
{
y=y+4;
z=x+y+z;
}
(a) 10, 3
(b) 31, 3
(c) 27, 7
(d) None of the above
2.15 Consider the following three Cfunctibns:
[P1] int*g(void)
{
intx=10;
return(&x);
}
[P2] int*g(void)
{
int*px;
*p= 10;
return px;
}
[P3] int*g(void)
{
int*px
px =(int*)malloc (size of (int));
*p= 10;
return px;
}
Which of the above three functions are likely to cause problems with pointers?
(a) Only P3 (b) Only P1 and P3
(c) Only P1 and P2 (d) P1, P2 and P3
2.16 Consider the following program
Program P2
var n:int:
procedure W(var x:int)
begin
x=x+1;
pri ntx;
end
procedure D
begin
var n:int;
n=3;
W(n);
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
9. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
End
begin begin P2
n = 10;
D;
end
If the language has dynamic scooping and parameters are passed by reference,
what will be printed by the program?
(a) 10
(b) 11
(c) 3
(d) None of the above
2.17 Which of the following does not interrupt a running process?
(a) A device
(b) Timer
(c) Scheduler process
(d) Power failure
2.18 Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If
the page size is 4KB, what is the approximate size of the page table?
(a) 16 MB
(b) 8 MB
(c) 2 MB
(d) 24 MB
2.19 Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i
and j. The program executed by process is shown below.
repeat
flag[i] =true;
turn=j;
while (P) do no—op;
Enter critical section, perform actions, then
exit critical section
Flag[i] =false;
Perform other non—critical section actions. Until false;
For the program to guarantee mutual exclusion, the predicate P in the while loop
should be
(a) flag[j]=true and turn=i
(b) flag[j]=true and turn=j
(c) flag[i]=true and turn=j
(d) flag[i]=true and turn=i
2.20 R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency
preserving BCNF decomposition?
(a)A-B,B-CD
(b)A-B,B-C,C-D
(c) AB - C, C - AD
(d) A - BCD
2.21 Which of the following relational calculus expressions is not safe?
(a) {tu R (t[A1 = u[A1)A -s E R2 (t[A1 = s[A1)J
(b) {tfru E R1 (u[A1 = R (t[A1 = s[A1 A s[A1 = u[A1))}
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
10. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
(c) {t—i(tE R1)}
(d) {tuE R1 (t[A1 = ULA1)ASE R2 (t[A1 = s[A1)}
2.22 Consider a relation geq which represents “greater than or equal to”, that is, (x,y)E geq
only if y<x.
create table geq
( lb integer not null
ub integer not null
primary key lb
foreign key (ub) references geq on delete cascade )
Which of the following is possible if a tuple (x,y) is deleted?
(a) A tuple (z,w) with z > y is deleted
(b) A tuple (z,w) with z > x is deleted
(C) A tuple (z,w) with w < x is deleted
(d) The deletion of (x,y) is prohibited
SECTION B
This section consists of TWENTY questions of FIVE marks each. Any FIFTEEN out of
these questions have to be answered on the Answer Book provided.
1. (a) prove that powerset (A n B) = powerset(A)npowerset(B)
(b) Let sum(n)=O+1+2+ +n for all natural numbers n. give an induction proof to show that
the following equation is true for all natural numbers m and n:
sum(m+n)=sum(m)+sum(n)+mn
2. Consider the function h: NxN - N so that h (a,b) = (2a+1)2’’ —1,where N ={O,1,2,3, } is
the set of natural numbers.
(a) Prove that the function h is an injection (one-one).
(b) Prove that it is also a Subjection (onto)
3. Construct DFA’s for the following languages:
(a) L ={wwE {a,b}*, w has baab as a subsring)
(b) L ={wwE {a,b}*, w has an odd number of a’s and an odd nuber of b’s)
4. Give a deterministic PDA for the language L = {acb2 fl (- 1) over the alphabet = = {a, b,
c}. Specify the acceptance state.
5. Let a decision problem X be defined as follows:
X: Given a Turing machine M over and nay word w E does M loop forever on w?
You may assume that the halting problem of Turing machine is undecidable but partially
decidable.
(a) Show that X is undecidable.
(b) Show that X is not even partially decidable.
6. Consider a disk with following specifications: 20 surface, 1000 tracks/surface, 16
sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system
initiates the transfer between the disk and the memory sector-wise. Once the head has been
placed on the right track, the disk reads a sector in a single scan. It reads bits from the sector
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
11. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
while the head is passing over the sector. The read bits are formed into bytes in a serial-in-
parallel-out buffer and each byte is then transferred to memory. The disk writing is exactly a
complementary process.
For parts (c) and (d) below, assume memory read-write time = 0.1 microsecond/byte,
interrupt driven transfer has an interrupt overhead = 0.4 microseconds, the DMA initialization
and termination overhead is negligible compared to the total sector transfer time. DMA
requests are always granted.
(a) What is the total capacity of the disk?
(b) What is the data transfer rate?
(c) What is the percentage of time the CPU is required for this disk I/O for byte- wise
interrupts driven transfer?
(d) What is the maximum percentage of time the CPU is held up for this disk I/O for cycle-
stealing DMA transfer?
7. A CPU has 32-bit memory address and a 256 KB cache memory. The cache is organized as
a 4-way set associative cache with cache block size of 16 bytes.
(a) What is the number of sets in the cache?
(b) What is the size (in bits) of the tag field per cache block?
(c) What is the number and size of comparators required for tag matching?
(d) How many address bits are required to find the byte offset within a cache block?
(e) What is the total amount of extra memory (in bytes) required for the tag bits?
8. (a) Is the 3-variable function f = (0,1,2,4) its self-dual? Justify your answer.
(b) Give a minimal product-of-sum form of the b output of the following excess-3 to BCD
converter.
9. A sequential circuit takes an input stream of 0’s and l’s and produces an output stream of
0’s and l’s. Initially it replicates the input on its output until two consecutive 0’s are
encountered on the input. From then onward, it produces an output stream, which is the bit-
wise complement of input stream until it encounters two consecutive l’s, whereupon the
process repeats. An example of input and output stream is shown below.
The inputstream: 1O11OOO1OO1O11 011
The desired output: 1O11OO1O11O1OO 0 11
J-K master-slave flip-flops are to be used to design the circuit.
(a) Give the state transition diagram.
(b) Give the minimized sum-of-product expression for J and K inputs of one of its state flip-
flops.
10. Consider a 5-stage pipeline — IF (Instruction Fetch), ID (Instruction Decode and register
read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads
take place in the second phase of a clock cycle and writes occur in the first phase of the clock
cycle. Consider the execution of the following instruction sequence:
11: sub r2, r3, r4; / r2 - r3 — r4
12: sub r4, r2, r3; / r4 - r2 — r3
13: sw r2, 100(n) 1* M[rl+100]E- r2 /
14: sub r3, r4, r2; / r3 - r4 — r2
(a) Show all data dependencies between the four instructions.
(b) Identify the data hazards.
(c) Can all hazards be avoided by forwarding in this case?
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
12. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
11. Consider the following C program:
void abc(char*s)
{
if(s[O]= =‘O’)return;
abc(s+ 1);
abc(s+ 1);
printf(”°Ioc”,s[O]);
}
main ()
{ abc(”123”)
}
(a) What will be the output of the program?
(b) If abc(s) is called with a null-terminated string s of length n characters (not counting the
null (‘0’) character), how many characters will be printed by abc(s)?
11. (a) Insert the following keys one by one into a binary search tree in the order specified.
15, 32, 20, 9, 3, 25, 12, 1
Show the final binary search tree after the insertions.
(b) Draw the binary search tree after deleting 15 from it.
(c) Complete the statements Si, S2 and S3 in the following function so that the function
computes the depth of a binary rooted at t.
typedef struct tnode{
mt key;
struct tnode *left, *right;
} *Tree;
mt depth (Tree t)
{
mt x,y;
it (t ==NULL) returnO;
x=depth(t-) left);
Si: ___________
S2: if(x>y) return _______________
S3: else return _______________
}
12. Consider a weighted undirected graph with vertex set V = {ni,n2,n3,n4,n5,n6} and edge
set
E={(n i,n2,2),(ni,n3,8),(n i,n6,3),(n2,n4,4),(n2,n5,12),(n3,n4,7),(n4,n5,9), (n4,n6,4)}. The
third value in each tuple represents the weight of the edge specified in the tuple.
(a) List the edges of a minimum spanning tree of the graph.
(b) How many distinct minimum spanning trees does this graph have?
(c) Is the minimum among the edge weights of a minimum spanning tree unique overall
possible minimum spanning trees of a graph?
(d) Is the maximum among the edge weights of a minimum spanning tree unique over all
possible minimum spanning trees of a graph?
13. Consider the following grammar with terminal alphabet {a,(,),,*}and start symbol E. The
production rules of the grammar are:
E - aA
E - (E)
A - +E
A *E
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
13. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
A-E
(a) Compute the FIRST and FOLLOW sets for E and A.
(b) Complete the LL(i) parse table for the grammar.
14. The syntax of the repeat-until statement is given by the following grammar S - repeat S1
until E
Where E stands for expressions, S and S1 stand for statement. The non-terminals S and S1
have an attribute code that represents generated code. The non- terminal E has two
attributes. The attribute code represents generated code to evaluate the expression and store
its truth value in a distinct variable, and the attribute varName contains the name of the
variable in which the truth value is stored? The truth-value stored in the variable is 1 if E is
true, 0 if E is false.
Give a syntax-directed definition to generate three-address code for the repeat- until
statement. Assume that you can call a function newlabel( ) that returns a distinct label for a
statement. Use the operator’’ to concatenate two strings and the function gen(s) to generate
a line containing the string s.
15. (a) Remove left-recursion from the following grammar:
S - Sal Sb I a I b
(b) Consider the following grammar:
S - aSbSl bSaS Ic
Construct all possible parse trees for the string abab. Is the grammar ambiguous?
16. Two concurrent processes P1 and P2 want to use two resources Ri and R2 in a
mutually exclusive manner. Initially, Ri and R2 are free. The programs executed
by the two processes are given below.
Program for P1:
51: While (Ri is busy) do no-op;
S2: Set Ri - busy;
S3: While (R2 is busy) do no-op;
S4: Set R2 - busy;
S5: Use Ri and R2;
S6: Set Ri - free;
S7: Set R2 - free;
Program for P2:
Qi: While (Ri is busy) do no-op;
Q2: Set Ri - busy;
Q3: While (Ri is busy) do no-op;
Q4: Set Ri - busy;
Q5: Use Ri and R2;
Q6: Set R2 - free;
Q7: Set Ri - free;
(a) Is mutual exclusion guaranteed for Ri and R2? If not, show a possible interleaving of the
statements of P1 and P2 such that mutual exclusion is violated (i.e., both P1 and P2 use Ri or
R2 at the same time).
(b) Can deadlock occur in the above program? If yes, show a possible interleaving of the
statements of P1 and P2 leading to deadlock.
(c) Exchange the statements Q1 and Q3 and statements Q2 and Q4. Is mutual exclusion
guaranteed now? Can deadlock occur?
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants
14. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
17. Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000 rpm. The
number of sectors per track is 100. the time to move the head between two successive tracks
is 0.2 millisecond.
(a) Consider a set of disk requests to read data from tracks 32, 7, 45, 5 and 10. Assuming
that the elevator algorithm is used to schedule disk requests, and the head is initially at track
25 moving up (towards larger track numbers), what is the total seek time for servicing the
requests?
(b) Consider an initial set of 100 arbitrary disk requests and assume that no new disk requests
arrive while servicing these requests. If the head is initially at track 0 and the elevator
algorithm is used to schedule disk requests, what is the worst case time to complete all the
requests?
18. Consider the relation examinee (regno, name, score), where regno is the primary key to
score is a real number.
(a) Write a relational algebra using (fJ,G,p,x) to find the list of names which appear more than
once in examinee.
(b) Write an SQL query to list the regno of examinees who have a score greater than the
average score.
(c) Suppose the relation appears (regno, centr_code) specifies the center where an examinee
appears. Write an SQL query to list the centr code having an examinee of score greater than
80.
19. We wish to construct a 5 tree with fan-out (the number of pointers per node) equal to 3
for the following set of key values:
80, 50, 10, 70, 30, 100, 90
Assume that the tree is initially empty and the values are added in the order given.
(a) Show the tree after insertion of 10, after insertion of 30, and after insertion of 90.
Intermediate trees need not be shown.
(b) The key values 30 and 10 are now deleted from the tree in that order. Show the tree after
each deletion.
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants