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 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 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 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 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.
05211201 A D V A N C E D D A T A S T R U C T U R E S A N D A L G O R I...guestd436758
This document contains an exam for a class on Advanced Data Structures and Algorithms. It lists 8 questions that students can choose 5 of to answer. The questions cover topics like classes and objects in C++, inheritance, exception handling, data structures like trees, heaps, and hash tables, and algorithms like sorting, searching trees, minimum spanning trees, and the traveling salesman problem. Students have 3 hours to answer 5 of the 8 questions, which range from coding exercises to explanations of concepts.
CDAC CCAT examination important questionprabhatjon
This document contains 20 multiple choice questions related to computer science topics like data structures, algorithms, programming languages, and more. Some key points covered are:
- Inserting an element into a stack with a linked implementation has time complexity of O(1).
- Flowcharts, pseudocode, and decision tables can be used to represent algorithms pictorially.
- LISP was designed for artificial intelligence research.
- Time and memory requirements are primary factors for judging algorithm quality.
- The malloc() function is used for dynamic memory allocation and is available in the stdlib.h header file.
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 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 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 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.
05211201 A D V A N C E D D A T A S T R U C T U R E S A N D A L G O R I...guestd436758
This document contains an exam for a class on Advanced Data Structures and Algorithms. It lists 8 questions that students can choose 5 of to answer. The questions cover topics like classes and objects in C++, inheritance, exception handling, data structures like trees, heaps, and hash tables, and algorithms like sorting, searching trees, minimum spanning trees, and the traveling salesman problem. Students have 3 hours to answer 5 of the 8 questions, which range from coding exercises to explanations of concepts.
CDAC CCAT examination important questionprabhatjon
This document contains 20 multiple choice questions related to computer science topics like data structures, algorithms, programming languages, and more. Some key points covered are:
- Inserting an element into a stack with a linked implementation has time complexity of O(1).
- Flowcharts, pseudocode, and decision tables can be used to represent algorithms pictorially.
- LISP was designed for artificial intelligence research.
- Time and memory requirements are primary factors for judging algorithm quality.
- The malloc() function is used for dynamic memory allocation and is available in the stdlib.h header file.
GUESS FUNDAMENTAL PAPER FOE CCAT Feb 2014prabhatjon
This document contains a quiz about computing fundamentals with 47 multiple choice questions and answers. It covers topics like software types, computer hardware, operating systems, networking, databases, security, and more. Additional resources for practice papers are provided at the end.
The document discusses various topics related to computer graphics and visualization:
i) It explains the concept of pinhole camera and finds the coordinates of a projected point on a film mounted inside the camera box. It also defines the field of view.
ii) It explains the graphics pipeline and its components.
iii) It explains the concept of transformations in homogeneous coordinates and finds the transformation matrix and its inverse for various transformations including rotation.
This document provides an overview of machine learning in R. It discusses R's capabilities for statistical analysis and visualization. It describes key R concepts like objects, data structures, plots, and packages. It explains how to import and work with data, perform basic statistics and machine learning algorithms like linear models, naive Bayes, and decision trees. The document serves as an introduction for using R for machine learning tasks.
The document contains multiple choice questions and answers related to C++ concepts like input/output operations, loops, functions, structures, classes, and object-oriented programming principles. Some key points covered include:
- The cstdio header is used for input/output in C++ (as opposed to stdio.h in C).
- Streams are used to interact with physical devices from C++ programs.
- Classes can contain both data members and member functions, and objects are initialized using constructors by default.
- Structures are similar to classes but have public access by default.
- Inline functions are expanded during compilation to reduce function call overhead.
This document contains a 25 question multiple choice quiz about computer science topics. The questions cover topics like Boolean algebra, graphs, probability, algorithms, automata theory, programming languages, operating systems, computer networks, databases and software engineering. For each question there are 4 possible answer choices, with one being marked as the correct answer. Explanations are provided for some of the questions.
This document is announcing a new job search group on Yahoo called "chetana_job_search". It invites the reader to join the group to help job seekers discover job opportunities and share recruitment information and preparation materials like previous question papers and interviews. The group will collect and share information on jobs, campus recruitment papers, interview questions, puzzles and resume/cover letter samples in zip files. It provides a link to access the group.
The document is a sample paper for Class XII Subject Informatics Practices. It consists of 3 sections - Section A with 30 marks, Section B with 20 marks each, and Section C with 20 marks each. Section A contains short answer questions, Section B contains case studies and questions, and Section C contains SQL queries and output questions. The document provides answer keys for all questions.
Specialist marketing officer professional knowledge questions.pdf(1)Nivi Mohanty
The document contains a set of multiple choice questions related to computer knowledge and concepts. The questions cover topics such as email accounts, data processing, computer hardware components, computer memory, programming languages, storage devices, operating systems, and computer networks.
This document contains 8 questions that are part of an examination for a 7th semester computer engineering course covering Java and JEE technologies. It provides instructions to answer 5 full questions out of the 8, with at least 2 questions from each part (A and B).
Part A covers core Java concepts like object-oriented programming, applets, events, AWT vs Swing, and GUI components. Part B focuses on more advanced Java EE topics such as JDBC, transactions, servlets, cookies, sessions, JSP, and RMI. Students are asked to explain, define, write examples, and compare/contrast various Java and Java EE programming concepts and technologies.
The document provides a model question paper for class 12 computer science. It contains 7 questions covering various topics like C++, OOPs, data structures, file handling, SQL, boolean algebra and networking. The paper has a total of 70 marks distributed across different sub-questions having 1, 2, 3 or 4 marks each. Detailed blueprints specifying the marks distribution across different units is also provided.
- Multidimensional views and data cubes are used in data warehousing to analyze and visualize data from different perspectives. A data cube stores pre-aggregated data to enable fast analysis of data.
- Data mining involves tasks like data preprocessing, pattern discovery, and knowledge extraction from large datasets. Common techniques include classification, clustering, and association rule mining.
- Decision trees can be used for classification by recursively splitting the data into purer subsets based on attribute values. Accuracy can be improved through techniques like pruning. Evaluation criteria help select the best classification method.
SociaLite: High-level Query Language for Big Data AnalysisDataWorks Summit
This document describes SociaLite, a high-level query language for analyzing big data. SociaLite compiles queries to distributed code for efficient execution. It supports distributed tables, rules, and Python integration. SociaLite can be used for graph analysis, data mining, and relational queries. It provides built-in algorithms like shortest paths, PageRank, k-means clustering, and logistic regression. Evaluation shows SociaLite achieves 1000x speedup over Hadoop and scales to large clusters with near-linear speedup.
this is good question set for CCAT exam and alos for CCEE
for more details please visit
http://acts.cdac.in
http://cdacguru.wordpress.com
http://fb.com/cdacguru
- The document contains questions for an exam on operating systems and computer architecture. It lists five sections with multiple choice questions in each section covering topics like operating system objectives and functions, real-time operating systems, security issues, and differences between traditional and modern UNIX kernels.
- The exam is worth a total of 100 marks and students must answer five full questions ranging from 4 to 15 marks each. Questions assess understanding of concepts like process states, Linux kernel components, thread implementation, and multiprocessing scheduling approaches.
This document contains solutions to questions from a computer science examination. It includes questions on topics like Python, Pandas, SQL, data visualization, and computer networks. The solutions demonstrate how to write Python code to create and manipulate dataframes, plot charts, and perform SQL queries. Examples of network topologies and devices like switches, modems, and gateways are also provided. The document aims to test students' understanding of key concepts in informatics practices.
Question Paper Code 065 informatic Practice New CBSE - 2021 FarhanAhmade
This document provides instructions for a test paper containing 40 questions divided into two parts (Part A and Part B). Part A has two sections - Section I containing 21 short answer questions and Section II containing two case study questions with subparts. Part B is divided into three sections testing different skills with options and varying mark values. The document outlines the question types, number of questions, distribution of marks and provides general instructions for answering the paper.
This document contains 20 multiple choice questions about Java programming concepts such as classes, constructors, exceptions, arrays, inheritance, and more. The questions cover topics like output of code snippets, default values of array elements, reserved keywords, valid code constructs, and true/false statements about classes, wrappers, and exceptions.
The document contains questions from a seventh semester examination in programming and web technologies. It includes 10 questions split into two parts - Part A and Part B. The questions cover topics like standard XHTML document structure, web servers, common HTML/XHTML tags, JavaScript functions, DOM navigation, CSS positioning, differences between HTML and XHTML, CSS selectors, and creating an XHTML form. Students are instructed to answer any 5 full questions selecting at least 2 from each part.
This document discusses the implementation of a lock-free queue in C++. It begins with an overview of blocking vs non-blocking behavior and synchronization primitives like mutexes. It then presents the implementation of a single-producer, single-consumer lock-free queue using atomic operations. It shows how push and pop operations are performed concurrently without locking by atomically updating shared queue pointers. It also discusses techniques like helping other threads complete operations to ensure lock-free progress.
This document provides solved problems from GATE (Graduate Aptitude Test in Engineering) exams from 1996-2013 in the subject of Engineering Mathematics. It contains one-mark and two-mark questions related to topics like differential equations, matrices, probability, complex analysis etc. along with their solutions. The document is available for purchase in digital format at www.nodia.co.in in separate sections or 'units'.
792 ssc cgl tier ii gk question paper answer combined graduate levelminni5
This document contains a GK question paper with 49 questions and answers related to topics like geography, history, politics, science and more. Some key details include:
- The common tree species in Nilgiri Hills is Eucalyptus.
- The nuclear reactors damaged in Japan in 2011 due to an earthquake and tsunami were located in Fukushima.
- The headquarters of the International Atomic Energy Agency is located in Vienna, Austria.
- Loktak is a lake located in Manipur, India.
GUESS FUNDAMENTAL PAPER FOE CCAT Feb 2014prabhatjon
This document contains a quiz about computing fundamentals with 47 multiple choice questions and answers. It covers topics like software types, computer hardware, operating systems, networking, databases, security, and more. Additional resources for practice papers are provided at the end.
The document discusses various topics related to computer graphics and visualization:
i) It explains the concept of pinhole camera and finds the coordinates of a projected point on a film mounted inside the camera box. It also defines the field of view.
ii) It explains the graphics pipeline and its components.
iii) It explains the concept of transformations in homogeneous coordinates and finds the transformation matrix and its inverse for various transformations including rotation.
This document provides an overview of machine learning in R. It discusses R's capabilities for statistical analysis and visualization. It describes key R concepts like objects, data structures, plots, and packages. It explains how to import and work with data, perform basic statistics and machine learning algorithms like linear models, naive Bayes, and decision trees. The document serves as an introduction for using R for machine learning tasks.
The document contains multiple choice questions and answers related to C++ concepts like input/output operations, loops, functions, structures, classes, and object-oriented programming principles. Some key points covered include:
- The cstdio header is used for input/output in C++ (as opposed to stdio.h in C).
- Streams are used to interact with physical devices from C++ programs.
- Classes can contain both data members and member functions, and objects are initialized using constructors by default.
- Structures are similar to classes but have public access by default.
- Inline functions are expanded during compilation to reduce function call overhead.
This document contains a 25 question multiple choice quiz about computer science topics. The questions cover topics like Boolean algebra, graphs, probability, algorithms, automata theory, programming languages, operating systems, computer networks, databases and software engineering. For each question there are 4 possible answer choices, with one being marked as the correct answer. Explanations are provided for some of the questions.
This document is announcing a new job search group on Yahoo called "chetana_job_search". It invites the reader to join the group to help job seekers discover job opportunities and share recruitment information and preparation materials like previous question papers and interviews. The group will collect and share information on jobs, campus recruitment papers, interview questions, puzzles and resume/cover letter samples in zip files. It provides a link to access the group.
The document is a sample paper for Class XII Subject Informatics Practices. It consists of 3 sections - Section A with 30 marks, Section B with 20 marks each, and Section C with 20 marks each. Section A contains short answer questions, Section B contains case studies and questions, and Section C contains SQL queries and output questions. The document provides answer keys for all questions.
Specialist marketing officer professional knowledge questions.pdf(1)Nivi Mohanty
The document contains a set of multiple choice questions related to computer knowledge and concepts. The questions cover topics such as email accounts, data processing, computer hardware components, computer memory, programming languages, storage devices, operating systems, and computer networks.
This document contains 8 questions that are part of an examination for a 7th semester computer engineering course covering Java and JEE technologies. It provides instructions to answer 5 full questions out of the 8, with at least 2 questions from each part (A and B).
Part A covers core Java concepts like object-oriented programming, applets, events, AWT vs Swing, and GUI components. Part B focuses on more advanced Java EE topics such as JDBC, transactions, servlets, cookies, sessions, JSP, and RMI. Students are asked to explain, define, write examples, and compare/contrast various Java and Java EE programming concepts and technologies.
The document provides a model question paper for class 12 computer science. It contains 7 questions covering various topics like C++, OOPs, data structures, file handling, SQL, boolean algebra and networking. The paper has a total of 70 marks distributed across different sub-questions having 1, 2, 3 or 4 marks each. Detailed blueprints specifying the marks distribution across different units is also provided.
- Multidimensional views and data cubes are used in data warehousing to analyze and visualize data from different perspectives. A data cube stores pre-aggregated data to enable fast analysis of data.
- Data mining involves tasks like data preprocessing, pattern discovery, and knowledge extraction from large datasets. Common techniques include classification, clustering, and association rule mining.
- Decision trees can be used for classification by recursively splitting the data into purer subsets based on attribute values. Accuracy can be improved through techniques like pruning. Evaluation criteria help select the best classification method.
SociaLite: High-level Query Language for Big Data AnalysisDataWorks Summit
This document describes SociaLite, a high-level query language for analyzing big data. SociaLite compiles queries to distributed code for efficient execution. It supports distributed tables, rules, and Python integration. SociaLite can be used for graph analysis, data mining, and relational queries. It provides built-in algorithms like shortest paths, PageRank, k-means clustering, and logistic regression. Evaluation shows SociaLite achieves 1000x speedup over Hadoop and scales to large clusters with near-linear speedup.
this is good question set for CCAT exam and alos for CCEE
for more details please visit
http://acts.cdac.in
http://cdacguru.wordpress.com
http://fb.com/cdacguru
- The document contains questions for an exam on operating systems and computer architecture. It lists five sections with multiple choice questions in each section covering topics like operating system objectives and functions, real-time operating systems, security issues, and differences between traditional and modern UNIX kernels.
- The exam is worth a total of 100 marks and students must answer five full questions ranging from 4 to 15 marks each. Questions assess understanding of concepts like process states, Linux kernel components, thread implementation, and multiprocessing scheduling approaches.
This document contains solutions to questions from a computer science examination. It includes questions on topics like Python, Pandas, SQL, data visualization, and computer networks. The solutions demonstrate how to write Python code to create and manipulate dataframes, plot charts, and perform SQL queries. Examples of network topologies and devices like switches, modems, and gateways are also provided. The document aims to test students' understanding of key concepts in informatics practices.
Question Paper Code 065 informatic Practice New CBSE - 2021 FarhanAhmade
This document provides instructions for a test paper containing 40 questions divided into two parts (Part A and Part B). Part A has two sections - Section I containing 21 short answer questions and Section II containing two case study questions with subparts. Part B is divided into three sections testing different skills with options and varying mark values. The document outlines the question types, number of questions, distribution of marks and provides general instructions for answering the paper.
This document contains 20 multiple choice questions about Java programming concepts such as classes, constructors, exceptions, arrays, inheritance, and more. The questions cover topics like output of code snippets, default values of array elements, reserved keywords, valid code constructs, and true/false statements about classes, wrappers, and exceptions.
The document contains questions from a seventh semester examination in programming and web technologies. It includes 10 questions split into two parts - Part A and Part B. The questions cover topics like standard XHTML document structure, web servers, common HTML/XHTML tags, JavaScript functions, DOM navigation, CSS positioning, differences between HTML and XHTML, CSS selectors, and creating an XHTML form. Students are instructed to answer any 5 full questions selecting at least 2 from each part.
This document discusses the implementation of a lock-free queue in C++. It begins with an overview of blocking vs non-blocking behavior and synchronization primitives like mutexes. It then presents the implementation of a single-producer, single-consumer lock-free queue using atomic operations. It shows how push and pop operations are performed concurrently without locking by atomically updating shared queue pointers. It also discusses techniques like helping other threads complete operations to ensure lock-free progress.
This document provides solved problems from GATE (Graduate Aptitude Test in Engineering) exams from 1996-2013 in the subject of Engineering Mathematics. It contains one-mark and two-mark questions related to topics like differential equations, matrices, probability, complex analysis etc. along with their solutions. The document is available for purchase in digital format at www.nodia.co.in in separate sections or 'units'.
792 ssc cgl tier ii gk question paper answer combined graduate levelminni5
This document contains a GK question paper with 49 questions and answers related to topics like geography, history, politics, science and more. Some key details include:
- The common tree species in Nilgiri Hills is Eucalyptus.
- The nuclear reactors damaged in Japan in 2011 due to an earthquake and tsunami were located in Fukushima.
- The headquarters of the International Atomic Energy Agency is located in Vienna, Austria.
- Loktak is a lake located in Manipur, India.
This document contains a general knowledge quiz with 73 multiple choice questions covering topics like presidents and prime ministers, awards, geography, history, literature, science and technology, sports, and business. The questions are designed to test one's general awareness and knowledge across many domains.
Previous Years Solved Question Papers for Staff Selection Commission (SSC)…SmartPrep Education
Here is the Previous Years Solved Staff Selection Commission (SSC) LDC DEO Exam Paper. Visit SmartPrep for information on Test Prep courses for Undergraduates
10000 general knowledge questions and answersRomeo Corrales
This document contains 100 general knowledge trivia questions and answers ranging across diverse topics such as history, geography, entertainment, science, and more. Some example questions include:
- Who betrayed Jesus to the Romans? Judas Iscariot.
- What would you do with a Yashmak? Wear it - it's an Arab veil.
- What animal lays eggs? Duck billed platypus.
- What does deciduous trees do? Lose their leaves in winter.
- What is the name of inn in Treasure Island? Admiral Benbow.
The questions are multiple choice and the answers are provided immediately after each question. The questions cover people, places, events, inventions
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 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.
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 provides information about joining an All India Mock GATE Classroom Test Series conducted by GATE Forum in over 25 cities across India. The test series includes section tests and full tests designed by IISc alumni according to the latest GATE syllabus. Participants receive their percentile score, All India rank, and can interact with IISc alumni through online discussion forums. The document also provides sample questions from previous GATE papers.
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.
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 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.
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 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.
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.
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 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.
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.
The document contains a sample test for the CDAC Common Admission Test (C-CAT) consisting of 3 sections with a total of 49 multiple choice questions covering topics such as English, programming, computer networks, operating systems, data structures, object-oriented programming, digital logic, and computer architecture. The test is assessing fundamental knowledge expected of candidates applying for admission to CDAC programs.
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 contains a 20 question mock exam for the GATE exam. It provides instructions that each question is worth 1 mark, unanswered questions receive 0 marks and incorrect answers receive negative marks. It then lists 20 multiple choice questions related to computer science topics like operating systems, algorithms, data structures, computer networks and formal languages. For each question there are 4 possible answer choices and space to write the answer.
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.
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 contains a 25 question multiple choice quiz about computer science topics. The questions cover topics like Boolean algebra, graphs, probability, algorithms, automata theory, programming languages, operating systems, computer networks, databases and software engineering. The majority of the questions can be answered by applying basic concepts from these topics at an undergraduate level.
This document provides information about a GATE exam test paper from 2001. It includes 25 single-mark questions and 25 two-mark questions covering various mechanical engineering topics. It also provides information about joining mock GATE test series and online discussion forums to help prepare for the GATE exam.
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.
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.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
ACRP 4-09 Risk Assessment Method to Support Modification of Airfield Separat...
Gate Previous Years Papers
1. www.OneStopGATE.com – GATE Study Material, Forum,
downloads, discussions & more!
GATE CS - 2002
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 (last few pages) for any rough work.
1.1 The rank of the matrix is
00
(a) 4
(b) 2
(c) 1
(d) 0
1.2 The trapezoidal rule for integration gives exact result when the integrand is a polynomial
of degree
(a) 0 but not 1
(b) 1 but not 0
(c) 0 or 1
(d) 2
1.3 The solution to the recurrence equation T(2k) = 3T(2k_l)+ 1,T(1) = 1 is
(3k+_ —
(a) 2k
(b)
(C) 3IOg
(d) 2I0
1.4 The minimum number of colours required to colour the vertices of a cycle with n nodes in
such a way that no two adjacent nodes have the same colour is
(a) 2
(b) 3
(c) 4
(d) n_2[+2
1.5 In the worst case, the number of comparisons needed to search a singly linked list of
length n for a given element is
(a) log n
(b)
(c) log—1
(d) n
1.6 Which of the following is true?
(a) The set of all rational negative numbers forms a group under multiplication.
(b) The set of all non-singular matrices forms a group under multiplication.
(c) The set of all matrices forms a group under multiplication.
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!
(d) Both B and C are true.
1.7 The language accepted by a Pushdown Automaton in which the stack is limited to 10 items
is best described as
(a) Context free
(b) Regular
(c) Deterministic Context free
(d) Recursive
1.8 “If X then Y unless Z” is represented by which of the following formulas in prepositional
logic? (“ “, is negation, “A” is conjunction, and “-“ is implication)
(a) (XA-iZ)-Y
(b) (XAY)--1Z
(c) X-(YA-iZ)
(d) (X-Y)A-iZ
1.9 A device employing INTR line for device interrupt puts the CALL instruction on the data
bus while
(a) INTA is active
(b) HOLD is active
(c) READY is active
(d) None of the above
1.10 In 8085 which of the following modifies the program counter?
(a) Only PCHL instruction
(b) Only ADD instructions
(c) Only JMP and CALL instructions
(d) All instructions
1.11 In serial data transmission, every byte of data is padded with a ‘0’ in the
beginning and one or two ‘l’s at the end of byte because
(a) Receiver is to be synchronized for byte reception
(b) Receiver recovers lost ‘0’s and ‘l’s from these padded bits
(c) Padded bits are useful in parity computation
(d) None of the above
1.12 Which of the following is not a form of memory?
(a) instruction cache
(b) instruction register
(c) instruction opcode
(d) translation look-a-side buffer
1.13 The decimal value 0.25
(a) is equivalent to the binary value 0.1
(b) is equivalent to the binary value 0.01
(c) is equivalent to the binary value 0.00111...
(d) cannot be represented precisely in binary
1.14 The 2’s complement representation of the decimal value —15 is
(a) 1111
(b) 11111
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!
(c) 111111
(d) 10001
1.15 Sign extension is a step in
(a) floating point multiplication
(b) signed 16 bit integer addition
(c) arithmetic left shift
(d) converting a signed integer from one size to another
1.16 In the C language
(a) At most one activation record exists between the current activation record and the
activation record fOr the main
(b) The number of activation records between the current activation record and the activation
record fro the main depends on the actual function calling sequence.
(c) The visibility of global variables depends on the actual function calling seq uence.
(d) Recursion requires the activation record for the recursive function to be saved on a
different stack before the recursive fraction can be called.
1.17 The results returned by function under value-result and reference parameter
passing conventions
(a) Do not differ
(b) Differ in the presence of loops
(c) Differ in all cases
(d) May differ in the presence of exception
1.18 Relation R with an associated set of functional dependencies, F, is decomposed into
BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations
is
(a) Zero
(b) More than zero but less than that of an equivalent 3NF decomposition
(c) Proportional to the size of F
(d) Indetermine
1.19 With regard to the expressive power of the formal relational query languages, which of
the following statements is true?
(a) Relational algebra is more powerful than relational calculus
(b) Relational algebra has the same power as relational calculus.
(c) Relational algebra has the same power as safe relational calculus.
(d) None of the above
1.20 In 2’s complement addition, overflow
(a) is flagged whenever there is carry from sign bit addition
(b) cannot occur when a positive value is added to a negative value
(c) is flagged when the carries from sign bit and previous bit match
(d) None of the above
1.21 Which of the following scheduling algorithms is non-preemptive?
(a) Round Robin
(b) First-In First-Out
(c) Multilevel Queue Scheduling
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) Multilevel Queue Scheduling with Feedback
1.22 The optimal page replacement algorithm will select the page that
(a) Has not been used for the longest time in the past.
(b) Will not be used for the longest time in the future.
(c) Has been used least number of times.
(d) Has been used most number of times.
1.23 In the absolute addressing mode
(a) the operand is inside the instruction
(b) the address of the operand is inside the instruction
(c) the register containing the address of the operand is specified inside the instruction
(d) the location of the operand is implicit
1.24 Maximum number of edges in a n-node undirected graph without self loops is
n(n—1) (n+1)(n)
(a) n2
(b) 2
(c) n - 1
(d) 2
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 ORS for any rough work. You may
use the answer book (last few pages) for any rough work.
2.1 Consider the following logic circuit whose inputs are functions f1, f2, f3 and output
is f.
Given that
f1 (x,y,z) =
f2 (x,y,z) = (6,7), and
f(x,y,z) =
f3 is
(a) (1,4,5)
(c) (O,1,3,5)
(b) (6,7)
(d) None of the above
2.2 Consider the following multiplexor where 10, 11, 12, 13 are four data input lines selected
by two address line combinations A1A0 =00,01,10,11 respectively and f is the output of the
multiplexor. EN is the Enable input.
f(x,y,z) =?
The function f(x,y,z) implemented by the above circuit is
(a) xyz’
(b) xy+z
(c) x+y
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.3 Letf(A,B) = A’+B. Simplified expression for function f(f(x+y,y),z)is
(a) x’+z
(b) xyz
(c) xy’+z
(d) None of the above
2.4 What are the states of the Auxiliary Carry (AC) and Carry Flag (CY) after
executing the following 8085 program?
MVI H, 5DH
MIV L, 6BH
MOV A, H
ADD L
(a) AC = 0 and CY =0
(b) AC = 1 and CY =1
(c) AC = 1 and CY =0
(d) AC = 0 and CY =1
2.5 The finite state machine described by the following state diagram with A as starting state,
where an arc label is f-and x stands for 1-bit input and y stands y for 2-bit output
(a) Outputs the sum of the PreiT Id the previous bits of the input.
(b) Outputs 01 whenever the input sequence contains 11
(c) Outputs 00 whenever the input sequence contains 10
(d) None of the above
2.6 The performance of a pipelined processor suffers if
(a) the pipeline stages have different delays
(b) consecutive instructions are dependent on each other
(c) the pipeline stages share hardware resources
(d) All of theabove
2.7 Horizontal microprogramming
(a) does not require use of signal decoders
(b) results in larger sized microinstructions than vertical microprogramming
(c) uses one bit for each control signal
(d) all of the above
2.8 Consider the following declaration of a two-dimensional array in C:
char a[100][100];
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!
Assuming that the main memory is byte-addressable and that the array is stored starting from
memory address 0, the address of a [40][50] is
(a) 4040
(b) 4050
(c) 5040
(d) 5050
2.9 The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or
3 children is:
(a)
(b)
(c) 2
(d)
2.10 Consider the following algorithm for searching for a given number x in an unsorted array
A[l. .n] having n distinct values:
1. Choose an i uniformly at random from I. .nl
2. If A[i]=x then Stop else Goto 1;
Assuming that x is present A, what is the expected number of comparisons made by the
algorithm before it terminates?
(a) n
(b) n - 1
(c) 2n
(d)
2.11 The running time of the following algorithm
Procedure A(n)
If n<=2 return(1) else return (A(r.J1));
Is best described by
(a) 0(n)
(b) 0(log n
(c) 0(log log n)
(d) 0(1)
2.12 A weight-balanced tree is a binary tree in which for each node, the number of nodes in
the let sub tree is at least half and at most twice the number of nodes in the right sub tree.
The maximum possible height (number of nodes on the path from the root to the furthest leaf)
of such a tree on n nodes is best described by which of the following?
(a) log2n
(b) log4 n
(c) log3n
(d) log3 n
2.13 The smallest finite automaton which accepts the language
{xlength of x is divisible by 3) has
(a) 2 states
(b) 3 states
(c) 4 states
(d) 5 states
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.14 Which of the following is true?
(a) The complement of a recursive language is recursive.
(b) The complement of a recursively enumerable language is recursively enumerable.
(c) The complement of a recursive language is either recursive or recursively enumerable.
(d) The complement of a context-free language is context-free
2.15 The binary relation S = 0 (empty set) on set A = {1,2,3} is
(a) Neither reflexive nor symmetric
(b) Symmetric and reflexive
(c) Transitive and reflexive
(d) Transitive and symmetric
2.16 The C language is:
(a) A context free language
(b) A context sensitive language
(c) A regular language
(d) Parsable fully only by a Turing machine
2.17 To evaluate an expression without any embedded function calls
(a) One stack is enough
(b) Two stacks are needed
(c) As many stacks as the height of the expression tree are needed
(d) A Turning machine is needed in the general case
2.18 Dynamic linking can cause security concerns because
(a) Security is dynamic
(b) The path for searching dynamic libraries is not known till runtime
(c) Linking is insecure
(d) Cryptographic procedures are not available for dynamic linking
2.19 Which combination of the following features will suffice to characterize an OS as a multi-
programmed OS?
(A) More than one program may be loaded into main memory at the same time for execution.
(B) If a program waits for certain events such as I/O, another program is immediately
scheduled for execution.
(C) If the execution of a program terminates, another program is immediately scheduled
for execution.
(a) A
(b) A and B
(c) A and C
(d) A, B and C
2.20 In the index allocation scheme of blocks to a file, the maximum possible size of the file
depends on
(a) the size of the blocks, and the size of the address of the blocks.
(b) the number of blocks used for the index, and the size of the blocks.
(c) the size of the blocks, the number of blocks used for the index, and the size of the address
of the blocks.
(d) None of the above
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!
2.21 A B - tree index is to be built on the Name attribute of the relation STUDENT. Assume
that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index
pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree
(i.e. the number of pointers per node) of the B - tree?
(a) 16
(b) 42
(c) 43
(d) 44
2.22 Relation R is decomposed using a set of functional dependencies, F, and relation S is
decomposed using another set of functional dependencies, G. One decomposition is definitely
BCNF, the other is definitely. 3NF, but it is not known which is which. To make a guaranteed
identification, which one of the following tests should be used on the decompositions?
(Assume that the closures of F and
Gare available). ‘-‘7 __
(a) Dependency-preservation
(b) Lossless-join
(c) BCNF definition
(d) 3NF definition
2.23 From the following instance of a relation schema R(A,B,C), we can conclude that:
ABC
1 1 1
1 1 0
2 3 2
2 3 2
(a) A functionally determines B and B functionally determines C
(b) A functionally determines B and B does not functionally determines C
(c) B does not functionally determines C
(d) A does not functionally determines B and B does not functionally determines C
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.
3. Let A be a set of n(>O) elements. Let Nr be the number of binary relations on A
and let Nf be the number of functions from A to A.
(a) Give the expression for Nr in terms of n.
(b) Give the expression for Nf in terms of n.
(c) Which is larger for all possible n, Nr or Nf?
4. (a) S = {(1,2),(2,1)) is binary relation on set A = {1,2,3}. Is it irreflexive? Add
the minimum number of ordered pairs to S to make it an equivalence relation. Give the
modified S.
(b) Let S = {a,b} and let LI(S) be the powerset of S. Consider the binary relation ‘c (set
inclusion)’ on LI(S). Draw the Hasse diagram corresponding to the lattice (L1(S),c)
5. (a) Obtain the eigen values of the matrix
1 2 34 49
A= 2 43 94
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!
o o —2 104
o o 0 —1
(b) Determine whether each of the following is a tautology, a contradiction, or neither (“v” is
disjunction, “A” is conjunction, “—“ is implication, “—i” in negation, and “-*“ is biconditional (if
and only if).
(i) A-*(AvA)
(ii) (AvB)—B
(iii) AA(-1(AVB)
6. Draw all binary trees having exactly three nodes labeled A, B and C on which Preorder
traversal gives the sequence C,B,A.
7. (a) Express the function f(x,y,z)=xy’+yz’with only one complement operation and one or
more AND/OR operations. Draw the logic circuit implementing the expression obtained, using
a single NOT gate and one or more AND/OR gates.
REG RD
(6 — bit)
REG R2
(5 — bit)
110 011 111 101 000 000 000 000
101 101 011 110 000 000 000 000
2 3 4 5 6 7 8
(b) What does the circuit implement?
(c) Transform the following logic circuit (without expressing its switching function) into an
equivalent logic circuit that employs only 6 NAND gates each with 2-inputs.
8. Consider the following circuit. A = a2a1a0 and B = b2b1b0 are three bit binary numbers
input to the circuit. The output is Z = z3z2z1z0. RO, Ri and R2 are registers with loading clock
shown. The registers are loaded with their input data with the falling edge of a clock pulse
(signal CLOCK shown) and appears as shown. The bits of input number A, B and the full
adders are as shown in the circuit. Assume Clock period is greater than the settling time of all
circuits.
(a) For 8 clocks pulses on the CLOCK terminal and the inputs A, B as shown, obtain the output
Z (sequence of 4-bit values of Z). Assume initial contents of RO, Ri and R2 as all zeros.
9. Consider the following 32-bit floating-point representation scheme as shown in the formal
below. A value is specified by 3 fields, a one bit sign field (with 0 for positive and 1 for
negative values), a 24 bit fraction field (with the binary point being at the left end of the
fraction bits), and a 7 bit exponent field (in excess-64 signed integer representation, with 16
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!
being the base of exponentiation). The sign bit is the most significant bit.
24 ?
sign fraction exponent
(a) It is required to represent the decimal value —7.5 as a normalized floating point number in
the given format. Derive the values of the various fields. Express your final answer in the
hexadecimal.
(b) What is the largest values that can be represented using this format? Express your answer
as the nearest power of 10.
10. In a C program, an array is declared as float A[2048]. Each array element is 4 Bytes in
size, and the starting address of the array is Ox00000000. This program is run on a computer
that has a direct mapped data cache of size 8 Kbytes, with block (line) size of 16 Bytes.
(a) Which elements of the array conflict with element A[O] in the data cache? Justify your
answer briefly.
(b) If the program accesses the elements of this array one by one in reverse order i.e.,
starting with the last element and ending with the first element, how many data cache misses
would occur? Justify your answer briefly. Assume that the data cache is initially empty and
that no other data or instruction accesses are to be considered.
11. The following recursive function in C is a solution to the Towers of Hanoi problem. Void
move (mt n, char A, char B, char C)
{
if( ){
move ( );
printf(”Move disk °hd from pole °hc to pole °hcn”, n, A,C);
move ( );
Fill in the dotted parts of the solution.
12. Fill in the blanks in the following template of an algorithm to compute all pairs shortest
path lengths in a directed graph G with n*n adjacency matrix A. A[i,j]equals if there is an
edge in G from ito j, and 0 otherwise. Your aim in filling in the blanks is to ensure that the
algorithm is correct.
INITIALIZATION: For i = 1 n
{Forj = 1 n
{ if A[i,j]=0 then P[i,j] = ________ else P[i,j] =_____
ALGORITHM: For i = 1 ...n
{ Forj = 1 ...n
{For k = 1 ...n
{P[,]=min{ ,________
}
}
(a) Copy the complete line containing the blanks in the Initialization step and fill in the blanks.
(b) Copy the complete line containing the blanks in the Algorithm step and fill in the blanks.
(c) Fill in the blank: The running time of the Algorithm is O( ).
13. (a) In how many ways can agiv.en positive integer n 2 be expressed as the sum of 2
positive integers (which are not necessarily distinct). For example, for n = 3, the number of
ways is 2, i.e., 1+2, 2+1. Give only the answer without any explanation.
(b) In how many ways can a given positive integer n 3 be expressed as the sum of 3 positive
integers (which are not necessarily distinct). For example, for n = 4, the number of ways is 3,
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!
i.e., 1+2+1, 2+1+1. Give only the answer without any explanation.
(c) In how many ways can a given positive integer n k be expressed as the sum of k positive
integers (which are not necessarily distinct)? Give only the answer without explanation.
14. The aim of the following question is to prove that the language {M I M is the code of a
Turing Machine which, irrespective of the input, halts and outputs a 1}, is undecidable. This is
to be done by reducing form the language {M’,xM’ halts on x},which is known to be
undecidable. In parts (a) and (b)
describe the 2 main steps in the construction of M. in part (c) describe the key propery which
relates the behaviour of M on its input w to the behaviour of M’on
x.
(a) On input w, what is the first step that M must make?
(b) On input w, based on the outcome of the first step, what is the second step that M must
make?
(c) What key property relates the behaviour of M on w to the behaviour of M’on x?
15. A university placement center maintains a relational database of companies that
interview students on campus and make job offers to those successful in the
interview. The schema of the database is given below:
COMPANY (cname, clocation) STUDENT (scrollno, sname, sdegree)
INTERVIEW (cname, srollno, idate) OFFER (cname,srollno, osalary)
The COMPANY relation gives the name and location of the company. The
STUDENT relation gives the student’s roll number, name and the degree program
for which the student is registered in the university. The INTERVIEW relation
gives the date on which a students is interviewed by a company. The OFFER
relation gives the salary offered to a student who is successful in a company’s
interview. The key for each relation is indicated by the underlined attributes.
(a) Write relational algebra expressions (using nhi the operat ,c,u,— ) for the following
queries:
(i) List the rollnumbers and names of those students who attended at least one interview but
did not receive any job offer.
(ii) List the rollnumbers and names of students who went for interviews and received job
offers from every company with which they interviewed.
(b) Write an SQL query to list, for each degree program in which more than five students were
offered jobs, the name of the degree and the average offered salary of students in this degree
program.
16. For relation R = (1, M, N , 0, ), h ollowUig dependencies hold:
M-O NO-P P-LandL-MN
R is decomposed into R1 =(L, M, N, P) and R2 = (M, 0).
(a) Is the above decomposition a lossless-join decomposition? Explain.
(b) Is the above decomposition dependency-preserving? If not, list all the dependencies that
are not preserved.
(c) What is the highest normal form satisfied by the above decomposition?
17. (a) The following table refers to search times for a key in 5-trees and 5-trees.
A successful search means that the key exists in the database and unsuccessful means that it
is not present in the database. Each of the entries X1, X2, X3 and X4 can have a value of
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!
either Constant or Variable. Constant means that the search time is the same, independent of
the specific key value, where Variable means that it is dependent on the specific key value
chosen for the search.
Give the correct values for the entries X1, X2, X3 and X4 (for example X1 = Constant, X2=
Constant, X3 = Constant, X4= Constant).
B-tree B-tree
Successfu
l
Search Unsuccessful search
Successful
Search Unsuccessful search
xl x2 x3 x4
(b) Relation R(A,B) has the following view defined on it:
CREATE VIEW V AS
(SELECT R1.A,R2.B
FROM R AS Ri, R AS R2
WHERE R1.B=R2.A)
(i) The current contents of relation R are shown below. What are the contents of the view V?
A B
1 2
2 3
2 4
4 5
6 7
6 8
9 10
(ii) The tuples (2,11) and (11,) are now inserted into R. What are the additional tupels that
are inserted in V?
18. (a) Draw the process state transition diagram of an OS in which (i) each process is in one
of the five states: created, ready, running, blocked (i.e. sleep or wait), or terminated, and (ii)
only non-preemptive scheduling is used by the OS. Label the transitions appropriately.
(b) The functionality of atomic TEST-AND-SET assembly language instruction is given by the
following C function.
mt TEST-AND-SET (mt *x)
{
mt y;
Al :y=*x;
A2:*x=i;
A3:return y;
}
(i) Complete the following C functions for implementing code for entering and leaving critical
sections based on the above TEST-AND-SET instruction.
mt mutex=0;
void enter-csQ
{
while (
}
void leave-cs()
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!
{
}
(ii) Is the above solution to the critical section problem deadlock free and starvation-free?
(iii) For the above solution, show by an example that mutual exclusion is not ensured if TEST-
AND-SET instruction is not atomic.
19. A computer system uses 32-bit virtual address, and 32-bit physical address. The physical
memory is byte addressable, and the page size is 4 kbytes. It is decided to use two level page
tables to translate from virtual address to physical address. Equal number of bits should be
used for indexing first level and second level page table, and the size of each page table entry
is 4 bytes.
(a) Give a diagram showing how a virtual address would be translated to a physical address.
(b) What is the number of page table entries that can be contained in each page?
(c) How many bits are available for storing protection and other information in each page table
entry?
20. The following solution to the single producer single consumer problem uses semaphores
for synchronization.
#define BUFFSIZE 100
buffer buf[BUFFSIZE];
mt first=last=0;
semaphore b_full=O;
semaphore b_empty=BUFFSIZE;
void producer()
{
while (1) {
produce an item;
p1
put the item into buff (first);
first=(first+ 1)%BUFFSIZE;
p2
}
}
void consumerQ
{
while (1) {
c1
take the item from buf[last];
last=(last+ 1)%BUFFSIZE;
c2
consume the item;
}
}
(a) Complete the dotted part of the above solution.
(b) Using another semaphore variable, insert one line statement each immediately after p1,
immediately before p2, immediately after ci, and immediately before c2 so that the program
works correctly for multiple procedures and consumers.
21. We require a four state automaton to recognize the regular expression
(a/b)*abb.
(a) Give an NFA for this purpose.
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!
(b) Give a DFA for this purpose.
22. (a) Construct all the parse trees corresponding to i + j * k for the grammar
E - E+E
E - E*E
E - id
(b) In this grammar, what is the precedence of the two operators * and +?
(c) If only one parse tree is desired for any string in the same language, what changes are to
be made so that the resulting LALR(i) grammar is non- ambiguous?
Visit http://groups.yahoo.com/group/OneStopGATE/ for joining the club of GATE Aspirants