Data Structures and Algos

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to Lesson

Podcast

Play an AI-generated podcast conversation about this lesson
Download our mobile app to listen on the go
Get App

Questions and Answers

Which of the following best describes a left-skewed binary tree?

  • A tree sorted in ascending order with smaller values concentrated on the left.
  • A tree where most nodes have a left child but not necessarily a right child. (correct)
  • A tree in which all nodes have either 0 or 2 children.
  • A tree where the height of the left and right subtrees differ by at most 1.

Topological sorting is applicable to any type of graph.

False (B)

In the context of hash tables, what is a 'collision'?

A collision occurs when two different keys produce the same hash value, thus mapping to the same location in the hash table.

In a hash table, the concept of __________ involves using a secondary probing method to find an open slot when a collision occurs.

<p>open addressing</p> Signup and view all the answers

Match the following graph concepts with their definitions:

<p>In-degree = The number of edges directed into a vertex. Out-degree = The number of edges directed out of a vertex. Weighted Graph = A graph where each edge is assigned a numerical weight or cost.</p> Signup and view all the answers

Compared to a B-tree, what is a key distinguishing feature of a B+ tree?

<p>B+ trees only store keys in the leaf nodes, while B-trees store keys in every node. (A)</p> Signup and view all the answers

Red-Black trees are perfectly balanced trees, ensuring the shortest possible search time in all cases.

<p>False (B)</p> Signup and view all the answers

In hashing, what is 'rehashing' and why is it used?

<p>Rehashing is the process of resizing a hash table and recomputing the hash values for all keys to redistribute them across the new table size, typically done when the table becomes too full to maintain efficient performance.</p> Signup and view all the answers

__________ probing in a hash table involves resolving collisions by examining the successive locations in the table until an empty slot is found.

<p>Quadratic</p> Signup and view all the answers

Match the following data structure types with their use cases:

<p>Tree = Hierarchical Data Representation Graph = Network Representation</p> Signup and view all the answers

In data communication, which component is responsible for establishing, maintaining, and terminating connections between devices?

<p>Transport Layer (D)</p> Signup and view all the answers

Congestion in a network always leads to data loss and requires immediate intervention by network administrators.

<p>False (B)</p> Signup and view all the answers

What is the purpose of 'routing' in the context of computer networks?

<p>Routing determines the best path for data packets to travel from a source to a destination across one or more networks.</p> Signup and view all the answers

A __________ is a numerical identifier assigned to a specific process on a device, enabling multiplexing of network connections.

<p>Port Number</p> Signup and view all the answers

Match the following networking terms with their descriptions:

<p>Bandwidth = The maximum rate of data transfer across a network. Protocol = A set of rules governing the exchange of data in a network. Internetworking = Connecting multiple networks to form a larger network.</p> Signup and view all the answers

Which of the following is a characteristic of a Local Area Network (LAN)?

<p>Typically connects devices within a limited area such as a home, school, or office. (C)</p> Signup and view all the answers

The OSI Reference Model and the TCP/IP Model are identical, providing the same layers and functionalities for network communication.

<p>False (B)</p> Signup and view all the answers

What distinguishes Gigabit Ethernet from Fast Ethernet?

<p>Gigabit Ethernet supports data transfer rates up to 1 Gigabit per second (1000 Mbps), whereas Fast Ethernet supports rates up to 100 Mbps.</p> Signup and view all the answers

In the context of UDP, a __________ is a basic unit of data transmission that includes a header with source and destination port numbers, along with the payload.

<p>datagram</p> Signup and view all the answers

Match the following protocol with description:

<p>TCP = A connection-oriented protocol that provides reliable, ordered, and error-checked delivery of data. IPv6 = The most recent version of the Internet Protocol (IP). It provides an identification and location system for computers on networks and routes traffic across the Internet.</p> Signup and view all the answers

Flashcards

What is degree of a tree?

The number of edges incident to a vertex in a tree.

What is left skewed binary tree?

A binary tree where, for every node, all nodes in its left subtree are less than or equal to the node, and all nodes in its right subtree are greater than the node.

What is height balance tree?

A tree in which the heights of the two subtrees of any node differ by at most one.

What is a graph?

A data structure consisting of nodes (vertices) and edges that connect them.

Signup and view all the flashcards

What is topological sorting?

A linear ordering of vertices in a directed graph such that for every directed edge from vertex A to vertex B, vertex A comes before vertex B in the ordering.

Signup and view all the flashcards

What is Bucket?

A section of memory that is used to store records in a hash table.

Signup and view all the flashcards

What is collision?

A situation in which two different keys hash to the same location in a hash table.

Signup and view all the flashcards

Define complete Binary tree.

A binary tree in which every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.

Signup and view all the flashcards

What is weighted graph?

A graph in which each edge is assigned a weight or cost.

Signup and view all the flashcards

Explain open addressing concept in hash table.

A collision resolution technique that involves searching for an empty slot in the hash table when a collision occurs.

Signup and view all the flashcards

Inorder Traversal

Visiting all nodes in order: Left subtree, Root, Right subtree.

Signup and view all the flashcards

Postorder Traversal

Visiting all nodes in order: Left subtree, Right subtree, Root.

Signup and view all the flashcards

What is a B-tree?

A self-balancing binary search tree. A B-tree of order m is defined as a tree with the following properties:

  1. All leaves are at the same level.
  2. Each internal node has at most m children.
  3. Each internal node except the root has at least m/2 children.
  4. The root has at least two children if it is not a leaf node.
  5. Each leaf node contains at least (m-1)/2 keys and at most m-1 keys. When a node becomes full, split it into two nodes.
Signup and view all the flashcards

What is a B+ tree?

A B-tree in which all records are stored at the leaf level. The leaf nodes are linked together to provide ordered sequential access.

Signup and view all the flashcards

What is indegree?

The number of edges coming into a vertex.

Signup and view all the flashcards

What is outdegree?

The number of edges coming out of a vertex.

Signup and view all the flashcards

What is hashing and rehashing?

Process of converting a key into an index. Rehashing: Process of resizing a hash table and redistributing the entries.

Signup and view all the flashcards

What is a Red-Black Tree?

A self-balancing binary search tree where each node has a color attribute. It uses this color to ensure that the tree remains balanced during insertions and deletions.

Signup and view all the flashcards

Study Notes

Data Structures & Algorithms - I (CS-241)

  • Degree refers to the number of children of a node in a tree.
  • A left-skewed binary tree is a binary tree where most nodes have only a left child.
  • Height balance tree inquire about what the height balance tree is
  • Graphs have applications in representing networks and relationships between entities, like social networks or transportation routes.
  • Topological sorting arranges the nodes in a directed acyclic graph in such an order that for every directed edge from node A to node B, node A appears before node B in the ordering.
  • A bucket is a storage unit used in hashing to hold multiple key-value pairs that hash to the same index.
  • A collision happens when two separate keys in a hash table result in the identical index location, need to be settled by collision resolution approaches.
  • A complete binary tree is a binary tree where every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.
  • A weighted graph involves a graph where each edge is given a numerical value or weight representing the "cost" or "distance" of travelling that edge
  • Open addressing concept in hash tables states about resolving collisions by probing or looking over alternate mobile locations in the table until finding an empty slot.
  • Inorder traversal visits the left subtree, then the root, and then the right subtree.
  • Postorder traversal visits the left subtree, then the right subtree, and then the root.
  • B+ trees involve a balanced tree data framework utilized for indexing in databases, where data pointers are stored in the leaf nodes, and internal nodes contain keys for routing.
  • B-trees mean a self-balancing tree data structure that maintains sorted data and allows lookups, insertions, and deletions in logarithmic time.
  • Indegree states about the number of edges going into a vertex.
  • Outdegree describes the number of edges going out of the vertex.
  • Hashing states about changing keys into index locations in a hash table.
  • Rehashing points to the process of resizing the hash table and redistributing its components when the table becomes too full.
  • A Red-Black tree means a self-balancing binary search tree where each node is colored red or black, preserving balance during insertions and losses.

Computer Networks - I (CS-242)

  • Data communication components involve a sender, receiver, transmission medium, message, and protocol.
  • Data communication refers to interchange of data between two devices through transmitting medium
  • Protocols involve the rules that direct data communication between systems.
  • Two channelization protocols are TDMA (Time Division Multiple Access) and FDMA (Frequency Division Multiple Access).
  • Wireless LAN is utilized for internet admittance in houses and offices.
  • Bandwidth is the range of frequencies available for data transmission, determining the maximum data transfer rate.
  • Congestion is a situation in a network when a node or link carries so much data that its quality of service worsens.
  • Routing involves the process of selecting the best path for data packets to travel from source to destination in a network.
  • A Port number is that numerical value recognizing a particular process or service operating on a computer.
  • Internetworking is the method of connecting diverse computer networks by routers that gives end-to-end interaction.
  • A computer network is a combination of devices connected for data sharing.
  • LAN advantages are resource sharing and conversation.
  • The maximum bit rate for a noiseless channel can be calculated using the Nyquist formula.
  • Bluetooth technology is utilized in wireless headphones, hands-free car kits and wireless keyboards/mice.
  • The OSI (Open Systems Interconnection) model is theoretic, with 7 layers.
  • The TCP/IP model is pragmatic, with 4 layers
  • Design issues of the data link layer involve framing, error control, and flow control.
  • The Network layer provides services such as routing, and addressing.
  • Fast Ethernet has a rate of 100 Mbps.
  • Gigabit Ethernet has a rate of 1 Gbps
  • IPv6 protocol eight features involve increased address space, header format, and improved security.
  • TCP supports characteristics like flow control, error detection, and congestion control.
  • The datagram format of UDP includes header and data sections, providing unreliable and connectionless transportation.
  • Pulling means retrieving information for data.

Mathematics (MTC-241)

  • Homogeneous coordinates represent points in a projective space.
  • The area of a transformed object can scale based on the transformation matrix.
  • Foreshortening factor describes the matrix for axonometric projection and how lengths are shortened in the projection.
  • Direction cosines are the cosines of the angles between the plane's normal vector and the coordinate axes.
  • Axonometric parallel projections change with the angle and direction with which the object is projected onto the plane.
  • Projection in three-dimensional space states about mapping 3D points to a 2D plane.
  • Pure rotation in two-dimensional space preserves distance from the origin.
  • The center of the transformed circle can be obtained by applying the translation to the original center.
  • Concatenated transformations combine multiple transformations into a single matrix.
  • A Be'zier curve is determined by control points that explain the shape of the curve.

Mathematics (MTC-242)

  • The Northwest Corner Rule is a method for finding a feasible solution to a transportation problem.
  • A dual form transforms a primal linear programming problem into another form for easier solving.
  • Degeneracy in the transportation problem happens when the number of occupied cells is less than needed.
  • The mathematical formulation of the assignment problem involves defining the objective function and constraints.
  • In linear programming: minimize Z = x₁ + x₂ + x₃ subject to x₁ - 3x₂ + 4x₃ = 5, x₁ - 2x₂ ≤ 3, 2x₁ - x₃ ≥ 4, and x₁, x₂, x₃ ≥ 0.
  • Vogel's Approximation Method (VAM) is a heuristic that computes initial basic feasible solution.
  • An assignment problem seeks the cheapest way to assign personnel to machines.
  • Big-M method comes to solve linear programming problems.
  • Linear programming problems are solved graphically.
  • An optimal solution describes the modified distribution method.
  • The simplex method comes to solve the linear problem.

Electronics (ELC-241)

  • An embedded system involves a dedicated function.
  • SoC stands for System on a Chip, incorporating all components of a system.
  • Raspbian OS is a Linux distribution for Raspberry Pi.
  • Logical operators in Python involve and, or, and not.
  • GPIO-cleanup() Function involves resetting the GPIO pins to default state.
  • Passive Infrared (PIR) sensors describe motion.
  • Single Board Computer: the microchip works as the brain alongside the other components.
  • break statement stops the cycle. pass is a null process. continue statement skips current cycle.
  • try block tests a code. range() generates a series of numbers.

Electronics (ELC-242)

  • Techniques to avoid neighboring base stations interference include frequency reuse and cell splitting.
  • Active RFID tags use a battery.
  • A tree topology is not supported by Zigbee networks.
  • IoT means Internet of Things which involves physical appliances.
  • M2M communication involves appliance-to-appliance.
  • Two internet of things challenges are security and scalability.
  • Wireless technologies like bluetooth and Zigbee may communicate without wires over short distances.
  • Three GPS segments are space, control, and user.
  • GPS error sources include atmospheric delays and clock errors.
  • Wired communication uses physical cables.
  • Wireless communication sends the data without physical wires.
  • "Handoff" is a change in cellular telephony system.

Language Communication - II (AECC-II)

  • This section deals with questions relate to communications and how to express ideas.

Environmental Science (AECC)

  • Air pollution involves releasing contaminants into the atmosphere that risks human health and the environment.
  • Solid waste management involves amassing, transporting, processing, and discarding of solid waste materials.
  • The major aim of the Kyoto Protocol reduces greenhouse gas emissions to combat climate change.
  • Two gases principally responsible for acid rain are sulfur dioxide (SO2) and nitrogen oxides (NOx).
  • Human wildlife conflict involves interaction with wild species.
  • The chipko movement worked for forest conservation.

Studying That Suits You

Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

Quiz Team

Related Documents

More Like This

Graph Algorithms Quiz
5 questions

Graph Algorithms Quiz

CredibleLaboradite avatar
CredibleLaboradite
Graph Algorithms and Data Structures Quiz
10 questions
Data Structures and Algorithms Chapter 5
24 questions
Use Quizgecko on...
Browser
Browser